/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/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:32:59,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:32:59,422 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:32:59,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:32:59,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:32:59,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:32:59,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:32:59,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:32:59,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:32:59,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:32:59,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:32:59,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:32:59,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:32:59,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:32:59,449 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:32:59,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:32:59,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:32:59,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:32:59,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:32:59,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:32:59,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:32:59,451 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:32:59,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:32:59,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:32:59,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:32:59,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:32:59,678 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:32:59,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-13 17:33:00,941 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeac1f46/959a6bfb3bb344a2872668596223cb70/FLAGfc4d154a6 [2025-04-13 17:33:01,112 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:33:01,112 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-13 17:33:01,119 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeac1f46/959a6bfb3bb344a2872668596223cb70/FLAGfc4d154a6 [2025-04-13 17:33:01,991 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aeac1f46/959a6bfb3bb344a2872668596223cb70 [2025-04-13 17:33:01,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:33:01,995 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:33:01,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:33:01,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:33:01,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:33:01,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:33:01" (1/1) ... [2025-04-13 17:33:02,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43551a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02, skipping insertion in model container [2025-04-13 17:33:02,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:33:01" (1/1) ... [2025-04-13 17:33:02,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:33:02,181 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/array-eq-symm.wvr.c[2277,2290] [2025-04-13 17:33:02,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:33:02,195 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:33:02,213 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/array-eq-symm.wvr.c[2277,2290] [2025-04-13 17:33:02,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:33:02,225 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:33:02,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02 WrapperNode [2025-04-13 17:33:02,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:33:02,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:33:02,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:33:02,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:33:02,231 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:33:02" (1/1) ... [2025-04-13 17:33:02,237 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:33:02" (1/1) ... [2025-04-13 17:33:02,251 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 99 [2025-04-13 17:33:02,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:33:02,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:33:02,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:33:02,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:33:02,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,280 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 17:33:02,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:33:02,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:33:02,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:33:02,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:33:02,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (1/1) ... [2025-04-13 17:33:02,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:33:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:02,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:33:02,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:33:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:33:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:33:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:33:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:33:02,353 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:33:02,419 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:33:02,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:33:02,603 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:33:02,604 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:33:02,604 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:33:02,795 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:33:02,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:33:02 BoogieIcfgContainer [2025-04-13 17:33:02,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:33:02,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:33:02,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:33:02,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:33:02,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:33:01" (1/3) ... [2025-04-13 17:33:02,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:33:02, skipping insertion in model container [2025-04-13 17:33:02,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:02" (2/3) ... [2025-04-13 17:33:02,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:33:02, skipping insertion in model container [2025-04-13 17:33:02,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:33:02" (3/3) ... [2025-04-13 17:33:02,802 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-04-13 17:33:02,811 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:33:02,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-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:33:02,813 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:33:02,846 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:33:02,870 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 17:33:02,879 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:33:02,900 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:33:02,909 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;@74cf61ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:33:02,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:33:02,912 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:33:02,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:33:02,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:02,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:02,915 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:33:02,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 47427083, now seen corresponding path program 1 times [2025-04-13 17:33:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:02,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457173376] [2025-04-13 17:33:02,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:02,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:33:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:33:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:03,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:03,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457173376] [2025-04-13 17:33:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457173376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:03,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:03,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:33:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074146683] [2025-04-13 17:33:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:03,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:33:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:03,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:33:03,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:33:03,322 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, 2 states have (on average 7.0) 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:33:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:03,377 INFO L93 Difference]: Finished difference Result 58 states and 127 transitions. [2025-04-13 17:33:03,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:33:03,379 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) 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:33:03,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:03,386 INFO L225 Difference]: With dead ends: 58 [2025-04-13 17:33:03,386 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 17:33:03,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:33:03,391 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:03,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:33:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 17:33:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 17:33:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.269230769230769) internal successors, (118), 52 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2025-04-13 17:33:03,417 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 118 transitions. Word has length 14 [2025-04-13 17:33:03,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:03,417 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 118 transitions. [2025-04-13 17:33:03,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) 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:33:03,419 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 118 transitions. [2025-04-13 17:33:03,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:33:03,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:03,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:03,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:33:03,420 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:33:03,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 723796309, now seen corresponding path program 1 times [2025-04-13 17:33:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:03,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503730111] [2025-04-13 17:33:03,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:33:03,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:33:03,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:03,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:03,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503730111] [2025-04-13 17:33:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503730111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324500520] [2025-04-13 17:33:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:03,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:03,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:03,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:03,595 INFO L87 Difference]: Start difference. First operand 53 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:03,663 INFO L93 Difference]: Finished difference Result 117 states and 261 transitions. [2025-04-13 17:33:03,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:33:03,663 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 17:33:03,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:03,664 INFO L225 Difference]: With dead ends: 117 [2025-04-13 17:33:03,664 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 17:33:03,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:03,665 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:03,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 17:33:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2025-04-13 17:33:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.259259259259259) internal successors, (183), 81 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 183 transitions. [2025-04-13 17:33:03,681 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 183 transitions. Word has length 15 [2025-04-13 17:33:03,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:03,681 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 183 transitions. [2025-04-13 17:33:03,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,681 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 183 transitions. [2025-04-13 17:33:03,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:33:03,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:03,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:03,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:33:03,682 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:33:03,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1469077756, now seen corresponding path program 1 times [2025-04-13 17:33:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:03,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057844164] [2025-04-13 17:33:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:33:03,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:33:03,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:03,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:03,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057844164] [2025-04-13 17:33:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057844164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:03,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:03,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653185412] [2025-04-13 17:33:03,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:03,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:03,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:03,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:03,802 INFO L87 Difference]: Start difference. First operand 82 states and 183 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:03,852 INFO L93 Difference]: Finished difference Result 93 states and 198 transitions. [2025-04-13 17:33:03,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:33:03,852 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 17:33:03,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:03,855 INFO L225 Difference]: With dead ends: 93 [2025-04-13 17:33:03,855 INFO L226 Difference]: Without dead ends: 54 [2025-04-13 17:33:03,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:03,856 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:03,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:33:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-13 17:33:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-13 17:33:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 119 transitions. [2025-04-13 17:33:03,862 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 119 transitions. Word has length 15 [2025-04-13 17:33:03,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:03,862 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 119 transitions. [2025-04-13 17:33:03,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:03,862 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 119 transitions. [2025-04-13 17:33:03,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:33:03,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:03,866 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:33:03,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:33:03,866 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:33:03,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1999604266, now seen corresponding path program 1 times [2025-04-13 17:33:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:03,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310203447] [2025-04-13 17:33:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:33:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:33:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:33:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:03,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310203447] [2025-04-13 17:33:03,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310203447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:03,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:03,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:33:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199626592] [2025-04-13 17:33:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:03,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:33:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:03,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:33:03,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:03,966 INFO L87 Difference]: Start difference. First operand 54 states and 119 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:04,019 INFO L93 Difference]: Finished difference Result 117 states and 260 transitions. [2025-04-13 17:33:04,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:04,019 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 17:33:04,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:04,020 INFO L225 Difference]: With dead ends: 117 [2025-04-13 17:33:04,020 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 17:33:04,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:04,021 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:04,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 6 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:33:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 17:33:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2025-04-13 17:33:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.246913580246914) internal successors, (182), 81 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 182 transitions. [2025-04-13 17:33:04,033 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 182 transitions. Word has length 16 [2025-04-13 17:33:04,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:04,033 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 182 transitions. [2025-04-13 17:33:04,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,033 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 182 transitions. [2025-04-13 17:33:04,034 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:33:04,034 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:04,034 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:33:04,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:33:04,034 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:33:04,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1550081583, now seen corresponding path program 1 times [2025-04-13 17:33:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:04,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980819500] [2025-04-13 17:33:04,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:04,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:33:04,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:33:04,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:04,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:33:04,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:04,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980819500] [2025-04-13 17:33:04,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980819500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:04,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:04,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:33:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353370762] [2025-04-13 17:33:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:04,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:33:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:04,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:33:04,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:04,124 INFO L87 Difference]: Start difference. First operand 82 states and 182 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:04,177 INFO L93 Difference]: Finished difference Result 105 states and 223 transitions. [2025-04-13 17:33:04,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:04,177 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 17:33:04,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:04,178 INFO L225 Difference]: With dead ends: 105 [2025-04-13 17:33:04,178 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 17:33:04,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:04,179 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:04,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:33:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 17:33:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2025-04-13 17:33:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 120 transitions. [2025-04-13 17:33:04,183 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 120 transitions. Word has length 16 [2025-04-13 17:33:04,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:04,183 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 120 transitions. [2025-04-13 17:33:04,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:04,184 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 120 transitions. [2025-04-13 17:33:04,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:33:04,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:04,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:04,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:33:04,184 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:33:04,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1158647797, now seen corresponding path program 1 times [2025-04-13 17:33:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:04,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928044461] [2025-04-13 17:33:04,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:04,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:04,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:33:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:04,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:04,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:04,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928044461] [2025-04-13 17:33:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928044461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:04,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645701883] [2025-04-13 17:33:04,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:04,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:04,637 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:33:04,638 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:33:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:33:04,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:04,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:04,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:04,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:33:04,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:04,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:05,024 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:05,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645701883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:05,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 17:33:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010141797] [2025-04-13 17:33:05,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:05,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:33:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:05,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:33:05,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:05,248 INFO L87 Difference]: Start difference. First operand 55 states and 120 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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:33:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:05,431 INFO L93 Difference]: Finished difference Result 75 states and 158 transitions. [2025-04-13 17:33:05,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:33:05,432 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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 17 [2025-04-13 17:33:05,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:05,433 INFO L225 Difference]: With dead ends: 75 [2025-04-13 17:33:05,433 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 17:33:05,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:33:05,434 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:05,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 17:33:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2025-04-13 17:33:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 54 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:33:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 124 transitions. [2025-04-13 17:33:05,439 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 124 transitions. Word has length 17 [2025-04-13 17:33:05,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:05,439 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 124 transitions. [2025-04-13 17:33:05,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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:33:05,440 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 124 transitions. [2025-04-13 17:33:05,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:33:05,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:05,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:05,447 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:33:05,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 17:33:05,641 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:33:05,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash -413366350, now seen corresponding path program 1 times [2025-04-13 17:33:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:05,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777809964] [2025-04-13 17:33:05,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:05,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:33:05,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:05,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:05,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:06,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777809964] [2025-04-13 17:33:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777809964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:06,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924385241] [2025-04-13 17:33:06,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:06,087 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:33:06,089 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:33:06,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:33:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:06,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:33:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:06,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:06,372 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:06,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924385241] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:06,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:33:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-04-13 17:33:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005886576] [2025-04-13 17:33:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:06,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:33:06,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:06,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:33:06,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:06,547 INFO L87 Difference]: Start difference. First operand 55 states and 124 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:33:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:06,658 INFO L93 Difference]: Finished difference Result 69 states and 147 transitions. [2025-04-13 17:33:06,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:33:06,658 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 17 [2025-04-13 17:33:06,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:06,659 INFO L225 Difference]: With dead ends: 69 [2025-04-13 17:33:06,659 INFO L226 Difference]: Without dead ends: 47 [2025-04-13 17:33:06,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:33:06,660 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:06,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 10 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:33:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-13 17:33:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-13 17:33:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.217391304347826) internal successors, (102), 46 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 102 transitions. [2025-04-13 17:33:06,668 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 102 transitions. Word has length 17 [2025-04-13 17:33:06,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:06,668 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 102 transitions. [2025-04-13 17:33:06,668 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:33:06,669 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 102 transitions. [2025-04-13 17:33:06,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:33:06,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:06,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:06,677 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:33:06,875 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,SelfDestructingSolverStorable6 [2025-04-13 17:33:06,875 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:33:06,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -526275414, now seen corresponding path program 2 times [2025-04-13 17:33:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:06,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217496986] [2025-04-13 17:33:06,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:06,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 17:33:06,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:06,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:06,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:07,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217496986] [2025-04-13 17:33:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217496986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:07,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891807834] [2025-04-13 17:33:07,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:07,203 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:33:07,205 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:33:07,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 17:33:07,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:33:07,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:07,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:07,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:33:07,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:07,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:07,482 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:07,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891807834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:07,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 17:33:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896970981] [2025-04-13 17:33:07,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:07,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:07,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:07,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:07,628 INFO L87 Difference]: Start difference. First operand 47 states and 102 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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:33:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:07,743 INFO L93 Difference]: Finished difference Result 59 states and 128 transitions. [2025-04-13 17:33:07,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:33:07,744 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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 17 [2025-04-13 17:33:07,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:07,744 INFO L225 Difference]: With dead ends: 59 [2025-04-13 17:33:07,744 INFO L226 Difference]: Without dead ends: 52 [2025-04-13 17:33:07,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:07,745 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:07,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-13 17:33:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-13 17:33:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 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:33:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 114 transitions. [2025-04-13 17:33:07,749 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 114 transitions. Word has length 17 [2025-04-13 17:33:07,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:07,749 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 114 transitions. [2025-04-13 17:33:07,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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:33:07,750 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 114 transitions. [2025-04-13 17:33:07,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:33:07,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:07,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:07,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:07,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:07,953 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:33:07,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1559505156, now seen corresponding path program 1 times [2025-04-13 17:33:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:07,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686567784] [2025-04-13 17:33:07,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:07,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:33:07,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:33:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:08,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686567784] [2025-04-13 17:33:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686567784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:08,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016113749] [2025-04-13 17:33:08,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:08,025 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:33:08,026 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:33:08,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:33:08,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:33:08,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:33:08,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016113749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:08,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-13 17:33:08,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509899026] [2025-04-13 17:33:08,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:08,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:33:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:08,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:33:08,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:08,148 INFO L87 Difference]: Start difference. First operand 52 states and 114 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:08,240 INFO L93 Difference]: Finished difference Result 95 states and 212 transitions. [2025-04-13 17:33:08,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:33:08,240 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:33:08,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:08,242 INFO L225 Difference]: With dead ends: 95 [2025-04-13 17:33:08,242 INFO L226 Difference]: Without dead ends: 86 [2025-04-13 17:33:08,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:08,242 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:08,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-13 17:33:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2025-04-13 17:33:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.4153846153846152) internal successors, (157), 65 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 157 transitions. [2025-04-13 17:33:08,250 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 157 transitions. Word has length 18 [2025-04-13 17:33:08,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:08,253 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 157 transitions. [2025-04-13 17:33:08,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,253 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 157 transitions. [2025-04-13 17:33:08,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:33:08,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:08,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:08,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:08,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:08,455 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:33:08,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 864258906, now seen corresponding path program 2 times [2025-04-13 17:33:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:08,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802510092] [2025-04-13 17:33:08,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:08,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 17:33:08,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:33:08,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:08,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:08,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802510092] [2025-04-13 17:33:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802510092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:08,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788509557] [2025-04-13 17:33:08,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:08,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:08,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:08,518 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:33:08,519 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:33:08,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 17:33:08,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:33:08,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:08,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:33:08,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788509557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:08,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-13 17:33:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29697224] [2025-04-13 17:33:08,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:08,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:33:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:08,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:33:08,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:08,630 INFO L87 Difference]: Start difference. First operand 66 states and 157 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:08,716 INFO L93 Difference]: Finished difference Result 115 states and 267 transitions. [2025-04-13 17:33:08,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:33:08,716 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:33:08,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:08,717 INFO L225 Difference]: With dead ends: 115 [2025-04-13 17:33:08,717 INFO L226 Difference]: Without dead ends: 106 [2025-04-13 17:33:08,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:08,717 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:08,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-13 17:33:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2025-04-13 17:33:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.5) internal successors, (215), 86 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2025-04-13 17:33:08,725 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 18 [2025-04-13 17:33:08,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:08,725 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2025-04-13 17:33:08,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:08,725 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2025-04-13 17:33:08,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:33:08,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:08,725 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:08,731 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:33:08,926 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,SelfDestructingSolverStorable9 [2025-04-13 17:33:08,926 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:33:08,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1564897522, now seen corresponding path program 3 times [2025-04-13 17:33:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:08,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722812934] [2025-04-13 17:33:08,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:08,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:33:08,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:33:08,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:08,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:08,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722812934] [2025-04-13 17:33:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722812934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:08,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778515943] [2025-04-13 17:33:08,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:08,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:08,994 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:33:08,996 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:33:09,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:33:09,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:33:09,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:09,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:09,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:33:09,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:09,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778515943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:09,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-13 17:33:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697517004] [2025-04-13 17:33:09,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:09,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:33:09,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:33:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:33:09,161 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 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:33:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:09,367 INFO L93 Difference]: Finished difference Result 353 states and 870 transitions. [2025-04-13 17:33:09,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:33:09,367 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 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 19 [2025-04-13 17:33:09,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:09,369 INFO L225 Difference]: With dead ends: 353 [2025-04-13 17:33:09,369 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 17:33:09,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:09,370 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 114 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:09,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 29 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 17:33:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 135. [2025-04-13 17:33:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.417910447761194) internal successors, (324), 134 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 324 transitions. [2025-04-13 17:33:09,385 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 324 transitions. Word has length 19 [2025-04-13 17:33:09,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:09,386 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 324 transitions. [2025-04-13 17:33:09,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 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:33:09,386 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 324 transitions. [2025-04-13 17:33:09,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:33:09,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:09,386 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:09,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 17:33:09,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:09,587 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:33:09,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1101181397, now seen corresponding path program 4 times [2025-04-13 17:33:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:09,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271494217] [2025-04-13 17:33:09,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:09,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:33:09,601 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:33:09,601 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:09,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:09,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271494217] [2025-04-13 17:33:09,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271494217] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:09,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119847128] [2025-04-13 17:33:09,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:09,659 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:33:09,660 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:33:09,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:33:09,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:33:09,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:09,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:09,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:33:09,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:09,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:33:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119847128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:09,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 17:33:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818344352] [2025-04-13 17:33:09,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:09,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:33:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:09,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:33:09,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:33:09,826 INFO L87 Difference]: Start difference. First operand 135 states and 324 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:09,921 INFO L93 Difference]: Finished difference Result 192 states and 444 transitions. [2025-04-13 17:33:09,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:33:09,922 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:33:09,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:09,923 INFO L225 Difference]: With dead ends: 192 [2025-04-13 17:33:09,923 INFO L226 Difference]: Without dead ends: 133 [2025-04-13 17:33:09,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:33:09,923 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:09,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-13 17:33:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-04-13 17:33:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.4242424242424243) internal successors, (320), 132 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 320 transitions. [2025-04-13 17:33:09,934 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 320 transitions. Word has length 19 [2025-04-13 17:33:09,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:09,934 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 320 transitions. [2025-04-13 17:33:09,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:09,934 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 320 transitions. [2025-04-13 17:33:09,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:33:09,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:09,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:09,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 17:33:10,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:10,135 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:33:10,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash 255730816, now seen corresponding path program 5 times [2025-04-13 17:33:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:10,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464498887] [2025-04-13 17:33:10,136 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:10,141 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 17:33:10,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:33:10,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:10,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:33:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:10,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464498887] [2025-04-13 17:33:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464498887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:10,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910314739] [2025-04-13 17:33:10,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:10,195 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:33:10,197 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:33:10,237 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 17:33:10,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:33:10,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:10,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:33:10,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:33:10,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:33:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910314739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:10,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 17:33:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134714303] [2025-04-13 17:33:10,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:10,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:33:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:33:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:33:10,356 INFO L87 Difference]: Start difference. First operand 133 states and 320 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 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:33:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:10,422 INFO L93 Difference]: Finished difference Result 146 states and 338 transitions. [2025-04-13 17:33:10,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:33:10,423 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 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 20 [2025-04-13 17:33:10,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:10,424 INFO L225 Difference]: With dead ends: 146 [2025-04-13 17:33:10,424 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 17:33:10,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:33:10,424 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:10,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 17:33:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-13 17:33:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.465909090909091) internal successors, (217), 88 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 217 transitions. [2025-04-13 17:33:10,433 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 217 transitions. Word has length 20 [2025-04-13 17:33:10,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:10,433 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 217 transitions. [2025-04-13 17:33:10,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 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:33:10,433 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 217 transitions. [2025-04-13 17:33:10,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:10,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:10,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:10,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 17:33:10,634 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,SelfDestructingSolverStorable12 [2025-04-13 17:33:10,635 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:33:10,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1254119492, now seen corresponding path program 6 times [2025-04-13 17:33:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:10,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919171531] [2025-04-13 17:33:10,635 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:10,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:10,656 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:10,656 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 17:33:10,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:11,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919171531] [2025-04-13 17:33:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919171531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:11,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015480640] [2025-04-13 17:33:11,057 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:11,060 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:33:11,061 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:33:11,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:11,120 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:11,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 17:33:11,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:11,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:33:11,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:11,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:11,473 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:11,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015480640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:11,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-04-13 17:33:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168667862] [2025-04-13 17:33:11,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:11,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:33:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:33:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:33:11,709 INFO L87 Difference]: Start difference. First operand 89 states and 217 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) 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:33:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:12,006 INFO L93 Difference]: Finished difference Result 103 states and 246 transitions. [2025-04-13 17:33:12,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:33:12,006 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) 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 21 [2025-04-13 17:33:12,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:12,007 INFO L225 Difference]: With dead ends: 103 [2025-04-13 17:33:12,007 INFO L226 Difference]: Without dead ends: 95 [2025-04-13 17:33:12,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:33:12,008 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:12,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-13 17:33:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2025-04-13 17:33:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.5113636363636362) internal successors, (221), 88 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 221 transitions. [2025-04-13 17:33:12,016 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 221 transitions. Word has length 21 [2025-04-13 17:33:12,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:12,017 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 221 transitions. [2025-04-13 17:33:12,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) 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:33:12,017 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 221 transitions. [2025-04-13 17:33:12,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:12,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:12,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:12,024 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:33:12,219 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,SelfDestructingSolverStorable13 [2025-04-13 17:33:12,219 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:33:12,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 374768885, now seen corresponding path program 7 times [2025-04-13 17:33:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:12,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294910191] [2025-04-13 17:33:12,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:12,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:33:12,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:12,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:12,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:12,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294910191] [2025-04-13 17:33:12,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294910191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:12,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056157592] [2025-04-13 17:33:12,666 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:12,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:12,668 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:33:12,669 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:33:12,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:33:12,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:12,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:12,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:33:12,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:12,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:13,012 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:13,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056157592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:13,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-13 17:33:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16185668] [2025-04-13 17:33:13,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:13,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:33:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:13,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:33:13,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:33:13,253 INFO L87 Difference]: Start difference. First operand 89 states and 221 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:13,476 INFO L93 Difference]: Finished difference Result 102 states and 239 transitions. [2025-04-13 17:33:13,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:33:13,477 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 17:33:13,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:13,478 INFO L225 Difference]: With dead ends: 102 [2025-04-13 17:33:13,478 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 17:33:13,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:33:13,478 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:13,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 17:33:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-13 17:33:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.465909090909091) internal successors, (217), 88 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 217 transitions. [2025-04-13 17:33:13,485 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 217 transitions. Word has length 21 [2025-04-13 17:33:13,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:13,485 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 217 transitions. [2025-04-13 17:33:13,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:13,485 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 217 transitions. [2025-04-13 17:33:13,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:13,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:13,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:13,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:13,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 17:33:13,686 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:33:13,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1169644570, now seen corresponding path program 8 times [2025-04-13 17:33:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:13,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124383960] [2025-04-13 17:33:13,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:13,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:13,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:13,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:13,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:33:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:13,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124383960] [2025-04-13 17:33:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124383960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:13,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278432573] [2025-04-13 17:33:13,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:13,967 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:33:13,969 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:33:14,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:14,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:14,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:14,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:14,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:33:14,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:14,084 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 15 treesize of output 1 [2025-04-13 17:33:14,139 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 8 treesize of output 1 [2025-04-13 17:33:14,175 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 15 treesize of output 1 [2025-04-13 17:33:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:14,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:14,658 INFO L325 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2025-04-13 17:33:14,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2025-04-13 17:33:14,703 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-13 17:33:14,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-13 17:33:14,739 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-13 17:33:14,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-13 17:33:14,906 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~i_AB~0 4)) (.cse13 (* c_~i_BA~0 4)) (.cse5 (= c_~i_BA~0 0))) (let ((.cse6 (not .cse5)) (.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse13 4)) (.cse8 (+ 4 .cse12)) (.cse10 (+ 4 .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (= c_~i_AB~0 0))) (and (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (select (store |c_#memory_int#1| v_subst_1 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select v_arrayElimArr_1 4) (select .cse0 .cse1)) (not (= (select v_arrayElimArr_1 .cse2) (select .cse0 .cse3)))))) (not .cse4)) (or (and (or .cse5 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_4 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_4 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select v_arrayElimArr_2 .cse2))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_3 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_3 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select v_arrayElimArr_2 4)))) .cse6)) (< c_~i_AB~0 1)) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_7 Int)) (let ((.cse7 (select (store |c_#memory_int#1| v_subst_7 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse7 .cse10))) (or (not (= (select v_arrayElimArr_1 .cse2) (select .cse7 .cse3))) (= (select v_arrayElimArr_1 .cse8) .cse9) (= (select v_arrayElimArr_1 4) .cse9))))) (or (< (+ c_~i_AB~0 1) c_~An~0) (and (or .cse5 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int)) (not (= (select v_arrayElimArr_3 .cse2) (select (select (store |c_#memory_int#1| v_subst_5 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3))))) (or .cse6 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_6 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select v_arrayElimArr_3 4))))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int)) (let ((.cse11 (select (store |c_#memory_int#1| v_subst_2 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse11 .cse3) (select v_arrayElimArr_1 .cse2))) (= (select v_arrayElimArr_1 .cse8) (select .cse11 .cse10))))) .cse4)))) is different from false [2025-04-13 17:33:14,934 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:14,935 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:33:14,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:33:14,943 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:33:14,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 4 [2025-04-13 17:33:14,949 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:14,949 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:33:14,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:33:14,956 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:14,956 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-13 17:33:14,964 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:33:14,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 64 [2025-04-13 17:33:14,969 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:33:14,995 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-13 17:33:14,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 61 treesize of output 72 [2025-04-13 17:33:15,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:15,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:33:15,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:33:15,042 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:15,043 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:33:15,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:33:15,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:15,050 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-04-13 17:33:15,061 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:33:15,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 75 [2025-04-13 17:33:15,066 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:33:15,092 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 17:33:15,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 72 treesize of output 78 [2025-04-13 17:33:15,123 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 17:33:15,123 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2025-04-13 17:33:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 17:33:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278432573] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:15,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2025-04-13 17:33:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583673521] [2025-04-13 17:33:15,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:15,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:33:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:15,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:33:15,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=700, Unknown=2, NotChecked=54, Total=870 [2025-04-13 17:33:15,186 INFO L87 Difference]: Start difference. First operand 89 states and 217 transitions. Second operand has 30 states, 30 states have (on average 1.8) 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:33:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:15,640 INFO L93 Difference]: Finished difference Result 124 states and 294 transitions. [2025-04-13 17:33:15,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:33:15,641 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) 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 21 [2025-04-13 17:33:15,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:15,642 INFO L225 Difference]: With dead ends: 124 [2025-04-13 17:33:15,642 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 17:33:15,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=1035, Unknown=2, NotChecked=66, Total=1260 [2025-04-13 17:33:15,642 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:15,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 471 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2025-04-13 17:33:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 17:33:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2025-04-13 17:33:15,651 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:33:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 245 transitions. [2025-04-13 17:33:15,651 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 245 transitions. Word has length 21 [2025-04-13 17:33:15,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:15,651 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 245 transitions. [2025-04-13 17:33:15,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) 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:33:15,651 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 245 transitions. [2025-04-13 17:33:15,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:15,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:15,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:15,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:15,852 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,SelfDestructingSolverStorable15 [2025-04-13 17:33:15,852 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:33:15,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1225055830, now seen corresponding path program 9 times [2025-04-13 17:33:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:15,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093066501] [2025-04-13 17:33:15,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:15,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:15,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:15,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:15,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:16,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093066501] [2025-04-13 17:33:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093066501] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:16,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149307725] [2025-04-13 17:33:16,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:16,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:16,182 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:33:16,183 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:33:16,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:16,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:16,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:16,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:16,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:33:16,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:16,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:16,564 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:16,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149307725] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:16,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-04-13 17:33:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126800148] [2025-04-13 17:33:16,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:16,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:33:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:16,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:33:16,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:33:16,781 INFO L87 Difference]: Start difference. First operand 98 states and 245 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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:33:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:16,986 INFO L93 Difference]: Finished difference Result 107 states and 259 transitions. [2025-04-13 17:33:16,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:33:16,987 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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 21 [2025-04-13 17:33:16,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:16,988 INFO L225 Difference]: With dead ends: 107 [2025-04-13 17:33:16,988 INFO L226 Difference]: Without dead ends: 99 [2025-04-13 17:33:16,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:33:16,988 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:16,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-13 17:33:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-04-13 17:33:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.489130434782609) internal successors, (229), 92 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 229 transitions. [2025-04-13 17:33:16,997 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 229 transitions. Word has length 21 [2025-04-13 17:33:16,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:16,997 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 229 transitions. [2025-04-13 17:33:16,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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:33:16,997 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 229 transitions. [2025-04-13 17:33:16,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:16,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:16,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:17,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:17,198 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,SelfDestructingSolverStorable16 [2025-04-13 17:33:17,198 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:33:17,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1139168377, now seen corresponding path program 10 times [2025-04-13 17:33:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:17,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957643038] [2025-04-13 17:33:17,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:17,203 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:17,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:17,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:17,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:17,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957643038] [2025-04-13 17:33:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957643038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:17,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867533084] [2025-04-13 17:33:17,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:17,365 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:33:17,367 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:33:17,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:17,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:17,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:17,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:33:17,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:17,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:17,553 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:17,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867533084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:17,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 12 [2025-04-13 17:33:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462981990] [2025-04-13 17:33:17,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:17,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:33:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:17,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:33:17,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:33:17,599 INFO L87 Difference]: Start difference. First operand 93 states and 229 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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:33:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:17,750 INFO L93 Difference]: Finished difference Result 135 states and 309 transitions. [2025-04-13 17:33:17,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:33:17,750 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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 21 [2025-04-13 17:33:17,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:17,751 INFO L225 Difference]: With dead ends: 135 [2025-04-13 17:33:17,751 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 17:33:17,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:33:17,751 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:17,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 17:33:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2025-04-13 17:33:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.489130434782609) internal successors, (229), 92 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 229 transitions. [2025-04-13 17:33:17,761 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 229 transitions. Word has length 21 [2025-04-13 17:33:17,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:17,761 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 229 transitions. [2025-04-13 17:33:17,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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:33:17,762 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 229 transitions. [2025-04-13 17:33:17,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:17,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:17,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:17,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:17,962 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,SelfDestructingSolverStorable17 [2025-04-13 17:33:17,963 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:33:17,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1797867148, now seen corresponding path program 11 times [2025-04-13 17:33:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:17,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440911141] [2025-04-13 17:33:17,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:17,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:17,973 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:17,973 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:18,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440911141] [2025-04-13 17:33:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440911141] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:18,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789362335] [2025-04-13 17:33:18,132 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:18,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:18,134 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:33:18,136 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:33:18,178 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:18,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:18,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:18,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:18,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:33:18,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:33:18,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:18,403 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:33:18,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:33:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789362335] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:18,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:18,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 17 [2025-04-13 17:33:18,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941926061] [2025-04-13 17:33:18,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:18,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:33:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:18,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:33:18,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:18,448 INFO L87 Difference]: Start difference. First operand 93 states and 229 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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:33:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:18,694 INFO L93 Difference]: Finished difference Result 118 states and 268 transitions. [2025-04-13 17:33:18,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:33:18,694 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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 21 [2025-04-13 17:33:18,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:18,695 INFO L225 Difference]: With dead ends: 118 [2025-04-13 17:33:18,695 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 17:33:18,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:33:18,695 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:18,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 34 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 17:33:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-04-13 17:33:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.4285714285714284) internal successors, (204), 84 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 204 transitions. [2025-04-13 17:33:18,705 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 204 transitions. Word has length 21 [2025-04-13 17:33:18,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:18,705 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 204 transitions. [2025-04-13 17:33:18,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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:33:18,705 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 204 transitions. [2025-04-13 17:33:18,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:18,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:18,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:18,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:18,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:18,906 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:33:18,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash -24706828, now seen corresponding path program 12 times [2025-04-13 17:33:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:18,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222266106] [2025-04-13 17:33:18,907 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:18,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 17:33:18,919 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:18,920 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:33:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:19,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222266106] [2025-04-13 17:33:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222266106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:19,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109035785] [2025-04-13 17:33:19,143 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:19,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:19,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:19,145 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:33:19,146 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:33:19,190 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 17:33:19,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:19,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:19,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:33:19,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:19,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:19,541 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:19,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109035785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:19,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:19,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2025-04-13 17:33:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701669978] [2025-04-13 17:33:19,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:19,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:33:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:19,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:33:19,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:33:19,743 INFO L87 Difference]: Start difference. First operand 85 states and 204 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:19,977 INFO L93 Difference]: Finished difference Result 101 states and 238 transitions. [2025-04-13 17:33:19,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:33:19,977 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 17:33:19,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:19,978 INFO L225 Difference]: With dead ends: 101 [2025-04-13 17:33:19,978 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 17:33:19,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:33:19,978 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:19,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 17:33:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2025-04-13 17:33:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.4302325581395348) internal successors, (209), 86 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 209 transitions. [2025-04-13 17:33:19,988 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 209 transitions. Word has length 21 [2025-04-13 17:33:19,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:19,989 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 209 transitions. [2025-04-13 17:33:19,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:19,989 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 209 transitions. [2025-04-13 17:33:19,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:19,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:19,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:19,995 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:33:20,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:20,193 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:33:20,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash -110594281, now seen corresponding path program 13 times [2025-04-13 17:33:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:20,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734032371] [2025-04-13 17:33:20,193 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:20,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:33:20,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:20,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:20,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:20,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734032371] [2025-04-13 17:33:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734032371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:20,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926785095] [2025-04-13 17:33:20,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:20,547 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:33:20,547 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:33:20,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:33:20,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:20,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:20,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:20,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:33:20,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:20,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:20,913 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:20,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926785095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:21,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-13 17:33:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274495112] [2025-04-13 17:33:21,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:21,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:33:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:21,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:33:21,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:33:21,163 INFO L87 Difference]: Start difference. First operand 87 states and 209 transitions. Second operand has 30 states, 30 states have (on average 1.9) 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:33:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:21,449 INFO L93 Difference]: Finished difference Result 109 states and 261 transitions. [2025-04-13 17:33:21,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:33:21,450 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) 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 21 [2025-04-13 17:33:21,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:21,450 INFO L225 Difference]: With dead ends: 109 [2025-04-13 17:33:21,450 INFO L226 Difference]: Without dead ends: 99 [2025-04-13 17:33:21,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:33:21,451 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:21,451 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 56 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-13 17:33:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-04-13 17:33:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.4318181818181817) internal successors, (214), 88 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 214 transitions. [2025-04-13 17:33:21,462 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 214 transitions. Word has length 21 [2025-04-13 17:33:21,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:21,462 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 214 transitions. [2025-04-13 17:33:21,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) 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:33:21,462 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 214 transitions. [2025-04-13 17:33:21,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:33:21,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:21,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:21,468 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:33:21,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:21,663 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:33:21,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1552338165, now seen corresponding path program 14 times [2025-04-13 17:33:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:21,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194754440] [2025-04-13 17:33:21,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:21,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:21,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:21,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:21,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194754440] [2025-04-13 17:33:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194754440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:21,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35022560] [2025-04-13 17:33:21,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:21,966 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:33:21,967 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:33:22,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:33:22,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:33:22,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:22,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:33:22,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:22,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:22,354 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:22,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35022560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:22,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:22,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-13 17:33:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931128291] [2025-04-13 17:33:22,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:22,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:33:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:22,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:33:22,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:33:22,537 INFO L87 Difference]: Start difference. First operand 89 states and 214 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) 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:33:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:22,813 INFO L93 Difference]: Finished difference Result 106 states and 252 transitions. [2025-04-13 17:33:22,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:33:22,813 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) 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 21 [2025-04-13 17:33:22,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:22,814 INFO L225 Difference]: With dead ends: 106 [2025-04-13 17:33:22,814 INFO L226 Difference]: Without dead ends: 99 [2025-04-13 17:33:22,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:33:22,816 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:22,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 57 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-13 17:33:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2025-04-13 17:33:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.4301075268817205) internal successors, (226), 93 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 226 transitions. [2025-04-13 17:33:22,830 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 226 transitions. Word has length 21 [2025-04-13 17:33:22,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:22,830 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 226 transitions. [2025-04-13 17:33:22,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) 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:33:22,830 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 226 transitions. [2025-04-13 17:33:22,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:33:22,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:22,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:22,838 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:33:23,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:23,031 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:33:23,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -224160405, now seen corresponding path program 15 times [2025-04-13 17:33:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:23,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995103386] [2025-04-13 17:33:23,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:23,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:23,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:23,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:23,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:23,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995103386] [2025-04-13 17:33:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995103386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:23,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411879491] [2025-04-13 17:33:23,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:23,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:23,094 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:33:23,096 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:33:23,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:23,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:23,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:33:23,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:23,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:33:23,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411879491] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:23,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 8 [2025-04-13 17:33:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997020623] [2025-04-13 17:33:23,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:23,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:33:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:23,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:33:23,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:23,244 INFO L87 Difference]: Start difference. First operand 94 states and 226 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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:33:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:23,383 INFO L93 Difference]: Finished difference Result 164 states and 381 transitions. [2025-04-13 17:33:23,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:33:23,383 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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 22 [2025-04-13 17:33:23,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:23,384 INFO L225 Difference]: With dead ends: 164 [2025-04-13 17:33:23,384 INFO L226 Difference]: Without dead ends: 155 [2025-04-13 17:33:23,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:23,385 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:23,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-13 17:33:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2025-04-13 17:33:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.5652173913043477) internal successors, (295), 115 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 295 transitions. [2025-04-13 17:33:23,403 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 295 transitions. Word has length 22 [2025-04-13 17:33:23,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:23,403 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 295 transitions. [2025-04-13 17:33:23,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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:33:23,404 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 295 transitions. [2025-04-13 17:33:23,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:33:23,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:23,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:23,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:23,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:23,605 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:33:23,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 953408875, now seen corresponding path program 16 times [2025-04-13 17:33:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:23,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291790043] [2025-04-13 17:33:23,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:23,610 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:23,613 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:23,613 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:23,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:23,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291790043] [2025-04-13 17:33:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291790043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:23,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836174828] [2025-04-13 17:33:23,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:23,651 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:33:23,652 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:33:23,704 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:23,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:23,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:23,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:33:23,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836174828] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:23,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:23,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-13 17:33:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127228260] [2025-04-13 17:33:23,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:23,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:33:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:33:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:23,791 INFO L87 Difference]: Start difference. First operand 116 states and 295 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:33:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:23,933 INFO L93 Difference]: Finished difference Result 186 states and 449 transitions. [2025-04-13 17:33:23,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:33:23,934 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 22 [2025-04-13 17:33:23,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:23,935 INFO L225 Difference]: With dead ends: 186 [2025-04-13 17:33:23,935 INFO L226 Difference]: Without dead ends: 177 [2025-04-13 17:33:23,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:23,935 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:23,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-13 17:33:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129. [2025-04-13 17:33:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.6875) internal successors, (344), 128 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 344 transitions. [2025-04-13 17:33:23,953 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 344 transitions. Word has length 22 [2025-04-13 17:33:23,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:23,953 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 344 transitions. [2025-04-13 17:33:23,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:33:23,953 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 344 transitions. [2025-04-13 17:33:23,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:33:23,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:23,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:23,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:24,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:24,154 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:33:24,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 876770415, now seen corresponding path program 17 times [2025-04-13 17:33:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:24,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168444767] [2025-04-13 17:33:24,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:24,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:24,166 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:24,166 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:24,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:24,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168444767] [2025-04-13 17:33:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168444767] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:24,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110836042] [2025-04-13 17:33:24,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:24,203 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:33:24,205 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:33:24,256 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:33:24,273 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:24,274 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:24,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:33:24,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110836042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:24,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-13 17:33:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721756599] [2025-04-13 17:33:24,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:24,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:33:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:24,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:33:24,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:24,340 INFO L87 Difference]: Start difference. First operand 129 states and 344 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:33:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:24,455 INFO L93 Difference]: Finished difference Result 200 states and 504 transitions. [2025-04-13 17:33:24,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:33:24,455 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 22 [2025-04-13 17:33:24,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:24,456 INFO L225 Difference]: With dead ends: 200 [2025-04-13 17:33:24,456 INFO L226 Difference]: Without dead ends: 191 [2025-04-13 17:33:24,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:33:24,457 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:24,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-13 17:33:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 159. [2025-04-13 17:33:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.721518987341772) internal successors, (430), 158 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 430 transitions. [2025-04-13 17:33:24,479 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 430 transitions. Word has length 22 [2025-04-13 17:33:24,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:24,479 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 430 transitions. [2025-04-13 17:33:24,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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:33:24,479 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 430 transitions. [2025-04-13 17:33:24,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:24,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:24,479 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:24,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:24,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 17:33:24,680 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:33:24,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1611099211, now seen corresponding path program 18 times [2025-04-13 17:33:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:24,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235843830] [2025-04-13 17:33:24,680 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:24,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-13 17:33:24,689 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:24,690 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:24,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:24,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235843830] [2025-04-13 17:33:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235843830] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:24,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295302433] [2025-04-13 17:33:24,753 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:24,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:24,755 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:33:24,756 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:33:24,801 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-13 17:33:24,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:24,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:24,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:24,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:33:24,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295302433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:24,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-13 17:33:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202053994] [2025-04-13 17:33:24,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:24,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:33:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:24,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:33:24,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:33:24,946 INFO L87 Difference]: Start difference. First operand 159 states and 430 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 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:33:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:25,247 INFO L93 Difference]: Finished difference Result 665 states and 1784 transitions. [2025-04-13 17:33:25,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:33:25,247 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 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 23 [2025-04-13 17:33:25,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:25,250 INFO L225 Difference]: With dead ends: 665 [2025-04-13 17:33:25,250 INFO L226 Difference]: Without dead ends: 525 [2025-04-13 17:33:25,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:33:25,251 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 157 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:25,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 41 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-04-13 17:33:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 236. [2025-04-13 17:33:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.5829787234042554) internal successors, (607), 235 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 607 transitions. [2025-04-13 17:33:25,287 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 607 transitions. Word has length 23 [2025-04-13 17:33:25,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:25,287 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 607 transitions. [2025-04-13 17:33:25,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 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:33:25,287 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 607 transitions. [2025-04-13 17:33:25,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:25,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:25,287 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:25,293 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:33:25,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 17:33:25,488 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:33:25,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1639800220, now seen corresponding path program 19 times [2025-04-13 17:33:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:25,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554975286] [2025-04-13 17:33:25,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:25,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:25,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:25,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:25,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554975286] [2025-04-13 17:33:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554975286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:25,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748397931] [2025-04-13 17:33:25,564 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:25,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:25,566 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:33:25,568 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:33:25,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:25,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:25,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:25,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:25,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:33:25,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:25,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748397931] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:25,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-13 17:33:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888934149] [2025-04-13 17:33:25,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:25,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:33:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:25,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:33:25,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:33:25,773 INFO L87 Difference]: Start difference. First operand 236 states and 607 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:33:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:26,009 INFO L93 Difference]: Finished difference Result 375 states and 898 transitions. [2025-04-13 17:33:26,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:33:26,009 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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 23 [2025-04-13 17:33:26,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:26,011 INFO L225 Difference]: With dead ends: 375 [2025-04-13 17:33:26,011 INFO L226 Difference]: Without dead ends: 163 [2025-04-13 17:33:26,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:33:26,011 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 94 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:26,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 49 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-13 17:33:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-04-13 17:33:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.7) internal successors, (432), 160 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 432 transitions. [2025-04-13 17:33:26,033 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 432 transitions. Word has length 23 [2025-04-13 17:33:26,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:26,034 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 432 transitions. [2025-04-13 17:33:26,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:33:26,034 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 432 transitions. [2025-04-13 17:33:26,034 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:26,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:26,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:26,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 17:33:26,235 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:33:26,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1190803947, now seen corresponding path program 20 times [2025-04-13 17:33:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:26,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103350989] [2025-04-13 17:33:26,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:26,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:26,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:26,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:26,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:26,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:26,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103350989] [2025-04-13 17:33:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103350989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:26,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923185307] [2025-04-13 17:33:26,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:26,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:26,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:26,527 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:33:26,528 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:33:26,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:26,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:26,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:26,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:26,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:33:26,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:26,656 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 15 treesize of output 1 [2025-04-13 17:33:26,703 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 8 treesize of output 1 [2025-04-13 17:33:26,730 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 8 treesize of output 1 [2025-04-13 17:33:26,756 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 15 treesize of output 1 [2025-04-13 17:33:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:26,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:27,267 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 17:33:27,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 17:33:27,306 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:33:27,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:33:27,325 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:33:27,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:33:27,675 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~i_BA~0 4)) (.cse8 (= c_~i_BA~0 0)) (.cse13 (* c_~i_AB~0 4))) (let ((.cse5 (+ 8 .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ 8 .cse13)) (.cse9 (not .cse8)) (.cse4 (+ .cse12 8)) (.cse3 (+ .cse12 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (= c_~i_AB~0 0))) (and (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_9 Int)) (let ((.cse2 (select (store |c_#memory_int#1| v_subst_9 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 .cse5))) (or (= .cse0 (select v_arrayElimArr_11 8)) (= .cse0 (select v_arrayElimArr_11 .cse1)) (not (= (select .cse2 .cse3) (select v_arrayElimArr_11 .cse4))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_12 Int)) (let ((.cse6 (select (store |c_#memory_int#1| v_subst_12 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse6 .cse5) (select v_arrayElimArr_11 .cse1)) (not (= (select .cse6 .cse3) (select v_arrayElimArr_11 .cse4)))))) .cse7) (or (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_subst_10 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_10 v_arrayElimArr_13) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select v_arrayElimArr_13 .cse4)))) .cse8) (or .cse9 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_subst_11 Int)) (not (= (select v_arrayElimArr_13 8) (select (select (store |c_#memory_int#1| v_subst_11 v_arrayElimArr_13) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10)))))) (< c_~i_AB~0 1)) (or (< (+ c_~i_AB~0 2) c_~An~0) (and (or .cse9 (forall ((v_subst_14 Int) (v_arrayElimArr_12 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| v_subst_14 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10) (select v_arrayElimArr_12 8))))) (or (forall ((v_subst_13 Int) (v_arrayElimArr_12 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| v_subst_13 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select v_arrayElimArr_12 .cse4)))) .cse8))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_8 Int)) (let ((.cse11 (select (store |c_#memory_int#1| v_subst_8 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select v_arrayElimArr_11 .cse4) (select .cse11 .cse3))) (= (select v_arrayElimArr_11 8) (select .cse11 .cse10))))) (not .cse7))))) is different from false [2025-04-13 17:33:27,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,698 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-13 17:33:27,704 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:33:27,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 64 [2025-04-13 17:33:27,718 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:33:27,739 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-13 17:33:27,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 61 treesize of output 72 [2025-04-13 17:33:27,770 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,770 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:33:27,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:33:27,778 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:33:27,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 17:33:27,789 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,789 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:33:27,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:33:27,795 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:33:27,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 4 [2025-04-13 17:33:27,803 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:33:27,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:33:27,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,813 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:33:27,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:33:27,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:27,822 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 17:33:27,828 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:33:27,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-13 17:33:27,831 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:33:27,831 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:33:27,874 INFO L325 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2025-04-13 17:33:27,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2025-04-13 17:33:27,979 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 17:33:27,979 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-13 17:33:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-13 17:33:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923185307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:28,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 39 [2025-04-13 17:33:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060520972] [2025-04-13 17:33:28,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:28,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:33:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:28,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:33:28,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=4, NotChecked=74, Total=1560 [2025-04-13 17:33:28,082 INFO L87 Difference]: Start difference. First operand 161 states and 432 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:28,649 INFO L93 Difference]: Finished difference Result 189 states and 494 transitions. [2025-04-13 17:33:28,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:33:28,649 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:33:28,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:28,650 INFO L225 Difference]: With dead ends: 189 [2025-04-13 17:33:28,650 INFO L226 Difference]: Without dead ends: 181 [2025-04-13 17:33:28,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=4, NotChecked=88, Total=2162 [2025-04-13 17:33:28,651 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:28,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 88 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2025-04-13 17:33:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-13 17:33:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2025-04-13 17:33:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.725) internal successors, (436), 160 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 436 transitions. [2025-04-13 17:33:28,675 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 436 transitions. Word has length 25 [2025-04-13 17:33:28,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:28,675 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 436 transitions. [2025-04-13 17:33:28,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:28,675 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 436 transitions. [2025-04-13 17:33:28,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:28,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:28,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:28,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:28,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:28,876 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:33:28,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 146736082, now seen corresponding path program 21 times [2025-04-13 17:33:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:28,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092819656] [2025-04-13 17:33:28,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:28,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:28,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:28,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:29,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092819656] [2025-04-13 17:33:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092819656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:29,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381128418] [2025-04-13 17:33:29,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:29,269 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:33:29,270 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:33:29,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:29,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:29,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:29,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:33:29,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:29,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:29,824 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:29,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381128418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:30,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 38 [2025-04-13 17:33:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039883323] [2025-04-13 17:33:30,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:30,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:33:30,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:30,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:33:30,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:33:30,125 INFO L87 Difference]: Start difference. First operand 161 states and 436 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 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:33:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:32,030 INFO L93 Difference]: Finished difference Result 554 states and 1459 transitions. [2025-04-13 17:33:32,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:33:32,030 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 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 25 [2025-04-13 17:33:32,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:32,032 INFO L225 Difference]: With dead ends: 554 [2025-04-13 17:33:32,032 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 17:33:32,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=759, Invalid=4497, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:33:32,034 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 212 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:32,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 177 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:33:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 17:33:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 249. [2025-04-13 17:33:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.629032258064516) internal successors, (652), 248 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 652 transitions. [2025-04-13 17:33:32,080 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 652 transitions. Word has length 25 [2025-04-13 17:33:32,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:32,080 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 652 transitions. [2025-04-13 17:33:32,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 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:33:32,080 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 652 transitions. [2025-04-13 17:33:32,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:32,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:32,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:32,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 17:33:32,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 17:33:32,282 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:33:32,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 818944491, now seen corresponding path program 22 times [2025-04-13 17:33:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:32,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987916683] [2025-04-13 17:33:32,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:32,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:32,297 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:32,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:32,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987916683] [2025-04-13 17:33:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987916683] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:32,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522269757] [2025-04-13 17:33:32,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:32,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:32,485 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:33:32,485 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:33:32,538 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:32,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:32,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:32,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:32,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:33:32,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:32,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:32,738 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:33:32,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:33:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522269757] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:32,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 18 [2025-04-13 17:33:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79444025] [2025-04-13 17:33:32,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:32,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:33:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:32,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:33:32,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:33:32,791 INFO L87 Difference]: Start difference. First operand 249 states and 652 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:33,279 INFO L93 Difference]: Finished difference Result 385 states and 967 transitions. [2025-04-13 17:33:33,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:33:33,279 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:33:33,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:33,281 INFO L225 Difference]: With dead ends: 385 [2025-04-13 17:33:33,281 INFO L226 Difference]: Without dead ends: 324 [2025-04-13 17:33:33,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:33:33,282 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:33,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 49 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-13 17:33:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 235. [2025-04-13 17:33:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.5598290598290596) internal successors, (599), 234 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 599 transitions. [2025-04-13 17:33:33,324 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 599 transitions. Word has length 25 [2025-04-13 17:33:33,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:33,324 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 599 transitions. [2025-04-13 17:33:33,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,324 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 599 transitions. [2025-04-13 17:33:33,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:33,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:33,325 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:33,331 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:33:33,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:33,525 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:33:33,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:33,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1957070262, now seen corresponding path program 23 times [2025-04-13 17:33:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:33,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138290849] [2025-04-13 17:33:33,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:33,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:33,536 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:33,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:33:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:33,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138290849] [2025-04-13 17:33:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138290849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:33,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561308042] [2025-04-13 17:33:33,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:33,778 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:33:33,779 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:33:33,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:33,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:33,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:33:33,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:33,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:33:33,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 17:33:34,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:34,049 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:34,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561308042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:34,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 5] total 17 [2025-04-13 17:33:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136118374] [2025-04-13 17:33:34,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:34,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:33:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:34,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:33:34,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:34,080 INFO L87 Difference]: Start difference. First operand 235 states and 599 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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:33:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:34,419 INFO L93 Difference]: Finished difference Result 320 states and 763 transitions. [2025-04-13 17:33:34,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:33:34,419 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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 25 [2025-04-13 17:33:34,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:34,421 INFO L225 Difference]: With dead ends: 320 [2025-04-13 17:33:34,421 INFO L226 Difference]: Without dead ends: 311 [2025-04-13 17:33:34,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:33:34,421 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:34,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 57 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-13 17:33:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 235. [2025-04-13 17:33:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.5598290598290596) internal successors, (599), 234 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 599 transitions. [2025-04-13 17:33:34,464 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 599 transitions. Word has length 25 [2025-04-13 17:33:34,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:34,464 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 599 transitions. [2025-04-13 17:33:34,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 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:33:34,464 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 599 transitions. [2025-04-13 17:33:34,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:34,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:34,464 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:34,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 17:33:34,665 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,SelfDestructingSolverStorable30 [2025-04-13 17:33:34,665 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:33:34,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2003232529, now seen corresponding path program 24 times [2025-04-13 17:33:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:34,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074791145] [2025-04-13 17:33:34,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:34,670 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:34,681 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:34,681 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:34,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:35,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074791145] [2025-04-13 17:33:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074791145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:35,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953847526] [2025-04-13 17:33:35,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:35,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:35,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:35,041 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:33:35,042 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:33:35,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:35,113 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:35,113 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:35,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:35,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 17:33:35,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:35,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:35,485 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:35,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953847526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:35,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 39 [2025-04-13 17:33:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179153684] [2025-04-13 17:33:35,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:35,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:33:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:35,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:33:35,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:33:35,807 INFO L87 Difference]: Start difference. First operand 235 states and 599 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 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:33:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:36,190 INFO L93 Difference]: Finished difference Result 253 states and 633 transitions. [2025-04-13 17:33:36,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:33:36,190 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 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 25 [2025-04-13 17:33:36,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:36,191 INFO L225 Difference]: With dead ends: 253 [2025-04-13 17:33:36,191 INFO L226 Difference]: Without dead ends: 239 [2025-04-13 17:33:36,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=1896, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:33:36,192 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:36,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 64 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-13 17:33:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-04-13 17:33:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.5504201680672267) internal successors, (607), 238 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 607 transitions. [2025-04-13 17:33:36,239 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 607 transitions. Word has length 25 [2025-04-13 17:33:36,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:36,239 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 607 transitions. [2025-04-13 17:33:36,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 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:33:36,239 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 607 transitions. [2025-04-13 17:33:36,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:36,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:36,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:36,246 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:33:36,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:36,441 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:33:36,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash -285483469, now seen corresponding path program 25 times [2025-04-13 17:33:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:36,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982472072] [2025-04-13 17:33:36,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:36,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:36,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:36,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:36,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:36,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982472072] [2025-04-13 17:33:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982472072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:36,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982074331] [2025-04-13 17:33:36,858 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:36,860 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:33:36,862 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:33:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:36,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:36,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:36,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:36,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:33:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:37,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:37,264 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:37,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982074331] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:37,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:37,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 17:33:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673492406] [2025-04-13 17:33:37,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:37,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:33:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:33:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:33:37,613 INFO L87 Difference]: Start difference. First operand 239 states and 607 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) 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:33:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:38,026 INFO L93 Difference]: Finished difference Result 262 states and 656 transitions. [2025-04-13 17:33:38,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:33:38,026 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) 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 25 [2025-04-13 17:33:38,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:38,027 INFO L225 Difference]: With dead ends: 262 [2025-04-13 17:33:38,027 INFO L226 Difference]: Without dead ends: 243 [2025-04-13 17:33:38,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=2136, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 17:33:38,028 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:38,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 60 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-04-13 17:33:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-04-13 17:33:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.549586776859504) internal successors, (617), 242 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 617 transitions. [2025-04-13 17:33:38,085 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 617 transitions. Word has length 25 [2025-04-13 17:33:38,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:38,085 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 617 transitions. [2025-04-13 17:33:38,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) 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:33:38,085 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 617 transitions. [2025-04-13 17:33:38,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:38,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:38,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:38,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:38,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:38,286 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:33:38,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -230072209, now seen corresponding path program 26 times [2025-04-13 17:33:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:38,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843395748] [2025-04-13 17:33:38,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:38,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:38,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:38,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:38,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:38,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843395748] [2025-04-13 17:33:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843395748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:38,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025922376] [2025-04-13 17:33:38,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:38,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:38,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:38,748 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:33:38,761 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:33:38,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:38,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:38,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:38,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 17:33:38,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:39,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:39,328 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:39,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025922376] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:39,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2025-04-13 17:33:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877932696] [2025-04-13 17:33:39,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:39,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:33:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:39,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:33:39,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:33:39,702 INFO L87 Difference]: Start difference. First operand 243 states and 617 transitions. Second operand has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 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:33:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:40,626 INFO L93 Difference]: Finished difference Result 323 states and 801 transitions. [2025-04-13 17:33:40,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:33:40,626 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 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 25 [2025-04-13 17:33:40,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:40,628 INFO L225 Difference]: With dead ends: 323 [2025-04-13 17:33:40,628 INFO L226 Difference]: Without dead ends: 303 [2025-04-13 17:33:40,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=358, Invalid=3548, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 17:33:40,629 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 49 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:40,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 111 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:33:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-13 17:33:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 243. [2025-04-13 17:33:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.541322314049587) internal successors, (615), 242 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 615 transitions. [2025-04-13 17:33:40,681 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 615 transitions. Word has length 25 [2025-04-13 17:33:40,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:40,681 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 615 transitions. [2025-04-13 17:33:40,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 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:33:40,681 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 615 transitions. [2025-04-13 17:33:40,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:40,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:40,682 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:40,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:40,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:40,882 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:33:40,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -315959662, now seen corresponding path program 27 times [2025-04-13 17:33:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:40,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770475358] [2025-04-13 17:33:40,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:40,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:40,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:40,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 17:33:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:41,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770475358] [2025-04-13 17:33:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770475358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:41,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219394564] [2025-04-13 17:33:41,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:41,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:41,057 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:33:41,058 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:33:41,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:41,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:41,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:41,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:41,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:33:41,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:41,303 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:33:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:41,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:41,916 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:41,916 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:33:41,942 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:41,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:33:41,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:41,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:33:41,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:33:41,987 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:33:41,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:33:42,000 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:33:42,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:33:42,063 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:33:42,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 190 [2025-04-13 17:33:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219394564] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:42,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:42,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 36 [2025-04-13 17:33:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043980368] [2025-04-13 17:33:42,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:42,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:33:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:42,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:33:42,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:33:42,606 INFO L87 Difference]: Start difference. First operand 243 states and 615 transitions. Second operand has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 36 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:33:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:44,365 INFO L93 Difference]: Finished difference Result 504 states and 1205 transitions. [2025-04-13 17:33:44,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 17:33:44,365 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 36 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 25 [2025-04-13 17:33:44,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:44,367 INFO L225 Difference]: With dead ends: 504 [2025-04-13 17:33:44,367 INFO L226 Difference]: Without dead ends: 492 [2025-04-13 17:33:44,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 17:33:44,368 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 297 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:44,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 60 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:33:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-13 17:33:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 280. [2025-04-13 17:33:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 2.5949820788530467) internal successors, (724), 279 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 724 transitions. [2025-04-13 17:33:44,479 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 724 transitions. Word has length 25 [2025-04-13 17:33:44,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:44,479 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 724 transitions. [2025-04-13 17:33:44,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 36 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:33:44,479 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 724 transitions. [2025-04-13 17:33:44,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:44,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:44,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:44,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:44,680 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,SelfDestructingSolverStorable34 [2025-04-13 17:33:44,680 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:33:44,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1346972784, now seen corresponding path program 28 times [2025-04-13 17:33:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:44,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121195163] [2025-04-13 17:33:44,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:44,687 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:44,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:44,702 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:44,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:44,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121195163] [2025-04-13 17:33:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121195163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:44,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505407255] [2025-04-13 17:33:44,869 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:44,871 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:33:44,872 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:33:44,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:44,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:44,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:44,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:33:44,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:45,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:45,119 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:33:45,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:33:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505407255] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:45,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 18 [2025-04-13 17:33:45,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879091276] [2025-04-13 17:33:45,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:45,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:33:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:45,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:33:45,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:33:45,168 INFO L87 Difference]: Start difference. First operand 280 states and 724 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:45,731 INFO L93 Difference]: Finished difference Result 411 states and 1024 transitions. [2025-04-13 17:33:45,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:33:45,731 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:33:45,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:45,733 INFO L225 Difference]: With dead ends: 411 [2025-04-13 17:33:45,733 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 17:33:45,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:33:45,734 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:45,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 56 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:33:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 17:33:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 262. [2025-04-13 17:33:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.5019157088122603) internal successors, (653), 261 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 653 transitions. [2025-04-13 17:33:45,804 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 653 transitions. Word has length 25 [2025-04-13 17:33:45,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:45,804 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 653 transitions. [2025-04-13 17:33:45,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:45,804 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 653 transitions. [2025-04-13 17:33:45,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:45,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:45,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:45,811 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:33:46,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 17:33:46,006 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:33:46,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1995030997, now seen corresponding path program 29 times [2025-04-13 17:33:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:46,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172322135] [2025-04-13 17:33:46,006 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:46,014 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:46,022 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:46,022 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:33:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:46,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:46,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172322135] [2025-04-13 17:33:46,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172322135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:46,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812246241] [2025-04-13 17:33:46,235 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:46,236 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:33:46,238 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:33:46,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:46,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:46,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:33:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:46,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:33:46,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:46,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:46,554 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:33:46,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:33:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 17:33:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812246241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:46,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 22 [2025-04-13 17:33:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87037623] [2025-04-13 17:33:46,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:46,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:33:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:33:46,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:46,627 INFO L87 Difference]: Start difference. First operand 262 states and 653 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 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:33:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:47,168 INFO L93 Difference]: Finished difference Result 389 states and 927 transitions. [2025-04-13 17:33:47,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:33:47,168 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 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 25 [2025-04-13 17:33:47,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:47,170 INFO L225 Difference]: With dead ends: 389 [2025-04-13 17:33:47,170 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 17:33:47,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:33:47,171 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 64 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:47,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 43 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 17:33:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 254. [2025-04-13 17:33:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.4545454545454546) internal successors, (621), 253 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 621 transitions. [2025-04-13 17:33:47,248 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 621 transitions. Word has length 25 [2025-04-13 17:33:47,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:47,248 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 621 transitions. [2025-04-13 17:33:47,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 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:33:47,248 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 621 transitions. [2025-04-13 17:33:47,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:47,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:47,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:47,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:47,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:47,449 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:33:47,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -445602261, now seen corresponding path program 30 times [2025-04-13 17:33:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:47,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451016654] [2025-04-13 17:33:47,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:47,459 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:47,474 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:47,474 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:47,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 17:33:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:47,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451016654] [2025-04-13 17:33:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451016654] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:47,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386794130] [2025-04-13 17:33:47,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:47,702 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:33:47,703 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:33:47,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:47,785 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:47,786 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:47,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:47,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:33:47,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:48,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:48,052 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:33:48,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:33:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386794130] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:48,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:48,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 28 [2025-04-13 17:33:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087217918] [2025-04-13 17:33:48,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:48,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:33:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:48,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:33:48,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:33:48,201 INFO L87 Difference]: Start difference. First operand 254 states and 621 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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:33:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:48,743 INFO L93 Difference]: Finished difference Result 328 states and 751 transitions. [2025-04-13 17:33:48,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:33:48,744 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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 25 [2025-04-13 17:33:48,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:48,745 INFO L225 Difference]: With dead ends: 328 [2025-04-13 17:33:48,745 INFO L226 Difference]: Without dead ends: 292 [2025-04-13 17:33:48,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:33:48,746 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:48,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 64 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:33:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-13 17:33:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 250. [2025-04-13 17:33:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.4377510040160644) internal successors, (607), 249 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 607 transitions. [2025-04-13 17:33:48,820 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 607 transitions. Word has length 25 [2025-04-13 17:33:48,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:48,820 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 607 transitions. [2025-04-13 17:33:48,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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:33:48,820 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 607 transitions. [2025-04-13 17:33:48,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:48,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:48,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:48,827 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:33:49,021 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,SelfDestructingSolverStorable37 [2025-04-13 17:33:49,021 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:33:49,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -84057493, now seen corresponding path program 31 times [2025-04-13 17:33:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:49,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877646761] [2025-04-13 17:33:49,022 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:49,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:49,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:49,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:49,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:49,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877646761] [2025-04-13 17:33:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877646761] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:49,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773165784] [2025-04-13 17:33:49,397 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:49,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:49,398 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:33:49,399 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:33:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:49,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:49,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:49,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:49,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:33:49,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:49,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:49,849 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:49,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 53 treesize of output 90 [2025-04-13 17:33:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773165784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:50,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 17:33:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758751699] [2025-04-13 17:33:50,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:50,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:33:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:50,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:33:50,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:33:50,143 INFO L87 Difference]: Start difference. First operand 250 states and 607 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) 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:33:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:50,625 INFO L93 Difference]: Finished difference Result 269 states and 641 transitions. [2025-04-13 17:33:50,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:33:50,625 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) 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 25 [2025-04-13 17:33:50,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:50,626 INFO L225 Difference]: With dead ends: 269 [2025-04-13 17:33:50,626 INFO L226 Difference]: Without dead ends: 247 [2025-04-13 17:33:50,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=2253, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:33:50,627 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:50,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 96 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-13 17:33:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-04-13 17:33:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.4186991869918697) internal successors, (595), 246 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 595 transitions. [2025-04-13 17:33:50,699 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 595 transitions. Word has length 25 [2025-04-13 17:33:50,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:50,699 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 595 transitions. [2025-04-13 17:33:50,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) 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:33:50,699 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 595 transitions. [2025-04-13 17:33:50,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:50,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:50,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:50,706 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:33:50,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 17:33:50,900 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:33:50,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1626555815, now seen corresponding path program 32 times [2025-04-13 17:33:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:50,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384866738] [2025-04-13 17:33:50,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:50,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:50,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:50,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:50,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:51,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384866738] [2025-04-13 17:33:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384866738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:51,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527850228] [2025-04-13 17:33:51,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:51,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:51,165 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:33:51,166 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:33:51,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:51,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:51,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:51,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:51,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:33:51,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:51,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:51,548 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:51,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527850228] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:51,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:51,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 30 [2025-04-13 17:33:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328126892] [2025-04-13 17:33:51,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:51,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:33:51,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:51,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:33:51,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:33:51,711 INFO L87 Difference]: Start difference. First operand 247 states and 595 transitions. Second operand has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:52,020 INFO L93 Difference]: Finished difference Result 263 states and 624 transitions. [2025-04-13 17:33:52,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:33:52,020 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:33:52,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:52,021 INFO L225 Difference]: With dead ends: 263 [2025-04-13 17:33:52,022 INFO L226 Difference]: Without dead ends: 249 [2025-04-13 17:33:52,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:33:52,022 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:52,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 48 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-13 17:33:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-04-13 17:33:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.411290322580645) internal successors, (598), 248 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 598 transitions. [2025-04-13 17:33:52,094 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 598 transitions. Word has length 25 [2025-04-13 17:33:52,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:52,094 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 598 transitions. [2025-04-13 17:33:52,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:52,094 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 598 transitions. [2025-04-13 17:33:52,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:52,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:52,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:52,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 17:33:52,295 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,SelfDestructingSolverStorable39 [2025-04-13 17:33:52,295 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:33:52,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -950662421, now seen corresponding path program 33 times [2025-04-13 17:33:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:52,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343063847] [2025-04-13 17:33:52,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:52,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:52,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:52,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:52,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 17:33:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:52,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343063847] [2025-04-13 17:33:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343063847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:52,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167333238] [2025-04-13 17:33:52,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:52,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:52,497 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:33:52,499 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:33:52,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:52,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:52,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:33:52,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:52,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:33:52,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:52,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:52,799 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:52,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 17:33:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167333238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:52,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 5] total 17 [2025-04-13 17:33:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80094828] [2025-04-13 17:33:52,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:52,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:33:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:52,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:33:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:33:52,846 INFO L87 Difference]: Start difference. First operand 249 states and 598 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 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:33:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:53,198 INFO L93 Difference]: Finished difference Result 302 states and 689 transitions. [2025-04-13 17:33:53,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:33:53,198 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 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 25 [2025-04-13 17:33:53,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:53,200 INFO L225 Difference]: With dead ends: 302 [2025-04-13 17:33:53,200 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 17:33:53,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:33:53,200 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 75 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:53,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 46 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 17:33:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 251. [2025-04-13 17:33:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.38) internal successors, (595), 250 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 595 transitions. [2025-04-13 17:33:53,272 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 595 transitions. Word has length 25 [2025-04-13 17:33:53,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:53,272 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 595 transitions. [2025-04-13 17:33:53,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 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:33:53,272 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 595 transitions. [2025-04-13 17:33:53,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:53,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:53,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:53,279 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:33:53,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:53,473 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:33:53,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash -895251161, now seen corresponding path program 34 times [2025-04-13 17:33:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:53,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341006025] [2025-04-13 17:33:53,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:53,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:53,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:53,485 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:53,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 17:33:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:53,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341006025] [2025-04-13 17:33:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341006025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:53,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874842653] [2025-04-13 17:33:53,620 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:53,621 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:33:53,622 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:33:53,688 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:33:53,705 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:53,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:53,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:33:53,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:33:53,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:53,814 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:53,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 17:33:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874842653] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:53,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2025-04-13 17:33:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751358309] [2025-04-13 17:33:53,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:53,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:33:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:53,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:33:53,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:33:53,866 INFO L87 Difference]: Start difference. First operand 251 states and 595 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:54,182 INFO L93 Difference]: Finished difference Result 320 states and 731 transitions. [2025-04-13 17:33:54,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:33:54,182 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:33:54,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:54,183 INFO L225 Difference]: With dead ends: 320 [2025-04-13 17:33:54,183 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 17:33:54,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:54,184 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 64 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:54,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 17:33:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2025-04-13 17:33:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.369918699186992) internal successors, (583), 246 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 583 transitions. [2025-04-13 17:33:54,255 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 583 transitions. Word has length 25 [2025-04-13 17:33:54,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:54,255 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 583 transitions. [2025-04-13 17:33:54,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:54,255 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 583 transitions. [2025-04-13 17:33:54,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:54,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:54,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:54,261 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:33:54,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:54,456 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:33:54,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -981138614, now seen corresponding path program 35 times [2025-04-13 17:33:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:54,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838289773] [2025-04-13 17:33:54,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:54,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:33:54,467 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:54,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:33:54,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:54,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838289773] [2025-04-13 17:33:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838289773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:54,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615617452] [2025-04-13 17:33:54,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:54,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:54,822 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:33:54,822 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:33:54,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:33:54,915 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:54,915 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:33:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:54,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:33:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 17:33:55,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:55,130 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:33:55,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:33:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 17:33:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615617452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:55,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 5] total 26 [2025-04-13 17:33:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813413232] [2025-04-13 17:33:55,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:55,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:33:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:33:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:33:55,195 INFO L87 Difference]: Start difference. First operand 247 states and 583 transitions. Second operand has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 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:33:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:55,842 INFO L93 Difference]: Finished difference Result 324 states and 763 transitions. [2025-04-13 17:33:55,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:33:55,842 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 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 25 [2025-04-13 17:33:55,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:55,844 INFO L225 Difference]: With dead ends: 324 [2025-04-13 17:33:55,844 INFO L226 Difference]: Without dead ends: 315 [2025-04-13 17:33:55,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:33:55,844 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:55,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 52 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-13 17:33:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 245. [2025-04-13 17:33:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.377049180327869) internal successors, (580), 244 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 580 transitions. [2025-04-13 17:33:55,918 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 580 transitions. Word has length 25 [2025-04-13 17:33:55,918 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:55,918 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 580 transitions. [2025-04-13 17:33:55,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 26 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:33:55,918 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 580 transitions. [2025-04-13 17:33:55,918 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:55,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:55,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:56,119 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,SelfDestructingSolverStorable42 [2025-04-13 17:33:56,119 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:33:56,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash 681793832, now seen corresponding path program 36 times [2025-04-13 17:33:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:56,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162004340] [2025-04-13 17:33:56,120 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:56,125 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:56,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:56,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:56,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162004340] [2025-04-13 17:33:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162004340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:56,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452900540] [2025-04-13 17:33:56,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:56,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:56,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:56,548 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:33:56,549 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:33:56,624 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:33:56,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:56,648 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:33:56,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:56,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 17:33:56,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:56,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:57,027 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:57,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:33:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452900540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:57,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2025-04-13 17:33:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924403008] [2025-04-13 17:33:57,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:57,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:33:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:57,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:33:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:33:57,228 INFO L87 Difference]: Start difference. First operand 245 states and 580 transitions. Second operand has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:57,817 INFO L93 Difference]: Finished difference Result 310 states and 731 transitions. [2025-04-13 17:33:57,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:33:57,818 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:33:57,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:57,819 INFO L225 Difference]: With dead ends: 310 [2025-04-13 17:33:57,819 INFO L226 Difference]: Without dead ends: 301 [2025-04-13 17:33:57,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 17:33:57,820 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 153 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:57,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 43 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:33:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-13 17:33:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 241. [2025-04-13 17:33:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.375) internal successors, (570), 240 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 570 transitions. [2025-04-13 17:33:57,905 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 570 transitions. Word has length 25 [2025-04-13 17:33:57,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:57,905 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 570 transitions. [2025-04-13 17:33:57,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:57,905 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 570 transitions. [2025-04-13 17:33:57,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:33:57,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:57,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:57,912 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:33:58,106 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,SelfDestructingSolverStorable43 [2025-04-13 17:33:58,106 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:33:58,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash 693092106, now seen corresponding path program 37 times [2025-04-13 17:33:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:58,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797076988] [2025-04-13 17:33:58,106 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:58,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:58,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:58,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797076988] [2025-04-13 17:33:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797076988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:58,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527494126] [2025-04-13 17:33:58,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:58,531 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:33:58,532 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:33:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:33:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:33:58,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:58,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:58,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:33:58,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:58,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:59,020 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:33:59,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:33:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527494126] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:59,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 17:33:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907632603] [2025-04-13 17:33:59,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:59,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:33:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:59,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:33:59,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:33:59,318 INFO L87 Difference]: Start difference. First operand 241 states and 570 transitions. Second operand has 42 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 41 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:59,916 INFO L93 Difference]: Finished difference Result 283 states and 669 transitions. [2025-04-13 17:33:59,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:33:59,917 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 41 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:33:59,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:59,918 INFO L225 Difference]: With dead ends: 283 [2025-04-13 17:33:59,918 INFO L226 Difference]: Without dead ends: 274 [2025-04-13 17:33:59,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:33:59,918 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 78 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:59,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 95 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:33:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-13 17:33:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 245. [2025-04-13 17:33:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.3852459016393444) internal successors, (582), 244 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 582 transitions. [2025-04-13 17:33:59,996 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 582 transitions. Word has length 25 [2025-04-13 17:33:59,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:59,996 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 582 transitions. [2025-04-13 17:33:59,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 41 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:59,996 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 582 transitions. [2025-04-13 17:33:59,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:33:59,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:59,996 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:00,003 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:34:00,197 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,SelfDestructingSolverStorable44 [2025-04-13 17:34:00,197 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:34:00,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash 932775527, now seen corresponding path program 38 times [2025-04-13 17:34:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:00,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309592418] [2025-04-13 17:34:00,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:00,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:34:00,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:00,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:00,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309592418] [2025-04-13 17:34:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309592418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:00,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768233167] [2025-04-13 17:34:00,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:00,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:00,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:00,488 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:34:00,489 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:34:00,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:34:00,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:00,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:00,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:00,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:34:00,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:00,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:00,886 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:00,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:34:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:01,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768233167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:01,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:01,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 17:34:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99230452] [2025-04-13 17:34:01,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:01,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:34:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:01,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:34:01,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:34:01,068 INFO L87 Difference]: Start difference. First operand 245 states and 582 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:01,580 INFO L93 Difference]: Finished difference Result 274 states and 636 transitions. [2025-04-13 17:34:01,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:34:01,581 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:34:01,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:01,582 INFO L225 Difference]: With dead ends: 274 [2025-04-13 17:34:01,582 INFO L226 Difference]: Without dead ends: 251 [2025-04-13 17:34:01,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1439, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:34:01,582 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:01,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 148 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:34:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-13 17:34:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-04-13 17:34:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.372) internal successors, (593), 250 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 593 transitions. [2025-04-13 17:34:01,670 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 593 transitions. Word has length 26 [2025-04-13 17:34:01,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:01,670 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 593 transitions. [2025-04-13 17:34:01,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:01,670 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 593 transitions. [2025-04-13 17:34:01,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:34:01,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:01,671 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:01,677 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:34:01,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 17:34:01,871 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:34:01,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1140554624, now seen corresponding path program 39 times [2025-04-13 17:34:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:01,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648541677] [2025-04-13 17:34:01,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:01,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:01,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 26 statements. [2025-04-13 17:34:01,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:34:01,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:02,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648541677] [2025-04-13 17:34:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648541677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:02,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607545439] [2025-04-13 17:34:02,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:02,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:02,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:02,049 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:34:02,049 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:34:02,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:02,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 26 statements. [2025-04-13 17:34:02,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:34:02,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:02,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:34:02,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:02,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:02,291 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:34:02,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:34:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607545439] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:02,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 16 [2025-04-13 17:34:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684604141] [2025-04-13 17:34:02,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:02,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:34:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:02,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:34:02,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:34:02,334 INFO L87 Difference]: Start difference. First operand 251 states and 593 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 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:34:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:02,733 INFO L93 Difference]: Finished difference Result 292 states and 674 transitions. [2025-04-13 17:34:02,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:34:02,733 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 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:34:02,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:02,734 INFO L225 Difference]: With dead ends: 292 [2025-04-13 17:34:02,734 INFO L226 Difference]: Without dead ends: 261 [2025-04-13 17:34:02,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:34:02,735 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:02,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 54 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:34:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-04-13 17:34:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 245. [2025-04-13 17:34:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.3278688524590163) internal successors, (568), 244 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 568 transitions. [2025-04-13 17:34:02,813 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 568 transitions. Word has length 26 [2025-04-13 17:34:02,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:02,813 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 568 transitions. [2025-04-13 17:34:02,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 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:34:02,813 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 568 transitions. [2025-04-13 17:34:02,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:34:02,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:02,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:02,824 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:34:03,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:03,014 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:34:03,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -540708422, now seen corresponding path program 40 times [2025-04-13 17:34:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:03,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309314375] [2025-04-13 17:34:03,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:03,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:34:03,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:03,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:03,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309314375] [2025-04-13 17:34:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309314375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:03,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989418456] [2025-04-13 17:34:03,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:03,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:03,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:03,093 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:34:03,102 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:34:03,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:34:03,215 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:03,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:03,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:03,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:34:03,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:03,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989418456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:03,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 11 [2025-04-13 17:34:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920353966] [2025-04-13 17:34:03,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:03,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:34:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:03,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:34:03,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:03,329 INFO L87 Difference]: Start difference. First operand 245 states and 568 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:34:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:03,696 INFO L93 Difference]: Finished difference Result 367 states and 834 transitions. [2025-04-13 17:34:03,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:34:03,696 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:34:03,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:03,698 INFO L225 Difference]: With dead ends: 367 [2025-04-13 17:34:03,698 INFO L226 Difference]: Without dead ends: 356 [2025-04-13 17:34:03,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:03,698 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:03,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:34:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-13 17:34:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2025-04-13 17:34:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.424812030075188) internal successors, (645), 266 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 645 transitions. [2025-04-13 17:34:03,785 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 645 transitions. Word has length 26 [2025-04-13 17:34:03,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:03,785 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 645 transitions. [2025-04-13 17:34:03,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:34:03,785 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 645 transitions. [2025-04-13 17:34:03,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:34:03,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:03,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:03,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 17:34:03,986 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,SelfDestructingSolverStorable47 [2025-04-13 17:34:03,986 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:34:03,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1194589100, now seen corresponding path program 41 times [2025-04-13 17:34:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:03,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999943104] [2025-04-13 17:34:03,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:03,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:03,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:03,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:03,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:04,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999943104] [2025-04-13 17:34:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999943104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:04,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112876889] [2025-04-13 17:34:04,129 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:04,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:04,132 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:34:04,132 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:34:04,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:04,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:04,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:04,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:04,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:34:04,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:04,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112876889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:04,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 4] total 21 [2025-04-13 17:34:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258861459] [2025-04-13 17:34:04,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:04,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:34:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:04,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:34:04,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:34:04,375 INFO L87 Difference]: Start difference. First operand 267 states and 645 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 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:34:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:05,112 INFO L93 Difference]: Finished difference Result 445 states and 1014 transitions. [2025-04-13 17:34:05,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:34:05,113 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 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 26 [2025-04-13 17:34:05,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:05,114 INFO L225 Difference]: With dead ends: 445 [2025-04-13 17:34:05,114 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 17:34:05,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:34:05,115 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:05,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 75 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 17:34:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 241. [2025-04-13 17:34:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.566666666666667) internal successors, (616), 240 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 616 transitions. [2025-04-13 17:34:05,203 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 616 transitions. Word has length 26 [2025-04-13 17:34:05,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:05,203 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 616 transitions. [2025-04-13 17:34:05,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 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:34:05,203 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 616 transitions. [2025-04-13 17:34:05,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:34:05,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:05,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:05,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:05,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 17:34:05,404 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:34:05,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 9946362, now seen corresponding path program 42 times [2025-04-13 17:34:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:05,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331814] [2025-04-13 17:34:05,404 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:05,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:05,418 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:05,418 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:05,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:05,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331814] [2025-04-13 17:34:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:05,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832017932] [2025-04-13 17:34:05,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:05,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:05,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:05,484 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:34:05,486 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:34:05,578 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 17:34:05,599 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:34:05,599 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:05,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:34:05,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:05,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832017932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:05,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:05,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 4] total 11 [2025-04-13 17:34:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333202340] [2025-04-13 17:34:05,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:05,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:34:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:05,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:34:05,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:05,713 INFO L87 Difference]: Start difference. First operand 241 states and 616 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:34:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:06,109 INFO L93 Difference]: Finished difference Result 365 states and 890 transitions. [2025-04-13 17:34:06,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:34:06,109 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:34:06,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:06,111 INFO L225 Difference]: With dead ends: 365 [2025-04-13 17:34:06,111 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 17:34:06,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:06,111 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:06,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:34:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 17:34:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 284. [2025-04-13 17:34:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 2.6219081272084805) internal successors, (742), 283 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 742 transitions. [2025-04-13 17:34:06,231 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 742 transitions. Word has length 26 [2025-04-13 17:34:06,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:06,231 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 742 transitions. [2025-04-13 17:34:06,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:34:06,231 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 742 transitions. [2025-04-13 17:34:06,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:34:06,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:06,232 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:06,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:06,432 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,SelfDestructingSolverStorable49 [2025-04-13 17:34:06,432 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:34:06,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1151441191, now seen corresponding path program 43 times [2025-04-13 17:34:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:06,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980021424] [2025-04-13 17:34:06,433 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:06,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:34:06,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:34:06,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:06,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:06,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980021424] [2025-04-13 17:34:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980021424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:06,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256703872] [2025-04-13 17:34:06,510 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:06,512 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:34:06,514 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:34:06,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:34:06,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:34:06,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:06,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:34:06,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:06,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256703872] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:06,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 11 [2025-04-13 17:34:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080996847] [2025-04-13 17:34:06,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:06,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:34:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:06,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:34:06,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:06,697 INFO L87 Difference]: Start difference. First operand 284 states and 742 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:34:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:07,047 INFO L93 Difference]: Finished difference Result 371 states and 942 transitions. [2025-04-13 17:34:07,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:34:07,048 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:34:07,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:07,049 INFO L225 Difference]: With dead ends: 371 [2025-04-13 17:34:07,049 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 17:34:07,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:34:07,050 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:07,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 48 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:34:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 17:34:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 316. [2025-04-13 17:34:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.679365079365079) internal successors, (844), 315 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 844 transitions. [2025-04-13 17:34:07,179 INFO L79 Accepts]: Start accepts. Automaton has 316 states and 844 transitions. Word has length 27 [2025-04-13 17:34:07,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:07,179 INFO L485 AbstractCegarLoop]: Abstraction has 316 states and 844 transitions. [2025-04-13 17:34:07,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:34:07,180 INFO L278 IsEmpty]: Start isEmpty. Operand 316 states and 844 transitions. [2025-04-13 17:34:07,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:34:07,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:07,180 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:07,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:07,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:07,381 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:34:07,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2015788170, now seen corresponding path program 44 times [2025-04-13 17:34:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:07,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563506427] [2025-04-13 17:34:07,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:07,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:34:07,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:34:07,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:07,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:07,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:07,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563506427] [2025-04-13 17:34:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563506427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:07,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401139292] [2025-04-13 17:34:07,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:07,458 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:34:07,458 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:34:07,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:34:07,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:34:07,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:07,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:07,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:34:07,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:07,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:07,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401139292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:07,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:07,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-04-13 17:34:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455023916] [2025-04-13 17:34:07,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:07,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:34:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:07,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:34:07,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:34:07,745 INFO L87 Difference]: Start difference. First operand 316 states and 844 transitions. Second operand has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 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:34:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:08,559 INFO L93 Difference]: Finished difference Result 853 states and 2293 transitions. [2025-04-13 17:34:08,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:34:08,560 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 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 27 [2025-04-13 17:34:08,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:08,562 INFO L225 Difference]: With dead ends: 853 [2025-04-13 17:34:08,562 INFO L226 Difference]: Without dead ends: 447 [2025-04-13 17:34:08,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:34:08,563 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 92 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:08,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 67 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:34:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-04-13 17:34:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 366. [2025-04-13 17:34:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.652054794520548) internal successors, (968), 365 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 968 transitions. [2025-04-13 17:34:08,756 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 968 transitions. Word has length 27 [2025-04-13 17:34:08,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:08,756 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 968 transitions. [2025-04-13 17:34:08,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 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:34:08,756 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 968 transitions. [2025-04-13 17:34:08,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:34:08,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:08,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:08,764 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:34:08,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:08,958 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:34:08,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1333776736, now seen corresponding path program 45 times [2025-04-13 17:34:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:08,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013501200] [2025-04-13 17:34:08,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:08,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-04-13 17:34:08,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:34:08,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:34:08,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:09,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013501200] [2025-04-13 17:34:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013501200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:09,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750461254] [2025-04-13 17:34:09,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:09,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:09,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:09,063 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:34:09,064 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:34:09,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-04-13 17:34:09,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:34:09,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:34:09,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:09,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:34:09,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:09,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750461254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:09,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-13 17:34:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979654156] [2025-04-13 17:34:09,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:09,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:34:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:09,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:34:09,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:34:09,340 INFO L87 Difference]: Start difference. First operand 366 states and 968 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 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:34:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:09,634 INFO L93 Difference]: Finished difference Result 385 states and 995 transitions. [2025-04-13 17:34:09,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:34:09,635 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 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 28 [2025-04-13 17:34:09,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:09,636 INFO L225 Difference]: With dead ends: 385 [2025-04-13 17:34:09,636 INFO L226 Difference]: Without dead ends: 260 [2025-04-13 17:34:09,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:34:09,637 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 62 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:09,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 35 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:34:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-13 17:34:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2025-04-13 17:34:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.801556420233463) internal successors, (720), 257 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 720 transitions. [2025-04-13 17:34:09,744 INFO L79 Accepts]: Start accepts. Automaton has 258 states and 720 transitions. Word has length 28 [2025-04-13 17:34:09,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:09,744 INFO L485 AbstractCegarLoop]: Abstraction has 258 states and 720 transitions. [2025-04-13 17:34:09,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 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:34:09,744 INFO L278 IsEmpty]: Start isEmpty. Operand 258 states and 720 transitions. [2025-04-13 17:34:09,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:09,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:09,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:09,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 17:34:09,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:09,945 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:34:09,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 820051036, now seen corresponding path program 46 times [2025-04-13 17:34:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:09,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769204059] [2025-04-13 17:34:09,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:09,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:09,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:09,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:09,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:10,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769204059] [2025-04-13 17:34:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769204059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:10,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95316242] [2025-04-13 17:34:10,172 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:10,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:10,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:10,174 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:34:10,175 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:34:10,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:10,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:10,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:10,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:10,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:34:10,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:10,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:10,532 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:10,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:34:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95316242] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:10,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2025-04-13 17:34:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775520416] [2025-04-13 17:34:10,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:10,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:34:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:34:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:34:10,601 INFO L87 Difference]: Start difference. First operand 258 states and 720 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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:34:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:11,329 INFO L93 Difference]: Finished difference Result 355 states and 930 transitions. [2025-04-13 17:34:11,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:34:11,329 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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:34:11,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:11,331 INFO L225 Difference]: With dead ends: 355 [2025-04-13 17:34:11,331 INFO L226 Difference]: Without dead ends: 347 [2025-04-13 17:34:11,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:34:11,331 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 190 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:11,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 86 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-13 17:34:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 238. [2025-04-13 17:34:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.7848101265822787) internal successors, (660), 237 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 660 transitions. [2025-04-13 17:34:11,432 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 660 transitions. Word has length 29 [2025-04-13 17:34:11,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:11,432 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 660 transitions. [2025-04-13 17:34:11,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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:34:11,432 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 660 transitions. [2025-04-13 17:34:11,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:11,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:11,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:11,438 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:34:11,633 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,SelfDestructingSolverStorable53 [2025-04-13 17:34:11,633 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:34:11,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1481281707, now seen corresponding path program 47 times [2025-04-13 17:34:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:11,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526088732] [2025-04-13 17:34:11,633 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:11,640 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:11,649 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:11,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:12,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526088732] [2025-04-13 17:34:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526088732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:12,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246720660] [2025-04-13 17:34:12,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:12,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:12,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:12,060 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:34:12,060 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:34:12,149 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:12,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:12,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:12,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:34:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 17:34:12,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:12,657 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:12,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:34:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246720660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:12,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 9] total 38 [2025-04-13 17:34:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645570969] [2025-04-13 17:34:12,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:12,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:34:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:34:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:34:12,762 INFO L87 Difference]: Start difference. First operand 238 states and 660 transitions. Second operand has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:13,664 INFO L93 Difference]: Finished difference Result 273 states and 721 transitions. [2025-04-13 17:34:13,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:34:13,664 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:13,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:13,666 INFO L225 Difference]: With dead ends: 273 [2025-04-13 17:34:13,666 INFO L226 Difference]: Without dead ends: 242 [2025-04-13 17:34:13,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=3383, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:34:13,666 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 74 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:13,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 95 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-04-13 17:34:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2025-04-13 17:34:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.7341772151898733) internal successors, (648), 237 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 648 transitions. [2025-04-13 17:34:13,765 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 648 transitions. Word has length 29 [2025-04-13 17:34:13,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:13,765 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 648 transitions. [2025-04-13 17:34:13,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:13,765 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 648 transitions. [2025-04-13 17:34:13,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:13,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:13,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:13,772 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:34:13,966 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,SelfDestructingSolverStorable54 [2025-04-13 17:34:13,966 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:34:13,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:13,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1989811545, now seen corresponding path program 48 times [2025-04-13 17:34:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:13,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641879983] [2025-04-13 17:34:13,967 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:13,972 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:13,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:13,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:13,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:14,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641879983] [2025-04-13 17:34:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641879983] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:14,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124883115] [2025-04-13 17:34:14,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:14,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:14,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:14,341 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:34:14,342 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:34:14,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:14,449 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:14,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:14,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:14,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:34:14,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:14,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:14,764 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:34:14,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:34:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124883115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:15,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 36 [2025-04-13 17:34:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004703225] [2025-04-13 17:34:15,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:15,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:34:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:34:15,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:34:15,013 INFO L87 Difference]: Start difference. First operand 238 states and 648 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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:34:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:15,519 INFO L93 Difference]: Finished difference Result 281 states and 752 transitions. [2025-04-13 17:34:15,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:34:15,519 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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:34:15,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:15,521 INFO L225 Difference]: With dead ends: 281 [2025-04-13 17:34:15,521 INFO L226 Difference]: Without dead ends: 274 [2025-04-13 17:34:15,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:34:15,521 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:15,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 90 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:34:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-13 17:34:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 248. [2025-04-13 17:34:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.7246963562753037) internal successors, (673), 247 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 673 transitions. [2025-04-13 17:34:15,628 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 673 transitions. Word has length 29 [2025-04-13 17:34:15,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:15,628 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 673 transitions. [2025-04-13 17:34:15,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 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:34:15,628 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 673 transitions. [2025-04-13 17:34:15,628 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:15,628 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:15,628 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:15,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:15,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-13 17:34:15,829 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:34:15,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1366407060, now seen corresponding path program 49 times [2025-04-13 17:34:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:15,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826812959] [2025-04-13 17:34:15,829 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:15,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:15,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:15,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:15,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:16,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826812959] [2025-04-13 17:34:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826812959] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:16,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913324489] [2025-04-13 17:34:16,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:16,282 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:34:16,282 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:34:16,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:16,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:16,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:16,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:34:16,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:16,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:16,850 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:16,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 53 treesize of output 90 [2025-04-13 17:34:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913324489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:17,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:34:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864308007] [2025-04-13 17:34:17,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:17,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:34:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:17,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:34:17,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2552, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:34:17,299 INFO L87 Difference]: Start difference. First operand 248 states and 673 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:34:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:18,036 INFO L93 Difference]: Finished difference Result 268 states and 712 transitions. [2025-04-13 17:34:18,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:34:18,037 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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) Word has length 29 [2025-04-13 17:34:18,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:18,038 INFO L225 Difference]: With dead ends: 268 [2025-04-13 17:34:18,038 INFO L226 Difference]: Without dead ends: 254 [2025-04-13 17:34:18,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=431, Invalid=3601, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:34:18,039 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:18,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 127 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:34:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-13 17:34:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-04-13 17:34:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.719367588932806) internal successors, (688), 253 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 688 transitions. [2025-04-13 17:34:18,143 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 688 transitions. Word has length 29 [2025-04-13 17:34:18,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:18,143 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 688 transitions. [2025-04-13 17:34:18,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:34:18,143 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 688 transitions. [2025-04-13 17:34:18,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:18,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:18,143 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:18,150 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:34:18,344 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,SelfDestructingSolverStorable56 [2025-04-13 17:34:18,344 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:34:18,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1210811176, now seen corresponding path program 50 times [2025-04-13 17:34:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:18,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735787934] [2025-04-13 17:34:18,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:18,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:18,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:18,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:18,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:18,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735787934] [2025-04-13 17:34:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735787934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:18,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482914580] [2025-04-13 17:34:18,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:18,773 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:34:18,774 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:34:18,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:18,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:18,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:18,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:18,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:34:18,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:19,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:19,329 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:34:19,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:34:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482914580] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:19,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 50 [2025-04-13 17:34:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300338487] [2025-04-13 17:34:19,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:19,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 17:34:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:19,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 17:34:19,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2259, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:34:19,819 INFO L87 Difference]: Start difference. First operand 254 states and 688 transitions. Second operand has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:20,437 INFO L93 Difference]: Finished difference Result 273 states and 727 transitions. [2025-04-13 17:34:20,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:34:20,437 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:20,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:20,439 INFO L225 Difference]: With dead ends: 273 [2025-04-13 17:34:20,439 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 17:34:20,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=417, Invalid=3123, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 17:34:20,439 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:20,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 93 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 17:34:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-04-13 17:34:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.7176470588235295) internal successors, (693), 255 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 693 transitions. [2025-04-13 17:34:20,552 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 693 transitions. Word has length 29 [2025-04-13 17:34:20,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:20,552 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 693 transitions. [2025-04-13 17:34:20,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:20,552 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 693 transitions. [2025-04-13 17:34:20,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:20,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:20,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:20,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:20,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 17:34:20,753 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:34:20,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1155399916, now seen corresponding path program 51 times [2025-04-13 17:34:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:20,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331246992] [2025-04-13 17:34:20,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:20,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:20,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:20,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:20,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:34:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:34:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:21,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331246992] [2025-04-13 17:34:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331246992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:21,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174043733] [2025-04-13 17:34:21,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:21,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:21,260 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:34:21,266 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:34:21,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:21,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:21,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:34:21,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:21,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:34:21,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:21,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:21,831 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:34:21,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:34:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174043733] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:22,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:22,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 13] total 44 [2025-04-13 17:34:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631854736] [2025-04-13 17:34:22,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:22,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 17:34:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 17:34:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:34:22,140 INFO L87 Difference]: Start difference. First operand 256 states and 693 transitions. Second operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 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:34:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:23,349 INFO L93 Difference]: Finished difference Result 454 states and 1194 transitions. [2025-04-13 17:34:23,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:34:23,349 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 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) Word has length 29 [2025-04-13 17:34:23,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:23,351 INFO L225 Difference]: With dead ends: 454 [2025-04-13 17:34:23,351 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 17:34:23,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=4190, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:34:23,352 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 113 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:23,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 118 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:34:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 17:34:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 298. [2025-04-13 17:34:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.7138047138047137) internal successors, (806), 297 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 806 transitions. [2025-04-13 17:34:23,469 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 806 transitions. Word has length 29 [2025-04-13 17:34:23,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:23,469 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 806 transitions. [2025-04-13 17:34:23,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 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:34:23,469 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 806 transitions. [2025-04-13 17:34:23,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:23,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:23,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:23,476 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:34:23,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 17:34:23,670 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:34:23,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1241287369, now seen corresponding path program 52 times [2025-04-13 17:34:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:23,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301174520] [2025-04-13 17:34:23,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:23,677 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:23,683 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:23,683 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:23,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:23,835 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:34:23,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:23,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301174520] [2025-04-13 17:34:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301174520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:23,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381913971] [2025-04-13 17:34:23,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:23,838 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:34:23,838 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:34:23,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:23,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:23,950 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:23,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:23,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:34:23,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:24,037 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 15 treesize of output 1 [2025-04-13 17:34:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:24,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:24,483 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:24,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:24,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:34:24,504 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:34:24,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:34:24,511 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:24,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:34:24,518 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:34:24,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:34:24,567 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:34:24,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 17:34:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381913971] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:24,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 11] total 31 [2025-04-13 17:34:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107277766] [2025-04-13 17:34:24,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:24,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:34:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:24,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:34:24,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:34:24,755 INFO L87 Difference]: Start difference. First operand 298 states and 806 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 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:34:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:25,475 INFO L93 Difference]: Finished difference Result 389 states and 997 transitions. [2025-04-13 17:34:25,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:34:25,475 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 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 29 [2025-04-13 17:34:25,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:25,477 INFO L225 Difference]: With dead ends: 389 [2025-04-13 17:34:25,477 INFO L226 Difference]: Without dead ends: 382 [2025-04-13 17:34:25,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1304, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:34:25,478 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 91 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:25,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 64 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:34:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-13 17:34:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 294. [2025-04-13 17:34:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.689419795221843) internal successors, (788), 293 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 788 transitions. [2025-04-13 17:34:25,596 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 788 transitions. Word has length 29 [2025-04-13 17:34:25,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:25,596 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 788 transitions. [2025-04-13 17:34:25,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 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:34:25,596 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 788 transitions. [2025-04-13 17:34:25,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:25,596 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:25,603 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:34:25,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:25,797 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:34:25,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash 421645077, now seen corresponding path program 53 times [2025-04-13 17:34:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:25,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024566111] [2025-04-13 17:34:25,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:25,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:25,809 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:25,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:25,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:26,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024566111] [2025-04-13 17:34:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024566111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:26,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053269450] [2025-04-13 17:34:26,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:26,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:26,144 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:34:26,145 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:34:26,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:26,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:26,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:26,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:26,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:34:26,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 17:34:26,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:26,604 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:26,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:34:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053269450] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:26,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 29 [2025-04-13 17:34:26,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447086181] [2025-04-13 17:34:26,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:26,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:34:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:26,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:34:26,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:34:26,698 INFO L87 Difference]: Start difference. First operand 294 states and 788 transitions. Second operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 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:34:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:27,686 INFO L93 Difference]: Finished difference Result 402 states and 1012 transitions. [2025-04-13 17:34:27,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:34:27,686 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:27,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:27,688 INFO L225 Difference]: With dead ends: 402 [2025-04-13 17:34:27,688 INFO L226 Difference]: Without dead ends: 395 [2025-04-13 17:34:27,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:34:27,689 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 87 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:27,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 113 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:34:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-13 17:34:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 294. [2025-04-13 17:34:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.689419795221843) internal successors, (788), 293 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 788 transitions. [2025-04-13 17:34:27,804 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 788 transitions. Word has length 29 [2025-04-13 17:34:27,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:27,804 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 788 transitions. [2025-04-13 17:34:27,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 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:34:27,804 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 788 transitions. [2025-04-13 17:34:27,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:27,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:27,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:27,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 17:34:28,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:28,005 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:34:28,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1536415690, now seen corresponding path program 54 times [2025-04-13 17:34:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:28,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036543953] [2025-04-13 17:34:28,005 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:28,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:28,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:28,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:28,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:28,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036543953] [2025-04-13 17:34:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036543953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:28,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841700341] [2025-04-13 17:34:28,335 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:28,337 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:34:28,337 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:34:28,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:28,453 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:28,453 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:34:28,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:28,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:34:28,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:28,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:28,812 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:28,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:34:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841700341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:29,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 38 [2025-04-13 17:34:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053074356] [2025-04-13 17:34:29,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:29,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:34:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:29,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:34:29,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:34:29,055 INFO L87 Difference]: Start difference. First operand 294 states and 788 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:29,537 INFO L93 Difference]: Finished difference Result 314 states and 827 transitions. [2025-04-13 17:34:29,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:34:29,538 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:29,538 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:29,540 INFO L225 Difference]: With dead ends: 314 [2025-04-13 17:34:29,540 INFO L226 Difference]: Without dead ends: 300 [2025-04-13 17:34:29,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:34:29,540 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:29,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 54 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:34:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-13 17:34:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2025-04-13 17:34:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.686868686868687) internal successors, (798), 297 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 798 transitions. [2025-04-13 17:34:29,661 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 798 transitions. Word has length 29 [2025-04-13 17:34:29,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:29,661 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 798 transitions. [2025-04-13 17:34:29,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:29,661 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 798 transitions. [2025-04-13 17:34:29,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:29,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:29,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:29,668 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:34:29,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:29,862 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:34:29,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1432956095, now seen corresponding path program 55 times [2025-04-13 17:34:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:29,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894532724] [2025-04-13 17:34:29,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:29,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:29,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:29,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:29,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:30,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894532724] [2025-04-13 17:34:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894532724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:30,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042183921] [2025-04-13 17:34:30,340 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:30,342 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:34:30,343 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:34:30,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:30,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:30,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:30,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:30,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:34:30,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:30,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:30,894 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:30,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:34:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042183921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:31,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:34:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515721125] [2025-04-13 17:34:31,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:31,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:34:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:34:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2544, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:34:31,340 INFO L87 Difference]: Start difference. First operand 298 states and 798 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:34:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:32,022 INFO L93 Difference]: Finished difference Result 315 states and 830 transitions. [2025-04-13 17:34:32,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:34:32,023 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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) Word has length 29 [2025-04-13 17:34:32,023 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:32,024 INFO L225 Difference]: With dead ends: 315 [2025-04-13 17:34:32,024 INFO L226 Difference]: Without dead ends: 304 [2025-04-13 17:34:32,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=3712, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 17:34:32,025 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:32,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 79 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-04-13 17:34:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2025-04-13 17:34:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.6843853820598005) internal successors, (808), 301 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 808 transitions. [2025-04-13 17:34:32,143 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 808 transitions. Word has length 29 [2025-04-13 17:34:32,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:32,143 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 808 transitions. [2025-04-13 17:34:32,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:34:32,143 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 808 transitions. [2025-04-13 17:34:32,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:32,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:32,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:32,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 17:34:32,344 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,SelfDestructingSolverStorable62 [2025-04-13 17:34:32,344 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:34:32,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2074271268, now seen corresponding path program 56 times [2025-04-13 17:34:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:32,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098486035] [2025-04-13 17:34:32,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:32,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:32,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:32,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:32,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:32,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098486035] [2025-04-13 17:34:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098486035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:32,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129743143] [2025-04-13 17:34:32,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:32,806 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:34:32,806 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:34:32,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:32,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:32,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:32,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:34:32,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:33,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:33,425 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:33,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:34:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129743143] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:33,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 51 [2025-04-13 17:34:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114696563] [2025-04-13 17:34:33,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:33,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 17:34:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:33,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 17:34:33,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2356, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:34:33,870 INFO L87 Difference]: Start difference. First operand 302 states and 808 transitions. Second operand has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 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:34:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:34,539 INFO L93 Difference]: Finished difference Result 320 states and 842 transitions. [2025-04-13 17:34:34,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:34:34,539 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:34,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:34,541 INFO L225 Difference]: With dead ends: 320 [2025-04-13 17:34:34,541 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 17:34:34,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=409, Invalid=3251, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:34:34,541 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:34,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 89 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 17:34:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2025-04-13 17:34:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.6843853820598005) internal successors, (808), 301 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 808 transitions. [2025-04-13 17:34:34,660 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 808 transitions. Word has length 29 [2025-04-13 17:34:34,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:34,660 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 808 transitions. [2025-04-13 17:34:34,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 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:34:34,660 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 808 transitions. [2025-04-13 17:34:34,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:34,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:34,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:34,668 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:34:34,861 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,SelfDestructingSolverStorable63 [2025-04-13 17:34:34,861 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:34:34,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1724024774, now seen corresponding path program 57 times [2025-04-13 17:34:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:34,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983562939] [2025-04-13 17:34:34,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:34,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:34,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:34,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:34:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:35,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:35,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983562939] [2025-04-13 17:34:35,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983562939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:35,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803304023] [2025-04-13 17:34:35,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:35,274 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:34:35,274 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:34:35,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:34:35,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:35,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:34:35,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:35,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:34:35,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:35,524 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 15 treesize of output 1 [2025-04-13 17:34:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:35,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:36,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:36,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:34:36,183 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:34:36,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:34:36,220 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:34:36,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:34:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:34:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803304023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:36,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 11] total 43 [2025-04-13 17:34:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917426314] [2025-04-13 17:34:36,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:36,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 17:34:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:36,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 17:34:36,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:34:36,415 INFO L87 Difference]: Start difference. First operand 302 states and 808 transitions. Second operand has 44 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 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:34:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:37,522 INFO L93 Difference]: Finished difference Result 358 states and 924 transitions. [2025-04-13 17:34:37,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:34:37,523 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:37,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:37,524 INFO L225 Difference]: With dead ends: 358 [2025-04-13 17:34:37,524 INFO L226 Difference]: Without dead ends: 332 [2025-04-13 17:34:37,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=395, Invalid=3387, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:34:37,525 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:37,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 115 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:34:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-13 17:34:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 324. [2025-04-13 17:34:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.674922600619195) internal successors, (864), 323 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 864 transitions. [2025-04-13 17:34:37,657 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 864 transitions. Word has length 29 [2025-04-13 17:34:37,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:37,657 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 864 transitions. [2025-04-13 17:34:37,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 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:34:37,657 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 864 transitions. [2025-04-13 17:34:37,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:37,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:37,658 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:37,665 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:34:37,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:37,858 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:34:37,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -13411466, now seen corresponding path program 58 times [2025-04-13 17:34:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:37,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655630885] [2025-04-13 17:34:37,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:37,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:37,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:37,880 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:34:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:38,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655630885] [2025-04-13 17:34:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655630885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:38,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249482339] [2025-04-13 17:34:38,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:38,068 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:34:38,068 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:34:38,170 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:38,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:38,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:38,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:38,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:34:38,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:38,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:38,373 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:38,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 53 treesize of output 75 [2025-04-13 17:34:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:34:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249482339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:38,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 17:34:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316732142] [2025-04-13 17:34:38,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:38,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:34:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:38,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:34:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:34:38,443 INFO L87 Difference]: Start difference. First operand 324 states and 864 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 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:34:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:39,243 INFO L93 Difference]: Finished difference Result 400 states and 990 transitions. [2025-04-13 17:34:39,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:34:39,243 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 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:34:39,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:39,245 INFO L225 Difference]: With dead ends: 400 [2025-04-13 17:34:39,245 INFO L226 Difference]: Without dead ends: 374 [2025-04-13 17:34:39,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:34:39,246 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:39,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-04-13 17:34:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 324. [2025-04-13 17:34:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.613003095975232) internal successors, (844), 323 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 844 transitions. [2025-04-13 17:34:39,385 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 844 transitions. Word has length 29 [2025-04-13 17:34:39,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:39,385 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 844 transitions. [2025-04-13 17:34:39,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 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:34:39,385 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 844 transitions. [2025-04-13 17:34:39,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:39,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:39,386 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:39,392 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:34:39,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:39,586 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:34:39,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1759748854, now seen corresponding path program 59 times [2025-04-13 17:34:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:39,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581011961] [2025-04-13 17:34:39,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:39,595 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:39,607 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:39,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:34:39,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:34:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:39,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581011961] [2025-04-13 17:34:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581011961] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:39,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024287941] [2025-04-13 17:34:39,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:39,848 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:34:39,849 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:34:39,952 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:40,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:40,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:34:40,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:40,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:34:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:40,171 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 15 treesize of output 1 [2025-04-13 17:34:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:40,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:40,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:40,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:40,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:34:40,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:40,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:34:40,797 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:34:40,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:34:40,837 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:34:40,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:34:40,982 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:40,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:40,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:34:41,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:34:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024287941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:41,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 15] total 41 [2025-04-13 17:34:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029845137] [2025-04-13 17:34:41,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:41,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:34:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:41,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:34:41,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:34:41,140 INFO L87 Difference]: Start difference. First operand 324 states and 844 transitions. Second operand has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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:34:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:42,203 INFO L93 Difference]: Finished difference Result 414 states and 1027 transitions. [2025-04-13 17:34:42,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:34:42,204 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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) Word has length 29 [2025-04-13 17:34:42,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:42,206 INFO L225 Difference]: With dead ends: 414 [2025-04-13 17:34:42,206 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 17:34:42,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=2356, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:34:42,206 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:42,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 97 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:34:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 17:34:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 320. [2025-04-13 17:34:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.6081504702194356) internal successors, (832), 319 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 832 transitions. [2025-04-13 17:34:42,342 INFO L79 Accepts]: Start accepts. Automaton has 320 states and 832 transitions. Word has length 29 [2025-04-13 17:34:42,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:42,342 INFO L485 AbstractCegarLoop]: Abstraction has 320 states and 832 transitions. [2025-04-13 17:34:42,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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:34:42,342 INFO L278 IsEmpty]: Start isEmpty. Operand 320 states and 832 transitions. [2025-04-13 17:34:42,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:42,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:42,343 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:42,350 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:34:42,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 17:34:42,543 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:34:42,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1673861401, now seen corresponding path program 60 times [2025-04-13 17:34:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:42,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182991181] [2025-04-13 17:34:42,544 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:42,549 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:42,562 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:42,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:34:42,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:42,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182991181] [2025-04-13 17:34:42,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182991181] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:42,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067698730] [2025-04-13 17:34:42,831 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:42,833 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:34:42,834 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:34:42,939 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:42,961 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:42,961 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:34:42,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:42,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:34:42,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:43,250 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:34:43,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:43,309 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:34:43,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:34:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067698730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:43,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 38 [2025-04-13 17:34:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785667155] [2025-04-13 17:34:43,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:43,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:34:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:43,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:34:43,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:34:43,576 INFO L87 Difference]: Start difference. First operand 320 states and 832 transitions. Second operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:44,271 INFO L93 Difference]: Finished difference Result 382 states and 984 transitions. [2025-04-13 17:34:44,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:34:44,272 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:44,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:44,274 INFO L225 Difference]: With dead ends: 382 [2025-04-13 17:34:44,274 INFO L226 Difference]: Without dead ends: 372 [2025-04-13 17:34:44,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1916, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:34:44,274 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:44,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 94 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-13 17:34:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 322. [2025-04-13 17:34:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.607476635514019) internal successors, (837), 321 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 837 transitions. [2025-04-13 17:34:44,410 INFO L79 Accepts]: Start accepts. Automaton has 322 states and 837 transitions. Word has length 29 [2025-04-13 17:34:44,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:44,410 INFO L485 AbstractCegarLoop]: Abstraction has 322 states and 837 transitions. [2025-04-13 17:34:44,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:44,410 INFO L278 IsEmpty]: Start isEmpty. Operand 322 states and 837 transitions. [2025-04-13 17:34:44,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:44,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:44,411 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:44,417 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:34:44,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 17:34:44,611 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:34:44,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -958173449, now seen corresponding path program 61 times [2025-04-13 17:34:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:44,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571193841] [2025-04-13 17:34:44,612 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:44,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:45,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:45,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571193841] [2025-04-13 17:34:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571193841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:45,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262599835] [2025-04-13 17:34:45,057 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:45,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:45,058 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:34:45,059 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:34:45,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:34:45,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:45,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:45,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:45,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:34:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:45,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:45,661 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:34:45,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:34:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262599835] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:46,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:34:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660935464] [2025-04-13 17:34:46,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:46,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:34:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:46,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:34:46,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2553, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:34:46,133 INFO L87 Difference]: Start difference. First operand 322 states and 837 transitions. Second operand has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:47,100 INFO L93 Difference]: Finished difference Result 396 states and 1017 transitions. [2025-04-13 17:34:47,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:34:47,100 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:34:47,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:47,102 INFO L225 Difference]: With dead ends: 396 [2025-04-13 17:34:47,102 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 17:34:47,102 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=478, Invalid=4214, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:34:47,102 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:47,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 85 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 17:34:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 317. [2025-04-13 17:34:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.6107594936708862) internal successors, (825), 316 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 825 transitions. [2025-04-13 17:34:47,233 INFO L79 Accepts]: Start accepts. Automaton has 317 states and 825 transitions. Word has length 29 [2025-04-13 17:34:47,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:47,233 INFO L485 AbstractCegarLoop]: Abstraction has 317 states and 825 transitions. [2025-04-13 17:34:47,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:47,234 INFO L278 IsEmpty]: Start isEmpty. Operand 317 states and 825 transitions. [2025-04-13 17:34:47,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:47,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:47,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-04-13 17:34:47,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:47,435 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:34:47,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash -946875175, now seen corresponding path program 62 times [2025-04-13 17:34:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:47,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429395521] [2025-04-13 17:34:47,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:47,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:47,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:47,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:47,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429395521] [2025-04-13 17:34:47,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429395521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:47,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960234382] [2025-04-13 17:34:47,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:47,870 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:34:47,871 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:34:47,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:47,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:47,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:34:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:48,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:34:48,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:48,207 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 15 treesize of output 1 [2025-04-13 17:34:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:48,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:48,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:48,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:34:48,903 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:34:48,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:34:48,934 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:34:48,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:34:49,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:49,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:49,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:34:49,091 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:34:49,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:34:49,100 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:49,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:49,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:34:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960234382] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:49,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2025-04-13 17:34:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50595656] [2025-04-13 17:34:49,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:49,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 17:34:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:49,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 17:34:49,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:34:49,416 INFO L87 Difference]: Start difference. First operand 317 states and 825 transitions. Second operand has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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:34:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:50,658 INFO L93 Difference]: Finished difference Result 384 states and 979 transitions. [2025-04-13 17:34:50,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:34:50,659 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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) Word has length 29 [2025-04-13 17:34:50,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:50,663 INFO L225 Difference]: With dead ends: 384 [2025-04-13 17:34:50,663 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 17:34:50,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=407, Invalid=3883, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:34:50,663 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:50,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 139 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:34:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 17:34:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 317. [2025-04-13 17:34:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.6107594936708862) internal successors, (825), 316 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 825 transitions. [2025-04-13 17:34:50,797 INFO L79 Accepts]: Start accepts. Automaton has 317 states and 825 transitions. Word has length 29 [2025-04-13 17:34:50,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:50,797 INFO L485 AbstractCegarLoop]: Abstraction has 317 states and 825 transitions. [2025-04-13 17:34:50,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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:34:50,798 INFO L278 IsEmpty]: Start isEmpty. Operand 317 states and 825 transitions. [2025-04-13 17:34:50,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:50,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:50,798 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:50,804 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:34:50,998 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,SelfDestructingSolverStorable69 [2025-04-13 17:34:50,999 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:34:50,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1050223546, now seen corresponding path program 63 times [2025-04-13 17:34:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:50,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864005611] [2025-04-13 17:34:50,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:51,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:51,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:51,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:34:51,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:51,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864005611] [2025-04-13 17:34:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864005611] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:51,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845347526] [2025-04-13 17:34:51,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:51,559 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:34:51,561 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:34:51,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:51,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:51,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:34:51,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:51,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:34:51,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:51,933 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 15 treesize of output 1 [2025-04-13 17:34:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:34:52,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:52,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:52,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:34:52,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:34:52,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:34:52,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:34:52,747 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:34:52,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:34:52,780 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:34:52,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:34:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:34:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845347526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:53,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 15] total 51 [2025-04-13 17:34:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249255783] [2025-04-13 17:34:53,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:53,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 17:34:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:53,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 17:34:53,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:34:53,089 INFO L87 Difference]: Start difference. First operand 317 states and 825 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 51 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:34:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:55,215 INFO L93 Difference]: Finished difference Result 526 states and 1334 transitions. [2025-04-13 17:34:55,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:34:55,215 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 51 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) Word has length 29 [2025-04-13 17:34:55,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:55,217 INFO L225 Difference]: With dead ends: 526 [2025-04-13 17:34:55,217 INFO L226 Difference]: Without dead ends: 494 [2025-04-13 17:34:55,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=574, Invalid=6736, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:34:55,218 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 115 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:55,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 222 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:34:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-04-13 17:34:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 378. [2025-04-13 17:34:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.559681697612732) internal successors, (965), 377 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 965 transitions. [2025-04-13 17:34:55,368 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 965 transitions. Word has length 29 [2025-04-13 17:34:55,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:55,368 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 965 transitions. [2025-04-13 17:34:55,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 51 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:34:55,368 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 965 transitions. [2025-04-13 17:34:55,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:55,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:55,369 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:55,375 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:34:55,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:55,570 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:34:55,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash -756980843, now seen corresponding path program 64 times [2025-04-13 17:34:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:55,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442457186] [2025-04-13 17:34:55,570 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:55,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:55,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:55,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:34:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:55,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442457186] [2025-04-13 17:34:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442457186] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:55,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315853250] [2025-04-13 17:34:55,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:55,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:55,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:55,796 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:34:55,796 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:34:55,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:34:55,927 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:55,927 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:55,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:55,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:34:55,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:34:56,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:56,142 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:56,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:34:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:34:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315853250] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:56,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2025-04-13 17:34:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813419629] [2025-04-13 17:34:56,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:56,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:34:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:56,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:34:56,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:34:56,210 INFO L87 Difference]: Start difference. First operand 378 states and 965 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 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:34:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:57,050 INFO L93 Difference]: Finished difference Result 422 states and 1034 transitions. [2025-04-13 17:34:57,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:34:57,050 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 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:34:57,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:57,052 INFO L225 Difference]: With dead ends: 422 [2025-04-13 17:34:57,052 INFO L226 Difference]: Without dead ends: 394 [2025-04-13 17:34:57,052 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:34:57,053 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:57,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 99 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:34:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-04-13 17:34:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 370. [2025-04-13 17:34:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.5013550135501355) internal successors, (923), 369 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 923 transitions. [2025-04-13 17:34:57,205 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 923 transitions. Word has length 29 [2025-04-13 17:34:57,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:57,205 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 923 transitions. [2025-04-13 17:34:57,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 25 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:34:57,205 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 923 transitions. [2025-04-13 17:34:57,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:57,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:57,206 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:57,213 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:34:57,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:57,406 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:34:57,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -656227240, now seen corresponding path program 65 times [2025-04-13 17:34:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:57,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453627529] [2025-04-13 17:34:57,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:57,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:57,420 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:57,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:34:57,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:57,708 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:34:57,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:57,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453627529] [2025-04-13 17:34:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453627529] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:57,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876844626] [2025-04-13 17:34:57,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:57,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:57,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:57,710 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:34:57,711 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:34:57,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:57,871 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:57,871 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:34:57,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:57,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:34:57,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:34:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 17:34:58,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:34:58,160 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:34:58,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:34:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:34:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876844626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:34:58,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:34:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 29 [2025-04-13 17:34:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71819675] [2025-04-13 17:34:58,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:34:58,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:34:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:58,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:34:58,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:34:58,246 INFO L87 Difference]: Start difference. First operand 370 states and 923 transitions. Second operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 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:34:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:59,283 INFO L93 Difference]: Finished difference Result 452 states and 1142 transitions. [2025-04-13 17:34:59,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:34:59,284 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:34:59,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:59,285 INFO L225 Difference]: With dead ends: 452 [2025-04-13 17:34:59,285 INFO L226 Difference]: Without dead ends: 432 [2025-04-13 17:34:59,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=2704, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 17:34:59,286 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:59,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 99 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:34:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-04-13 17:34:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 296. [2025-04-13 17:34:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.5084745762711864) internal successors, (740), 295 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:34:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 740 transitions. [2025-04-13 17:34:59,426 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 740 transitions. Word has length 29 [2025-04-13 17:34:59,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:59,426 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 740 transitions. [2025-04-13 17:34:59,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 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:34:59,426 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 740 transitions. [2025-04-13 17:34:59,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:34:59,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:59,427 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:59,434 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:34:59,627 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,SelfDestructingSolverStorable72 [2025-04-13 17:34:59,627 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:34:59,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -751365483, now seen corresponding path program 66 times [2025-04-13 17:34:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:59,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888750736] [2025-04-13 17:34:59,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:59,634 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:59,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:59,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:34:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-13 17:34:59,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:59,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888750736] [2025-04-13 17:34:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888750736] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:34:59,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396584379] [2025-04-13 17:34:59,805 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:34:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:34:59,807 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:34:59,808 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:34:59,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:34:59,945 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:34:59,945 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:34:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:59,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:34:59,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:00,108 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 15 treesize of output 1 [2025-04-13 17:35:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:00,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:00,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:00,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:35:00,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:35:00,689 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:35:00,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:35:00,696 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:00,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:35:00,723 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:35:00,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:35:00,753 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:35:00,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:35:00,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:00,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:35:00,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:00,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:35:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:35:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396584379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:01,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 15] total 41 [2025-04-13 17:35:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113161111] [2025-04-13 17:35:01,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:01,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:35:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:01,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:35:01,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:35:01,036 INFO L87 Difference]: Start difference. First operand 296 states and 740 transitions. Second operand has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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:35:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:02,348 INFO L93 Difference]: Finished difference Result 454 states and 1158 transitions. [2025-04-13 17:35:02,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:35:02,348 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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) Word has length 29 [2025-04-13 17:35:02,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:02,350 INFO L225 Difference]: With dead ends: 454 [2025-04-13 17:35:02,350 INFO L226 Difference]: Without dead ends: 441 [2025-04-13 17:35:02,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=506, Invalid=3784, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:35:02,350 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 120 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:02,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 67 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-04-13 17:35:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 290. [2025-04-13 17:35:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 2.4740484429065743) internal successors, (715), 289 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 715 transitions. [2025-04-13 17:35:02,500 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 715 transitions. Word has length 29 [2025-04-13 17:35:02,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:02,500 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 715 transitions. [2025-04-13 17:35:02,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 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:35:02,501 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 715 transitions. [2025-04-13 17:35:02,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:02,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:02,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:02,509 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:35:02,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:02,702 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:35:02,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -740067209, now seen corresponding path program 67 times [2025-04-13 17:35:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:02,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480275377] [2025-04-13 17:35:02,702 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:02,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:02,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:02,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:02,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:03,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480275377] [2025-04-13 17:35:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480275377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:03,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38017127] [2025-04-13 17:35:03,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:03,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:03,146 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:35:03,147 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:35:03,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:03,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:03,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:03,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:03,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:35:03,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:03,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:03,793 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:03,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38017127] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:04,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:35:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283221395] [2025-04-13 17:35:04,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:04,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:35:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:04,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:35:04,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:35:04,256 INFO L87 Difference]: Start difference. First operand 290 states and 715 transitions. Second operand has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:05,463 INFO L93 Difference]: Finished difference Result 394 states and 975 transitions. [2025-04-13 17:35:05,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:35:05,463 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:35:05,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:05,464 INFO L225 Difference]: With dead ends: 394 [2025-04-13 17:35:05,464 INFO L226 Difference]: Without dead ends: 387 [2025-04-13 17:35:05,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=4213, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:35:05,465 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 76 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:05,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 119 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-04-13 17:35:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 292. [2025-04-13 17:35:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.4742268041237114) internal successors, (720), 291 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 720 transitions. [2025-04-13 17:35:05,615 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 720 transitions. Word has length 29 [2025-04-13 17:35:05,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:05,615 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 720 transitions. [2025-04-13 17:35:05,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:05,615 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 720 transitions. [2025-04-13 17:35:05,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:05,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:05,615 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:05,622 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:35:05,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:05,816 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:35:05,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1373123250, now seen corresponding path program 68 times [2025-04-13 17:35:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:05,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256890842] [2025-04-13 17:35:05,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:05,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:05,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:05,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:05,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:06,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256890842] [2025-04-13 17:35:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256890842] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:06,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784579626] [2025-04-13 17:35:06,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:06,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:06,243 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:35:06,244 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:35:06,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:06,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:06,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:06,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:06,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:35:06,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:06,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:06,937 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:06,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 53 treesize of output 90 [2025-04-13 17:35:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784579626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:07,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-13 17:35:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246723870] [2025-04-13 17:35:07,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:07,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 17:35:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:07,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 17:35:07,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:35:07,388 INFO L87 Difference]: Start difference. First operand 292 states and 720 transitions. Second operand has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 52 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:35:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:08,223 INFO L93 Difference]: Finished difference Result 342 states and 841 transitions. [2025-04-13 17:35:08,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:35:08,223 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 52 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 29 [2025-04-13 17:35:08,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:08,224 INFO L225 Difference]: With dead ends: 342 [2025-04-13 17:35:08,224 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 17:35:08,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=3613, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:35:08,225 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:08,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 17:35:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 296. [2025-04-13 17:35:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.4745762711864407) internal successors, (730), 295 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 730 transitions. [2025-04-13 17:35:08,373 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 730 transitions. Word has length 29 [2025-04-13 17:35:08,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:08,373 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 730 transitions. [2025-04-13 17:35:08,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 52 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:35:08,374 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 730 transitions. [2025-04-13 17:35:08,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:08,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:08,374 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:08,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2025-04-13 17:35:08,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:08,574 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:35:08,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1402891503, now seen corresponding path program 69 times [2025-04-13 17:35:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:08,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447867457] [2025-04-13 17:35:08,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:08,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 17:35:08,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:08,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:35:08,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:09,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447867457] [2025-04-13 17:35:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447867457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:09,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781813081] [2025-04-13 17:35:09,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:09,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:09,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:09,012 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:35:09,013 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:35:09,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 17:35:09,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:09,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:35:09,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:09,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:35:09,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:09,311 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 15 treesize of output 1 [2025-04-13 17:35:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:09,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:09,954 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:09,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:35:09,961 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:35:09,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:35:10,012 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:35:10,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 17:35:10,113 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:10,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:35:10,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:35:10,132 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:35:10,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:35:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:35:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781813081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:10,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 15] total 45 [2025-04-13 17:35:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587177827] [2025-04-13 17:35:10,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:10,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 17:35:10,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:10,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 17:35:10,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1818, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:35:10,283 INFO L87 Difference]: Start difference. First operand 296 states and 730 transitions. Second operand has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 45 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:11,139 INFO L93 Difference]: Finished difference Result 343 states and 848 transitions. [2025-04-13 17:35:11,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:35:11,139 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 45 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:35:11,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:11,140 INFO L225 Difference]: With dead ends: 343 [2025-04-13 17:35:11,140 INFO L226 Difference]: Without dead ends: 333 [2025-04-13 17:35:11,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=2335, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:35:11,141 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:11,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 98 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-13 17:35:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 296. [2025-04-13 17:35:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.4745762711864407) internal successors, (730), 295 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 730 transitions. [2025-04-13 17:35:11,292 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 730 transitions. Word has length 29 [2025-04-13 17:35:11,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:11,292 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 730 transitions. [2025-04-13 17:35:11,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 45 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:11,292 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 730 transitions. [2025-04-13 17:35:11,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:11,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:11,293 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:11,300 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:35:11,493 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,SelfDestructingSolverStorable76 [2025-04-13 17:35:11,493 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:35:11,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash -233720943, now seen corresponding path program 70 times [2025-04-13 17:35:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:11,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654330584] [2025-04-13 17:35:11,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:11,500 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:11,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:11,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:11,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:35:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:11,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654330584] [2025-04-13 17:35:11,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654330584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:11,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009340223] [2025-04-13 17:35:11,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:11,685 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:35:11,685 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:35:11,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:11,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:11,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:11,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:11,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:35:11,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:12,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:12,063 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:35:12,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:35:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:35:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009340223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:12,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:12,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 21 [2025-04-13 17:35:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678987633] [2025-04-13 17:35:12,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:12,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:35:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:12,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:35:12,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:35:12,119 INFO L87 Difference]: Start difference. First operand 296 states and 730 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 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:35:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:12,964 INFO L93 Difference]: Finished difference Result 426 states and 1061 transitions. [2025-04-13 17:35:12,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:35:12,964 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 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:35:12,964 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:12,965 INFO L225 Difference]: With dead ends: 426 [2025-04-13 17:35:12,965 INFO L226 Difference]: Without dead ends: 419 [2025-04-13 17:35:12,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:35:12,966 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:12,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 62 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-13 17:35:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 294. [2025-04-13 17:35:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.474402730375427) internal successors, (725), 293 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 725 transitions. [2025-04-13 17:35:13,115 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 725 transitions. Word has length 29 [2025-04-13 17:35:13,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:13,115 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 725 transitions. [2025-04-13 17:35:13,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 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:35:13,115 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 725 transitions. [2025-04-13 17:35:13,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:13,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:13,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:13,121 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:35:13,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:13,316 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:35:13,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1256836180, now seen corresponding path program 71 times [2025-04-13 17:35:13,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:13,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542935378] [2025-04-13 17:35:13,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:13,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:35:13,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:13,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:35:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:13,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:13,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542935378] [2025-04-13 17:35:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542935378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:13,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762128419] [2025-04-13 17:35:13,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:13,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:13,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:13,639 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:35:13,640 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:35:13,762 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:35:13,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:13,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:35:13,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:13,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:35:13,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:14,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:14,367 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:14,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762128419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:14,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 48 [2025-04-13 17:35:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737922297] [2025-04-13 17:35:14,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:14,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 17:35:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:14,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 17:35:14,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2135, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:35:14,758 INFO L87 Difference]: Start difference. First operand 294 states and 725 transitions. Second operand has 49 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:15,526 INFO L93 Difference]: Finished difference Result 316 states and 764 transitions. [2025-04-13 17:35:15,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:35:15,526 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:35:15,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:15,527 INFO L225 Difference]: With dead ends: 316 [2025-04-13 17:35:15,527 INFO L226 Difference]: Without dead ends: 291 [2025-04-13 17:35:15,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=2603, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:35:15,528 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:15,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 158 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-13 17:35:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-04-13 17:35:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.4793103448275864) internal successors, (719), 290 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 719 transitions. [2025-04-13 17:35:15,679 INFO L79 Accepts]: Start accepts. Automaton has 291 states and 719 transitions. Word has length 29 [2025-04-13 17:35:15,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:15,679 INFO L485 AbstractCegarLoop]: Abstraction has 291 states and 719 transitions. [2025-04-13 17:35:15,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:15,679 INFO L278 IsEmpty]: Start isEmpty. Operand 291 states and 719 transitions. [2025-04-13 17:35:15,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:15,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:15,679 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:15,686 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:35:15,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:15,880 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:35:15,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1548726120, now seen corresponding path program 72 times [2025-04-13 17:35:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:15,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560205379] [2025-04-13 17:35:15,880 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:15,886 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:35:15,894 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:15,894 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:35:15,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:16,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560205379] [2025-04-13 17:35:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560205379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:16,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536661780] [2025-04-13 17:35:16,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:16,398 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:35:16,399 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:35:16,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:35:16,543 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:16,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:35:16,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:16,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:35:16,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:16,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:17,040 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:17,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536661780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:17,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:17,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 45 [2025-04-13 17:35:17,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671585864] [2025-04-13 17:35:17,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:17,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 17:35:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:17,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 17:35:17,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:35:17,312 INFO L87 Difference]: Start difference. First operand 291 states and 719 transitions. Second operand has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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:35:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:18,302 INFO L93 Difference]: Finished difference Result 339 states and 817 transitions. [2025-04-13 17:35:18,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:35:18,303 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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) Word has length 29 [2025-04-13 17:35:18,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:18,304 INFO L225 Difference]: With dead ends: 339 [2025-04-13 17:35:18,304 INFO L226 Difference]: Without dead ends: 313 [2025-04-13 17:35:18,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:35:18,304 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:18,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 119 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-13 17:35:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2025-04-13 17:35:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 2.4794520547945207) internal successors, (724), 292 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 724 transitions. [2025-04-13 17:35:18,453 INFO L79 Accepts]: Start accepts. Automaton has 293 states and 724 transitions. Word has length 29 [2025-04-13 17:35:18,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:18,453 INFO L485 AbstractCegarLoop]: Abstraction has 293 states and 724 transitions. [2025-04-13 17:35:18,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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:35:18,453 INFO L278 IsEmpty]: Start isEmpty. Operand 293 states and 724 transitions. [2025-04-13 17:35:18,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:18,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:18,453 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:18,462 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:35:18,653 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,SelfDestructingSolverStorable79 [2025-04-13 17:35:18,654 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:35:18,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 161887188, now seen corresponding path program 73 times [2025-04-13 17:35:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:18,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439764719] [2025-04-13 17:35:18,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:18,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:18,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:19,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439764719] [2025-04-13 17:35:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439764719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:19,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912000744] [2025-04-13 17:35:19,098 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:19,100 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:35:19,100 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:35:19,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:19,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:19,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:19,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:19,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:35:19,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:19,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:19,681 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:19,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912000744] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:20,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:35:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92564154] [2025-04-13 17:35:20,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:20,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:35:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:35:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2555, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:35:20,147 INFO L87 Difference]: Start difference. First operand 293 states and 724 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:35:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:20,956 INFO L93 Difference]: Finished difference Result 309 states and 753 transitions. [2025-04-13 17:35:20,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:35:20,956 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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) Word has length 29 [2025-04-13 17:35:20,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:20,957 INFO L225 Difference]: With dead ends: 309 [2025-04-13 17:35:20,957 INFO L226 Difference]: Without dead ends: 295 [2025-04-13 17:35:20,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=3851, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:35:20,958 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:20,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 113 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:35:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-04-13 17:35:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-04-13 17:35:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 2.479591836734694) internal successors, (729), 294 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 729 transitions. [2025-04-13 17:35:21,107 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 729 transitions. Word has length 29 [2025-04-13 17:35:21,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:21,107 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 729 transitions. [2025-04-13 17:35:21,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 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:35:21,107 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 729 transitions. [2025-04-13 17:35:21,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:21,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:21,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:21,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2025-04-13 17:35:21,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:21,308 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:35:21,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1879636248, now seen corresponding path program 74 times [2025-04-13 17:35:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:21,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881904887] [2025-04-13 17:35:21,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:21,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:21,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:21,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:21,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:21,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:21,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881904887] [2025-04-13 17:35:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881904887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:21,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384137073] [2025-04-13 17:35:21,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:21,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:21,750 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:35:21,751 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:35:21,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:21,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:21,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:21,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:21,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 17:35:21,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:22,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:22,362 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:35:22,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:35:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384137073] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:22,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-13 17:35:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443170929] [2025-04-13 17:35:22,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:22,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 17:35:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 17:35:22,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2444, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:35:22,813 INFO L87 Difference]: Start difference. First operand 295 states and 729 transitions. Second operand has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:23,399 INFO L93 Difference]: Finished difference Result 312 states and 763 transitions. [2025-04-13 17:35:23,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:35:23,399 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:35:23,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:23,400 INFO L225 Difference]: With dead ends: 312 [2025-04-13 17:35:23,400 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 17:35:23,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=3007, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:35:23,401 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 58 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:23,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 88 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 17:35:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-04-13 17:35:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.47972972972973) internal successors, (734), 296 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 734 transitions. [2025-04-13 17:35:23,549 INFO L79 Accepts]: Start accepts. Automaton has 297 states and 734 transitions. Word has length 29 [2025-04-13 17:35:23,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:23,549 INFO L485 AbstractCegarLoop]: Abstraction has 297 states and 734 transitions. [2025-04-13 17:35:23,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:23,550 INFO L278 IsEmpty]: Start isEmpty. Operand 297 states and 734 transitions. [2025-04-13 17:35:23,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:23,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:23,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:23,556 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:35:23,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:23,750 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:35:23,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1935047508, now seen corresponding path program 75 times [2025-04-13 17:35:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:23,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723475194] [2025-04-13 17:35:23,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:23,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 17:35:23,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:23,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:35:23,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:24,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:24,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723475194] [2025-04-13 17:35:24,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723475194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:24,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093986380] [2025-04-13 17:35:24,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:24,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:24,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:24,219 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:35:24,219 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:35:24,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 17:35:24,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:24,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:35:24,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:24,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 17:35:24,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:24,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 17:35:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:24,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:25,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:25,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:35:25,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:35:25,289 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:25,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:35:25,320 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:35:25,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:35:25,351 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:35:25,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:35:25,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:35:25,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:35:25,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:35:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093986380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:25,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:25,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2025-04-13 17:35:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664294869] [2025-04-13 17:35:25,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:25,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 17:35:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:25,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 17:35:25,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2465, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:35:25,854 INFO L87 Difference]: Start difference. First operand 297 states and 734 transitions. Second operand has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:26,673 INFO L93 Difference]: Finished difference Result 321 states and 790 transitions. [2025-04-13 17:35:26,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:35:26,673 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:35:26,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:26,675 INFO L225 Difference]: With dead ends: 321 [2025-04-13 17:35:26,675 INFO L226 Difference]: Without dead ends: 313 [2025-04-13 17:35:26,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=368, Invalid=2938, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:35:26,675 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:26,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-13 17:35:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2025-04-13 17:35:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.47972972972973) internal successors, (734), 296 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 734 transitions. [2025-04-13 17:35:26,834 INFO L79 Accepts]: Start accepts. Automaton has 297 states and 734 transitions. Word has length 29 [2025-04-13 17:35:26,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:26,834 INFO L485 AbstractCegarLoop]: Abstraction has 297 states and 734 transitions. [2025-04-13 17:35:26,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:26,834 INFO L278 IsEmpty]: Start isEmpty. Operand 297 states and 734 transitions. [2025-04-13 17:35:26,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:26,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:26,835 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:26,842 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:35:27,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:27,035 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:35:27,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1849160055, now seen corresponding path program 76 times [2025-04-13 17:35:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:27,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343518561] [2025-04-13 17:35:27,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:27,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:27,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:27,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-13 17:35:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:27,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343518561] [2025-04-13 17:35:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343518561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:27,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538086408] [2025-04-13 17:35:27,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:27,209 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:35:27,210 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:35:27,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:35:27,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:27,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:27,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:27,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:35:27,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:27,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:27,526 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:35:27,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:35:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-13 17:35:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538086408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:27,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 20 [2025-04-13 17:35:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144428082] [2025-04-13 17:35:27,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:27,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:35:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:27,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:35:27,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:35:27,592 INFO L87 Difference]: Start difference. First operand 297 states and 734 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 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:35:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:28,397 INFO L93 Difference]: Finished difference Result 432 states and 1027 transitions. [2025-04-13 17:35:28,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:35:28,397 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 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:35:28,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:28,399 INFO L225 Difference]: With dead ends: 432 [2025-04-13 17:35:28,399 INFO L226 Difference]: Without dead ends: 425 [2025-04-13 17:35:28,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:35:28,399 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:28,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:35:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-13 17:35:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 297. [2025-04-13 17:35:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.47972972972973) internal successors, (734), 296 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 734 transitions. [2025-04-13 17:35:28,566 INFO L79 Accepts]: Start accepts. Automaton has 297 states and 734 transitions. Word has length 29 [2025-04-13 17:35:28,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:28,566 INFO L485 AbstractCegarLoop]: Abstraction has 297 states and 734 transitions. [2025-04-13 17:35:28,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 20 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:35:28,566 INFO L278 IsEmpty]: Start isEmpty. Operand 297 states and 734 transitions. [2025-04-13 17:35:28,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:28,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:28,566 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:28,573 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:35:28,767 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,SelfDestructingSolverStorable83 [2025-04-13 17:35:28,767 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:35:28,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:28,767 INFO L85 PathProgramCache]: Analyzing trace with hash -782874795, now seen corresponding path program 77 times [2025-04-13 17:35:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:28,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7723841] [2025-04-13 17:35:28,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:28,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:35:28,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:28,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:35:28,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:29,065 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:35:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:29,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7723841] [2025-04-13 17:35:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7723841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:29,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42053821] [2025-04-13 17:35:29,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:29,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:29,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:29,067 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:35:29,068 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:35:29,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:35:29,266 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:29,267 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:35:29,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:29,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:35:29,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:29,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:29,790 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:29,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42053821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:30,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:30,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 46 [2025-04-13 17:35:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232283411] [2025-04-13 17:35:30,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:30,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 17:35:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:30,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 17:35:30,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:35:30,182 INFO L87 Difference]: Start difference. First operand 297 states and 734 transitions. Second operand has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:31,035 INFO L93 Difference]: Finished difference Result 377 states and 943 transitions. [2025-04-13 17:35:31,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:35:31,035 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:35:31,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:31,037 INFO L225 Difference]: With dead ends: 377 [2025-04-13 17:35:31,037 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 17:35:31,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=2996, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:35:31,037 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:31,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 96 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:35:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 17:35:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 297. [2025-04-13 17:35:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.47972972972973) internal successors, (734), 296 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 734 transitions. [2025-04-13 17:35:31,197 INFO L79 Accepts]: Start accepts. Automaton has 297 states and 734 transitions. Word has length 29 [2025-04-13 17:35:31,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:31,197 INFO L485 AbstractCegarLoop]: Abstraction has 297 states and 734 transitions. [2025-04-13 17:35:31,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:31,198 INFO L278 IsEmpty]: Start isEmpty. Operand 297 states and 734 transitions. [2025-04-13 17:35:31,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:31,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:31,198 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:31,205 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:35:31,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:31,398 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:35:31,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -771576521, now seen corresponding path program 78 times [2025-04-13 17:35:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:31,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044688372] [2025-04-13 17:35:31,399 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:31,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:35:31,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:31,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:35:31,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:31,597 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:35:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:31,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044688372] [2025-04-13 17:35:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044688372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:31,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613044050] [2025-04-13 17:35:31,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:31,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:31,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:31,599 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:35:31,600 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:35:31,733 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:35:31,755 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:31,755 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:35:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:31,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:35:31,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 17:35:31,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:32,077 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:35:32,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:35:32,145 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:35:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613044050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:32,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 8] total 27 [2025-04-13 17:35:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562318129] [2025-04-13 17:35:32,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:32,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:35:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:32,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:35:32,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:35:32,146 INFO L87 Difference]: Start difference. First operand 297 states and 734 transitions. Second operand has 28 states, 28 states have (on average 2.0) 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:35:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:33,647 INFO L93 Difference]: Finished difference Result 553 states and 1378 transitions. [2025-04-13 17:35:33,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:35:33,648 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) 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 29 [2025-04-13 17:35:33,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:33,650 INFO L225 Difference]: With dead ends: 553 [2025-04-13 17:35:33,650 INFO L226 Difference]: Without dead ends: 546 [2025-04-13 17:35:33,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=399, Invalid=2793, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:35:33,650 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 231 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:33,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 77 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-04-13 17:35:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 276. [2025-04-13 17:35:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.429090909090909) internal successors, (668), 275 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 668 transitions. [2025-04-13 17:35:33,794 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 668 transitions. Word has length 29 [2025-04-13 17:35:33,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:33,795 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 668 transitions. [2025-04-13 17:35:33,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) 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:35:33,795 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 668 transitions. [2025-04-13 17:35:33,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:35:33,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:33,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:33,802 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:35:33,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:33,996 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:35:33,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash -421330027, now seen corresponding path program 79 times [2025-04-13 17:35:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:33,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880579963] [2025-04-13 17:35:33,996 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:34,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:34,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:34,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:34,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880579963] [2025-04-13 17:35:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880579963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:34,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863607651] [2025-04-13 17:35:34,452 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:34,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:34,454 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:35:34,454 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:35:34,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:35:34,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:35:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:34,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:35:34,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:35,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:35,175 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:35:35,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:35:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:35:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863607651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:35,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 17:35:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492832685] [2025-04-13 17:35:35,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:35,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 17:35:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:35,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 17:35:35,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:35:35,630 INFO L87 Difference]: Start difference. First operand 276 states and 668 transitions. Second operand has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:36,683 INFO L93 Difference]: Finished difference Result 332 states and 802 transitions. [2025-04-13 17:35:36,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:35:36,683 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:35:36,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:36,684 INFO L225 Difference]: With dead ends: 332 [2025-04-13 17:35:36,684 INFO L226 Difference]: Without dead ends: 325 [2025-04-13 17:35:36,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=458, Invalid=3964, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:35:36,684 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 181 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:36,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 131 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:35:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-13 17:35:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 278. [2025-04-13 17:35:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.436823104693141) internal successors, (675), 277 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 675 transitions. [2025-04-13 17:35:36,830 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 675 transitions. Word has length 29 [2025-04-13 17:35:36,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:36,830 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 675 transitions. [2025-04-13 17:35:36,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:36,830 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 675 transitions. [2025-04-13 17:35:36,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:36,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:36,831 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:36,837 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:35:37,031 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,SelfDestructingSolverStorable86 [2025-04-13 17:35:37,031 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:35:37,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash -349383477, now seen corresponding path program 80 times [2025-04-13 17:35:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:37,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656184812] [2025-04-13 17:35:37,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:37,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:35:37,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:37,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:37,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:37,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656184812] [2025-04-13 17:35:37,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656184812] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:37,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889782842] [2025-04-13 17:35:37,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:37,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:37,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:37,121 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:35:37,121 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:35:37,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:35:37,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:37,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:37,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:35:37,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:37,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889782842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:37,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 14 [2025-04-13 17:35:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132231893] [2025-04-13 17:35:37,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:37,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:37,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:37,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:37,373 INFO L87 Difference]: Start difference. First operand 278 states and 675 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:35:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:37,846 INFO L93 Difference]: Finished difference Result 409 states and 981 transitions. [2025-04-13 17:35:37,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:35:37,846 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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 30 [2025-04-13 17:35:37,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:37,848 INFO L225 Difference]: With dead ends: 409 [2025-04-13 17:35:37,848 INFO L226 Difference]: Without dead ends: 400 [2025-04-13 17:35:37,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:37,848 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:37,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 41 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:35:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-04-13 17:35:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 334. [2025-04-13 17:35:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.5255255255255253) internal successors, (841), 333 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 841 transitions. [2025-04-13 17:35:38,037 INFO L79 Accepts]: Start accepts. Automaton has 334 states and 841 transitions. Word has length 30 [2025-04-13 17:35:38,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:38,037 INFO L485 AbstractCegarLoop]: Abstraction has 334 states and 841 transitions. [2025-04-13 17:35:38,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:35:38,037 INFO L278 IsEmpty]: Start isEmpty. Operand 334 states and 841 transitions. [2025-04-13 17:35:38,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:38,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:38,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:38,044 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:35:38,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:38,238 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:35:38,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1553543307, now seen corresponding path program 81 times [2025-04-13 17:35:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:38,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463507553] [2025-04-13 17:35:38,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:38,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 17:35:38,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:38,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:35:38,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:38,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463507553] [2025-04-13 17:35:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463507553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:38,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956289793] [2025-04-13 17:35:38,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:38,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:38,432 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:35:38,433 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:35:38,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 17:35:38,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:38,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:35:38,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:38,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:35:38,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:38,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956289793] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:39,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 17:35:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368793329] [2025-04-13 17:35:39,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:39,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:35:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:39,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:35:39,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1597, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:35:39,218 INFO L87 Difference]: Start difference. First operand 334 states and 841 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:42,633 INFO L93 Difference]: Finished difference Result 1407 states and 3479 transitions. [2025-04-13 17:35:42,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 17:35:42,633 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:35:42,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:42,636 INFO L225 Difference]: With dead ends: 1407 [2025-04-13 17:35:42,636 INFO L226 Difference]: Without dead ends: 1288 [2025-04-13 17:35:42,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1256, Invalid=9664, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 17:35:42,637 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 483 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:42,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 199 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:35:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-04-13 17:35:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 720. [2025-04-13 17:35:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.6801112656467314) internal successors, (1927), 719 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1927 transitions. [2025-04-13 17:35:43,008 INFO L79 Accepts]: Start accepts. Automaton has 720 states and 1927 transitions. Word has length 30 [2025-04-13 17:35:43,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:43,008 INFO L485 AbstractCegarLoop]: Abstraction has 720 states and 1927 transitions. [2025-04-13 17:35:43,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:43,008 INFO L278 IsEmpty]: Start isEmpty. Operand 720 states and 1927 transitions. [2025-04-13 17:35:43,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:43,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:43,009 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:43,016 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:35:43,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:43,209 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:35:43,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 185023055, now seen corresponding path program 82 times [2025-04-13 17:35:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:43,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635727446] [2025-04-13 17:35:43,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:43,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:35:43,220 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:43,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:43,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:43,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635727446] [2025-04-13 17:35:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635727446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:43,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426418629] [2025-04-13 17:35:43,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:43,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:43,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:43,275 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:35:43,276 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:35:43,416 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:35:43,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:43,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:43,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:43,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:35:43,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:43,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426418629] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:43,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 14 [2025-04-13 17:35:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129176000] [2025-04-13 17:35:43,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:43,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:43,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:43,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:43,553 INFO L87 Difference]: Start difference. First operand 720 states and 1927 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:35:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:44,500 INFO L93 Difference]: Finished difference Result 931 states and 2474 transitions. [2025-04-13 17:35:44,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:35:44,500 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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 30 [2025-04-13 17:35:44,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:44,503 INFO L225 Difference]: With dead ends: 931 [2025-04-13 17:35:44,503 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 17:35:44,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:44,503 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:44,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 57 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 17:35:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 791. [2025-04-13 17:35:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 2.768354430379747) internal successors, (2187), 790 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2187 transitions. [2025-04-13 17:35:44,902 INFO L79 Accepts]: Start accepts. Automaton has 791 states and 2187 transitions. Word has length 30 [2025-04-13 17:35:44,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:44,902 INFO L485 AbstractCegarLoop]: Abstraction has 791 states and 2187 transitions. [2025-04-13 17:35:44,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:35:44,902 INFO L278 IsEmpty]: Start isEmpty. Operand 791 states and 2187 transitions. [2025-04-13 17:35:44,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:44,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:44,903 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:44,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-04-13 17:35:45,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 17:35:45,104 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:35:45,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash 710568203, now seen corresponding path program 83 times [2025-04-13 17:35:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:45,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244095948] [2025-04-13 17:35:45,104 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:45,111 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 17:35:45,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:45,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:35:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:45,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244095948] [2025-04-13 17:35:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244095948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:45,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098959512] [2025-04-13 17:35:45,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:35:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:45,183 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:35:45,184 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:35:45,333 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-04-13 17:35:45,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:45,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:35:45,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:45,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:35:45,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:45,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098959512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:45,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 14 [2025-04-13 17:35:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117703063] [2025-04-13 17:35:45,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:45,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:45,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:45,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:45,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:45,526 INFO L87 Difference]: Start difference. First operand 791 states and 2187 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:35:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:46,595 INFO L93 Difference]: Finished difference Result 998 states and 2713 transitions. [2025-04-13 17:35:46,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:35:46,595 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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 30 [2025-04-13 17:35:46,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:46,598 INFO L225 Difference]: With dead ends: 998 [2025-04-13 17:35:46,598 INFO L226 Difference]: Without dead ends: 989 [2025-04-13 17:35:46,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:46,599 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:46,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-04-13 17:35:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 867. [2025-04-13 17:35:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 2.8418013856812934) internal successors, (2461), 866 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2461 transitions. [2025-04-13 17:35:47,052 INFO L79 Accepts]: Start accepts. Automaton has 867 states and 2461 transitions. Word has length 30 [2025-04-13 17:35:47,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:47,053 INFO L485 AbstractCegarLoop]: Abstraction has 867 states and 2461 transitions. [2025-04-13 17:35:47,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:35:47,053 INFO L278 IsEmpty]: Start isEmpty. Operand 867 states and 2461 transitions. [2025-04-13 17:35:47,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:47,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:47,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:47,061 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:35:47,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:47,254 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:35:47,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1803970259, now seen corresponding path program 84 times [2025-04-13 17:35:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:47,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452223347] [2025-04-13 17:35:47,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:47,261 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:35:47,268 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:47,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:35:47,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:47,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:47,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452223347] [2025-04-13 17:35:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452223347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:47,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994290038] [2025-04-13 17:35:47,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:35:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:47,435 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:35:47,436 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:35:47,582 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:35:47,606 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:47,606 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:35:47,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:47,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:35:47,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:47,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:47,760 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:35:47,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994290038] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:47,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 5] total 24 [2025-04-13 17:35:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442889806] [2025-04-13 17:35:47,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:47,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:35:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:47,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:35:47,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:35:47,761 INFO L87 Difference]: Start difference. First operand 867 states and 2461 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 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:35:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:49,303 INFO L93 Difference]: Finished difference Result 1344 states and 3614 transitions. [2025-04-13 17:35:49,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 17:35:49,304 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 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:35:49,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:49,307 INFO L225 Difference]: With dead ends: 1344 [2025-04-13 17:35:49,307 INFO L226 Difference]: Without dead ends: 1201 [2025-04-13 17:35:49,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:35:49,307 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 170 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:49,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 86 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:35:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-04-13 17:35:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 964. [2025-04-13 17:35:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 2.885773624091381) internal successors, (2779), 963 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 2779 transitions. [2025-04-13 17:35:49,832 INFO L79 Accepts]: Start accepts. Automaton has 964 states and 2779 transitions. Word has length 30 [2025-04-13 17:35:49,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:49,832 INFO L485 AbstractCegarLoop]: Abstraction has 964 states and 2779 transitions. [2025-04-13 17:35:49,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 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:35:49,833 INFO L278 IsEmpty]: Start isEmpty. Operand 964 states and 2779 transitions. [2025-04-13 17:35:49,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:35:49,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:49,834 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:49,840 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:35:50,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:50,034 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:35:50,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -177401393, now seen corresponding path program 85 times [2025-04-13 17:35:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:50,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214606434] [2025-04-13 17:35:50,035 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:50,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:35:50,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:50,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:50,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:50,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214606434] [2025-04-13 17:35:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214606434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:50,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862432095] [2025-04-13 17:35:50,106 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:50,108 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:35:50,108 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:35:50,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:35:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:35:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:50,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:50,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:35:50,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:50,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862432095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:50,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 14 [2025-04-13 17:35:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116016158] [2025-04-13 17:35:50,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:50,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:50,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:50,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:50,390 INFO L87 Difference]: Start difference. First operand 964 states and 2779 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:35:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:51,815 INFO L93 Difference]: Finished difference Result 1193 states and 3359 transitions. [2025-04-13 17:35:51,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:35:51,815 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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 30 [2025-04-13 17:35:51,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:51,818 INFO L225 Difference]: With dead ends: 1193 [2025-04-13 17:35:51,818 INFO L226 Difference]: Without dead ends: 1184 [2025-04-13 17:35:51,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:51,819 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:51,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 70 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-04-13 17:35:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1065. [2025-04-13 17:35:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1064 states have (on average 2.9285714285714284) internal successors, (3116), 1064 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 3116 transitions. [2025-04-13 17:35:52,424 INFO L79 Accepts]: Start accepts. Automaton has 1065 states and 3116 transitions. Word has length 30 [2025-04-13 17:35:52,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:52,424 INFO L485 AbstractCegarLoop]: Abstraction has 1065 states and 3116 transitions. [2025-04-13 17:35:52,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:35:52,424 INFO L278 IsEmpty]: Start isEmpty. Operand 1065 states and 3116 transitions. [2025-04-13 17:35:52,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 17:35:52,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:52,425 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:52,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-13 17:35:52,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:52,626 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:35:52,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2052852284, now seen corresponding path program 86 times [2025-04-13 17:35:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:52,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732000006] [2025-04-13 17:35:52,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:52,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 17:35:52,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:35:52,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:52,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:52,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732000006] [2025-04-13 17:35:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732000006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:52,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6268935] [2025-04-13 17:35:52,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:52,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:52,734 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:35:52,735 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:35:52,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 17:35:52,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:35:52,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:35:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:35:52,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:53,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:35:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6268935] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:53,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-04-13 17:35:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655436470] [2025-04-13 17:35:53,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:53,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:35:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:53,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:35:53,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:35:53,142 INFO L87 Difference]: Start difference. First operand 1065 states and 3116 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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:35:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:55,691 INFO L93 Difference]: Finished difference Result 2844 states and 8019 transitions. [2025-04-13 17:35:55,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:35:55,692 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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 31 [2025-04-13 17:35:55,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:55,696 INFO L225 Difference]: With dead ends: 2844 [2025-04-13 17:35:55,696 INFO L226 Difference]: Without dead ends: 1579 [2025-04-13 17:35:55,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=1918, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:35:55,698 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 210 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:55,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 101 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:35:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-04-13 17:35:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 717. [2025-04-13 17:35:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 2.6396648044692737) internal successors, (1890), 716 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1890 transitions. [2025-04-13 17:35:56,168 INFO L79 Accepts]: Start accepts. Automaton has 717 states and 1890 transitions. Word has length 31 [2025-04-13 17:35:56,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:56,169 INFO L485 AbstractCegarLoop]: Abstraction has 717 states and 1890 transitions. [2025-04-13 17:35:56,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 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:35:56,169 INFO L278 IsEmpty]: Start isEmpty. Operand 717 states and 1890 transitions. [2025-04-13 17:35:56,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 17:35:56,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:56,170 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:56,176 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:35:56,370 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,SelfDestructingSolverStorable93 [2025-04-13 17:35:56,370 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:35:56,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash -494928363, now seen corresponding path program 87 times [2025-04-13 17:35:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:56,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798765626] [2025-04-13 17:35:56,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:56,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-13 17:35:56,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:35:56,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:35:56,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 17:35:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:56,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798765626] [2025-04-13 17:35:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798765626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:56,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638407524] [2025-04-13 17:35:56,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:56,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:56,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:56,472 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:35:56,472 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:35:56,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-13 17:35:56,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:35:56,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:35:56,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:56,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:35:56,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 17:35:56,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 17:35:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638407524] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:56,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 17:35:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100833700] [2025-04-13 17:35:56,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:56,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:35:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:56,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:35:56,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:35:56,849 INFO L87 Difference]: Start difference. First operand 717 states and 1890 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) 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:35:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:57,741 INFO L93 Difference]: Finished difference Result 837 states and 2136 transitions. [2025-04-13 17:35:57,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:35:57,741 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) 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 31 [2025-04-13 17:35:57,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:57,744 INFO L225 Difference]: With dead ends: 837 [2025-04-13 17:35:57,744 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 17:35:57,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:35:57,745 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:57,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:35:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 17:35:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-04-13 17:35:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 2.6763698630136985) internal successors, (1563), 584 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1563 transitions. [2025-04-13 17:35:58,133 INFO L79 Accepts]: Start accepts. Automaton has 585 states and 1563 transitions. Word has length 31 [2025-04-13 17:35:58,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:58,133 INFO L485 AbstractCegarLoop]: Abstraction has 585 states and 1563 transitions. [2025-04-13 17:35:58,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) 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:35:58,133 INFO L278 IsEmpty]: Start isEmpty. Operand 585 states and 1563 transitions. [2025-04-13 17:35:58,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 17:35:58,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:58,134 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:58,140 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:35:58,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:58,334 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:35:58,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -797762326, now seen corresponding path program 88 times [2025-04-13 17:35:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:58,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481194882] [2025-04-13 17:35:58,335 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:58,342 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 17:35:58,346 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 17:35:58,346 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:58,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:35:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:58,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481194882] [2025-04-13 17:35:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481194882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:35:58,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870597380] [2025-04-13 17:35:58,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:35:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:35:58,437 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:35:58,437 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:35:58,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 17:35:58,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 17:35:58,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:58,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:35:58,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:35:58,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:35:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:35:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870597380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:35:58,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:35:58,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-04-13 17:35:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752486850] [2025-04-13 17:35:58,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:35:58,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:35:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:35:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:35:58,818 INFO L87 Difference]: Start difference. First operand 585 states and 1563 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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:35:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:59,557 INFO L93 Difference]: Finished difference Result 613 states and 1607 transitions. [2025-04-13 17:35:59,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:35:59,558 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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 32 [2025-04-13 17:35:59,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:59,560 INFO L225 Difference]: With dead ends: 613 [2025-04-13 17:35:59,560 INFO L226 Difference]: Without dead ends: 434 [2025-04-13 17:35:59,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:35:59,560 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:59,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 69 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:35:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-04-13 17:35:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2025-04-13 17:35:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.8221709006928406) internal successors, (1222), 433 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:35:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1222 transitions. [2025-04-13 17:35:59,870 INFO L79 Accepts]: Start accepts. Automaton has 434 states and 1222 transitions. Word has length 32 [2025-04-13 17:35:59,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:59,870 INFO L485 AbstractCegarLoop]: Abstraction has 434 states and 1222 transitions. [2025-04-13 17:35:59,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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:35:59,870 INFO L278 IsEmpty]: Start isEmpty. Operand 434 states and 1222 transitions. [2025-04-13 17:35:59,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:35:59,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:59,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:59,877 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:36:00,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:00,071 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:36:00,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1637246005, now seen corresponding path program 89 times [2025-04-13 17:36:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:00,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606692326] [2025-04-13 17:36:00,072 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:00,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:00,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:00,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:36:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:36:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:00,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606692326] [2025-04-13 17:36:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606692326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:00,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764702481] [2025-04-13 17:36:00,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:00,439 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:36:00,440 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:36:00,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:00,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:00,656 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:36:00,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:00,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 17:36:00,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:00,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 17:36:00,789 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 15 treesize of output 1 [2025-04-13 17:36:00,816 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:36:00,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 17:36:00,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:36:00,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:36:00,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:36:00,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:36:00,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:36:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:01,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:01,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,791 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2025-04-13 17:36:01,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 86 [2025-04-13 17:36:01,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2025-04-13 17:36:01,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,820 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 68 [2025-04-13 17:36:01,853 INFO L325 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-04-13 17:36:01,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 192 [2025-04-13 17:36:01,860 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:36:01,861 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:36:01,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 136 [2025-04-13 17:36:01,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,984 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2025-04-13 17:36:01,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 86 [2025-04-13 17:36:01,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:01,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2025-04-13 17:36:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 30 refuted. 5 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764702481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:02,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 46 [2025-04-13 17:36:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330914927] [2025-04-13 17:36:02,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:02,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 17:36:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 17:36:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1959, Unknown=27, NotChecked=0, Total=2162 [2025-04-13 17:36:02,278 INFO L87 Difference]: Start difference. First operand 434 states and 1222 transitions. Second operand has 47 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:04,467 INFO L93 Difference]: Finished difference Result 587 states and 1562 transitions. [2025-04-13 17:36:04,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:36:04,467 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:04,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:04,469 INFO L225 Difference]: With dead ends: 587 [2025-04-13 17:36:04,469 INFO L226 Difference]: Without dead ends: 579 [2025-04-13 17:36:04,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=408, Invalid=4249, Unknown=35, NotChecked=0, Total=4692 [2025-04-13 17:36:04,470 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 259 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:04,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 208 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:36:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-04-13 17:36:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 406. [2025-04-13 17:36:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8) internal successors, (1134), 405 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1134 transitions. [2025-04-13 17:36:04,771 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1134 transitions. Word has length 33 [2025-04-13 17:36:04,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:04,771 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1134 transitions. [2025-04-13 17:36:04,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:04,771 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1134 transitions. [2025-04-13 17:36:04,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:04,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:04,772 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:04,779 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:36:04,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:04,972 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:36:04,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 35882994, now seen corresponding path program 90 times [2025-04-13 17:36:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:04,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373983661] [2025-04-13 17:36:04,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:04,980 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:04,991 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:04,991 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:04,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:05,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373983661] [2025-04-13 17:36:05,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373983661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:05,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727873692] [2025-04-13 17:36:05,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:05,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:05,500 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:36:05,501 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:36:05,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:05,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:05,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:05,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:05,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 17:36:05,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:06,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:06,438 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:36:06,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:36:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727873692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:06,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 60 [2025-04-13 17:36:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881433306] [2025-04-13 17:36:06,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:06,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-13 17:36:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:06,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-13 17:36:06,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3270, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:36:06,984 INFO L87 Difference]: Start difference. First operand 406 states and 1134 transitions. Second operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:07,883 INFO L93 Difference]: Finished difference Result 427 states and 1168 transitions. [2025-04-13 17:36:07,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:36:07,883 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:07,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:07,885 INFO L225 Difference]: With dead ends: 427 [2025-04-13 17:36:07,885 INFO L226 Difference]: Without dead ends: 408 [2025-04-13 17:36:07,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=461, Invalid=4095, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:36:07,886 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:07,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 144 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:36:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-04-13 17:36:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-04-13 17:36:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.7936117936117935) internal successors, (1137), 407 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1137 transitions. [2025-04-13 17:36:08,196 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1137 transitions. Word has length 33 [2025-04-13 17:36:08,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:08,196 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1137 transitions. [2025-04-13 17:36:08,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:08,196 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1137 transitions. [2025-04-13 17:36:08,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:08,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:08,196 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:08,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-04-13 17:36:08,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:08,397 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:36:08,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1594308432, now seen corresponding path program 91 times [2025-04-13 17:36:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:08,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331303969] [2025-04-13 17:36:08,397 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:08,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:08,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:08,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:08,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:08,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331303969] [2025-04-13 17:36:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331303969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:08,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193650289] [2025-04-13 17:36:08,945 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:08,947 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:36:08,947 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:36:09,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:09,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:09,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:36:09,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:09,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:09,778 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:36:09,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:36:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:10,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193650289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:10,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:36:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156935192] [2025-04-13 17:36:10,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:10,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:36:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:10,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:36:10,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=3879, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:36:10,384 INFO L87 Difference]: Start difference. First operand 408 states and 1137 transitions. Second operand has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:11,412 INFO L93 Difference]: Finished difference Result 425 states and 1165 transitions. [2025-04-13 17:36:11,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:36:11,413 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:11,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:11,414 INFO L225 Difference]: With dead ends: 425 [2025-04-13 17:36:11,414 INFO L226 Difference]: Without dead ends: 410 [2025-04-13 17:36:11,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=565, Invalid=5287, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 17:36:11,415 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:11,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 125 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:36:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-13 17:36:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-04-13 17:36:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.7921760391198043) internal successors, (1142), 409 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1142 transitions. [2025-04-13 17:36:11,724 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1142 transitions. Word has length 33 [2025-04-13 17:36:11,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:11,724 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1142 transitions. [2025-04-13 17:36:11,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:11,724 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1142 transitions. [2025-04-13 17:36:11,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:11,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:11,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:11,731 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:36:11,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,SelfDestructingSolverStorable98 [2025-04-13 17:36:11,925 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:36:11,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1384501560, now seen corresponding path program 92 times [2025-04-13 17:36:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:11,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672388916] [2025-04-13 17:36:11,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:11,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:11,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:11,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:36:11,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:12,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672388916] [2025-04-13 17:36:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672388916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:12,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550760051] [2025-04-13 17:36:12,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:12,459 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:36:12,459 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:36:12,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:12,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:12,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:36:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:12,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 17:36:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:13,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:13,266 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:36:13,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 53 treesize of output 90 [2025-04-13 17:36:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550760051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:13,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 60 [2025-04-13 17:36:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57271415] [2025-04-13 17:36:13,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:13,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-13 17:36:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:13,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-13 17:36:13,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=3287, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:36:13,905 INFO L87 Difference]: Start difference. First operand 410 states and 1142 transitions. Second operand has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 60 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:14,800 INFO L93 Difference]: Finished difference Result 425 states and 1167 transitions. [2025-04-13 17:36:14,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:36:14,801 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 60 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:14,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:14,802 INFO L225 Difference]: With dead ends: 425 [2025-04-13 17:36:14,802 INFO L226 Difference]: Without dead ends: 412 [2025-04-13 17:36:14,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=4364, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 17:36:14,803 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:14,803 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 105 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:36:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-13 17:36:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-04-13 17:36:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.7907542579075426) internal successors, (1147), 411 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1147 transitions. [2025-04-13 17:36:15,110 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1147 transitions. Word has length 33 [2025-04-13 17:36:15,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:15,110 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1147 transitions. [2025-04-13 17:36:15,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 60 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:15,110 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1147 transitions. [2025-04-13 17:36:15,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:15,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:15,111 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:15,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-04-13 17:36:15,311 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,SelfDestructingSolverStorable99 [2025-04-13 17:36:15,311 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:36:15,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -510760880, now seen corresponding path program 93 times [2025-04-13 17:36:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:15,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661245552] [2025-04-13 17:36:15,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:36:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:15,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:15,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:36:15,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:36:15,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:15,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:15,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661245552] [2025-04-13 17:36:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661245552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:15,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452214379] [2025-04-13 17:36:15,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:36:15,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:15,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:15,575 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:36:15,575 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:36:15,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:15,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:36:15,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:36:15,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:15,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:36:15,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:15,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:15,989 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:36:15,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:36:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452214379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:16,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 25 [2025-04-13 17:36:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612990839] [2025-04-13 17:36:16,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:16,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:36:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:16,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:36:16,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:36:16,071 INFO L87 Difference]: Start difference. First operand 412 states and 1147 transitions. Second operand has 26 states, 26 states have (on average 2.0) 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:36:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:16,960 INFO L93 Difference]: Finished difference Result 471 states and 1264 transitions. [2025-04-13 17:36:16,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:36:16,961 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) 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 33 [2025-04-13 17:36:16,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:16,963 INFO L225 Difference]: With dead ends: 471 [2025-04-13 17:36:16,963 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 17:36:16,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:36:16,963 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:16,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 111 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:36:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 17:36:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 412. [2025-04-13 17:36:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.776155717761557) internal successors, (1141), 411 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1141 transitions. [2025-04-13 17:36:17,265 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1141 transitions. Word has length 33 [2025-04-13 17:36:17,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:17,265 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1141 transitions. [2025-04-13 17:36:17,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) 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:36:17,265 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1141 transitions. [2025-04-13 17:36:17,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:17,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:17,265 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:17,272 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:36:17,466 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,SelfDestructingSolverStorable100 [2025-04-13 17:36:17,466 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:36:17,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 235204586, now seen corresponding path program 94 times [2025-04-13 17:36:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:17,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994508414] [2025-04-13 17:36:17,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:36:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:17,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:17,479 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:17,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:36:17,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:17,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994508414] [2025-04-13 17:36:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994508414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:17,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203106171] [2025-04-13 17:36:17,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:36:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:17,674 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:36:17,675 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:36:17,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:17,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:17,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:36:17,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:17,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:36:17,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:18,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:18,083 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:36:18,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:36:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203106171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:18,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 25 [2025-04-13 17:36:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303674103] [2025-04-13 17:36:18,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:18,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:36:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:18,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:36:18,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:36:18,176 INFO L87 Difference]: Start difference. First operand 412 states and 1141 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 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:36:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:19,116 INFO L93 Difference]: Finished difference Result 490 states and 1322 transitions. [2025-04-13 17:36:19,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:36:19,116 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 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 33 [2025-04-13 17:36:19,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:19,118 INFO L225 Difference]: With dead ends: 490 [2025-04-13 17:36:19,118 INFO L226 Difference]: Without dead ends: 483 [2025-04-13 17:36:19,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:36:19,118 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:19,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 97 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:36:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-04-13 17:36:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 406. [2025-04-13 17:36:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.780246913580247) internal successors, (1126), 405 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1126 transitions. [2025-04-13 17:36:19,421 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1126 transitions. Word has length 33 [2025-04-13 17:36:19,422 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:19,422 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1126 transitions. [2025-04-13 17:36:19,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 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:36:19,422 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1126 transitions. [2025-04-13 17:36:19,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:19,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:19,422 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:19,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2025-04-13 17:36:19,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:19,623 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:36:19,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1102839473, now seen corresponding path program 95 times [2025-04-13 17:36:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:19,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058319466] [2025-04-13 17:36:19,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:19,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:19,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:19,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:36:19,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:36:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:19,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058319466] [2025-04-13 17:36:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058319466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:19,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448521533] [2025-04-13 17:36:19,997 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:19,999 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:36:20,009 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:36:20,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:20,206 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:20,206 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:36:20,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:20,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:36:20,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:36:20,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:20,642 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:36:20,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:36:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448521533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:20,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 8] total 38 [2025-04-13 17:36:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642789344] [2025-04-13 17:36:20,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:20,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:36:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:20,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:36:20,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:36:20,777 INFO L87 Difference]: Start difference. First operand 406 states and 1126 transitions. Second operand has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:22,537 INFO L93 Difference]: Finished difference Result 490 states and 1278 transitions. [2025-04-13 17:36:22,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:36:22,537 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:22,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:22,539 INFO L225 Difference]: With dead ends: 490 [2025-04-13 17:36:22,539 INFO L226 Difference]: Without dead ends: 460 [2025-04-13 17:36:22,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=4002, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:36:22,539 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 106 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:22,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 171 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:36:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-04-13 17:36:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 412. [2025-04-13 17:36:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.7372262773722627) internal successors, (1125), 411 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1125 transitions. [2025-04-13 17:36:22,852 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1125 transitions. Word has length 33 [2025-04-13 17:36:22,852 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:22,852 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1125 transitions. [2025-04-13 17:36:22,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:22,852 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1125 transitions. [2025-04-13 17:36:22,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:22,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:22,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:22,860 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:36:23,053 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,SelfDestructingSolverStorable102 [2025-04-13 17:36:23,053 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:36:23,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 670320847, now seen corresponding path program 96 times [2025-04-13 17:36:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:23,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036205585] [2025-04-13 17:36:23,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:23,061 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:23,072 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:23,072 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:23,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:36:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:23,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036205585] [2025-04-13 17:36:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036205585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:23,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608211959] [2025-04-13 17:36:23,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:23,419 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:36:23,420 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:36:23,588 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:23,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:23,613 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:23,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:23,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 17:36:23,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:24,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:24,263 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:36:24,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:36:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608211959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:24,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 22] total 61 [2025-04-13 17:36:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772291462] [2025-04-13 17:36:24,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:24,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-13 17:36:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:24,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-13 17:36:24,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3435, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:36:24,872 INFO L87 Difference]: Start difference. First operand 412 states and 1125 transitions. Second operand has 62 states, 62 states have (on average 1.403225806451613) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:26,148 INFO L93 Difference]: Finished difference Result 486 states and 1318 transitions. [2025-04-13 17:36:26,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:36:26,148 INFO L79 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.403225806451613) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:26,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:26,149 INFO L225 Difference]: With dead ends: 486 [2025-04-13 17:36:26,149 INFO L226 Difference]: Without dead ends: 476 [2025-04-13 17:36:26,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=559, Invalid=5603, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 17:36:26,150 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:26,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 142 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:36:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-04-13 17:36:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 422. [2025-04-13 17:36:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.7315914489311166) internal successors, (1150), 421 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1150 transitions. [2025-04-13 17:36:26,461 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1150 transitions. Word has length 33 [2025-04-13 17:36:26,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:26,462 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1150 transitions. [2025-04-13 17:36:26,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.403225806451613) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:26,462 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1150 transitions. [2025-04-13 17:36:26,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:26,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:26,462 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:26,469 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:36:26,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 17:36:26,663 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:36:26,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 584433394, now seen corresponding path program 97 times [2025-04-13 17:36:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:26,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390750795] [2025-04-13 17:36:26,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:26,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:26,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:26,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:26,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:27,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390750795] [2025-04-13 17:36:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390750795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:27,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073782623] [2025-04-13 17:36:27,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:27,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:27,222 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:36:27,222 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:36:27,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:27,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:27,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:27,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:36:27,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:27,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:27,970 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:36:27,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:36:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073782623] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:28,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:36:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049112364] [2025-04-13 17:36:28,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:28,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:36:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:28,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:36:28,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=3862, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:36:28,645 INFO L87 Difference]: Start difference. First operand 422 states and 1150 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:29,989 INFO L93 Difference]: Finished difference Result 487 states and 1309 transitions. [2025-04-13 17:36:29,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:36:29,989 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:29,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:29,991 INFO L225 Difference]: With dead ends: 487 [2025-04-13 17:36:29,991 INFO L226 Difference]: Without dead ends: 477 [2025-04-13 17:36:29,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=5559, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 17:36:29,992 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:29,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 136 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:36:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-13 17:36:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 422. [2025-04-13 17:36:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.7315914489311166) internal successors, (1150), 421 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1150 transitions. [2025-04-13 17:36:30,307 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1150 transitions. Word has length 33 [2025-04-13 17:36:30,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:30,307 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1150 transitions. [2025-04-13 17:36:30,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:30,308 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1150 transitions. [2025-04-13 17:36:30,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:30,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:30,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:30,315 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:36:30,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:30,508 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:36:30,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2047601456, now seen corresponding path program 98 times [2025-04-13 17:36:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:30,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736321435] [2025-04-13 17:36:30,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:30,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:30,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:30,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:36:30,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:31,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736321435] [2025-04-13 17:36:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736321435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:31,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666930421] [2025-04-13 17:36:31,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:31,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:31,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:31,036 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:36:31,036 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:36:31,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:31,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:31,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:36:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:31,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 17:36:31,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:31,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:31,875 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:36:31,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:36:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666930421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:32,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 61 [2025-04-13 17:36:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902249012] [2025-04-13 17:36:32,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:32,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-13 17:36:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-13 17:36:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=3398, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:36:32,489 INFO L87 Difference]: Start difference. First operand 422 states and 1150 transitions. Second operand has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:33,955 INFO L93 Difference]: Finished difference Result 501 states and 1340 transitions. [2025-04-13 17:36:33,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:36:33,955 INFO L79 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:33,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:33,957 INFO L225 Difference]: With dead ends: 501 [2025-04-13 17:36:33,957 INFO L226 Difference]: Without dead ends: 494 [2025-04-13 17:36:33,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=557, Invalid=4993, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 17:36:33,958 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:33,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:36:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-04-13 17:36:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 422. [2025-04-13 17:36:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.7315914489311166) internal successors, (1150), 421 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1150 transitions. [2025-04-13 17:36:34,270 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1150 transitions. Word has length 33 [2025-04-13 17:36:34,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:34,270 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1150 transitions. [2025-04-13 17:36:34,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:34,270 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1150 transitions. [2025-04-13 17:36:34,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:34,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:34,271 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:34,278 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:36:34,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:34,471 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:36:34,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -577294325, now seen corresponding path program 99 times [2025-04-13 17:36:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:34,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133745644] [2025-04-13 17:36:34,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:36:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:34,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:34,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:36:34,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:36:34,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:34,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:34,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133745644] [2025-04-13 17:36:34,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133745644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:34,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364125636] [2025-04-13 17:36:34,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:36:34,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:34,726 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:36:34,726 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:36:34,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:34,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:36:34,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:36:34,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:34,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:36:34,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:35,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:35,213 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:36:35,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 53 treesize of output 75 [2025-04-13 17:36:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364125636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:35,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 28 [2025-04-13 17:36:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296754448] [2025-04-13 17:36:35,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:35,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:36:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:36:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:36:35,303 INFO L87 Difference]: Start difference. First operand 422 states and 1150 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:36,923 INFO L93 Difference]: Finished difference Result 576 states and 1457 transitions. [2025-04-13 17:36:36,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:36:36,924 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:36,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:36,925 INFO L225 Difference]: With dead ends: 576 [2025-04-13 17:36:36,925 INFO L226 Difference]: Without dead ends: 531 [2025-04-13 17:36:36,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=2229, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 17:36:36,926 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 140 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:36,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:36:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-04-13 17:36:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 406. [2025-04-13 17:36:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.7012345679012344) internal successors, (1094), 405 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1094 transitions. [2025-04-13 17:36:37,245 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1094 transitions. Word has length 33 [2025-04-13 17:36:37,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:37,245 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1094 transitions. [2025-04-13 17:36:37,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:37,245 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1094 transitions. [2025-04-13 17:36:37,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:37,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:37,246 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:37,252 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:36:37,446 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,SelfDestructingSolverStorable106 [2025-04-13 17:36:37,446 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:36:37,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1388487993, now seen corresponding path program 100 times [2025-04-13 17:36:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:37,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973804361] [2025-04-13 17:36:37,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:36:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:37,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:37,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:37,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:36:37,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:36:37,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:37,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973804361] [2025-04-13 17:36:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973804361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:37,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075059889] [2025-04-13 17:36:37,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:36:37,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:37,643 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:36:37,644 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:36:37,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:37,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:37,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:36:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:36:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:36:38,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:38,111 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:36:38,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:36:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:36:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075059889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:38,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 7] total 27 [2025-04-13 17:36:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819311401] [2025-04-13 17:36:38,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:38,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:36:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:38,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:36:38,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:36:38,189 INFO L87 Difference]: Start difference. First operand 406 states and 1094 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 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:36:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:39,082 INFO L93 Difference]: Finished difference Result 525 states and 1366 transitions. [2025-04-13 17:36:39,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:36:39,083 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 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 33 [2025-04-13 17:36:39,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:39,084 INFO L225 Difference]: With dead ends: 525 [2025-04-13 17:36:39,084 INFO L226 Difference]: Without dead ends: 513 [2025-04-13 17:36:39,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:36:39,085 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:39,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 63 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:36:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-04-13 17:36:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2025-04-13 17:36:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.7012345679012344) internal successors, (1094), 405 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1094 transitions. [2025-04-13 17:36:39,400 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1094 transitions. Word has length 33 [2025-04-13 17:36:39,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:39,400 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1094 transitions. [2025-04-13 17:36:39,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 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:36:39,400 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1094 transitions. [2025-04-13 17:36:39,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:39,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:39,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:39,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2025-04-13 17:36:39,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:39,601 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:36:39,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1474375446, now seen corresponding path program 101 times [2025-04-13 17:36:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:39,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147331279] [2025-04-13 17:36:39,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:39,609 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:36:39,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:39,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:36:39,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:36:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:39,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147331279] [2025-04-13 17:36:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147331279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:39,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117050930] [2025-04-13 17:36:39,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:39,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:39,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:39,975 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:36:39,975 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:36:40,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:36:40,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:40,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:36:40,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:40,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:36:40,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:36:40,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:40,582 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:36:40,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:36:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:36:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117050930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:40,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 7] total 36 [2025-04-13 17:36:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167466251] [2025-04-13 17:36:40,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:40,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:36:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:40,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:36:40,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:36:40,704 INFO L87 Difference]: Start difference. First operand 406 states and 1094 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:42,259 INFO L93 Difference]: Finished difference Result 557 states and 1453 transitions. [2025-04-13 17:36:42,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:36:42,260 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:42,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:42,261 INFO L225 Difference]: With dead ends: 557 [2025-04-13 17:36:42,262 INFO L226 Difference]: Without dead ends: 544 [2025-04-13 17:36:42,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=3491, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:36:42,262 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 105 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:42,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 100 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:36:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-04-13 17:36:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 404. [2025-04-13 17:36:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.7022332506203472) internal successors, (1089), 403 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1089 transitions. [2025-04-13 17:36:42,586 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 1089 transitions. Word has length 33 [2025-04-13 17:36:42,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:42,586 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 1089 transitions. [2025-04-13 17:36:42,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:42,586 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 1089 transitions. [2025-04-13 17:36:42,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:42,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:42,586 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:42,594 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:36:42,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:42,787 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:36:42,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 188557000, now seen corresponding path program 102 times [2025-04-13 17:36:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:42,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27943933] [2025-04-13 17:36:42,787 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:42,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:42,805 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:42,805 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:42,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:43,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27943933] [2025-04-13 17:36:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27943933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:43,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730591131] [2025-04-13 17:36:43,306 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:43,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:43,308 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:36:43,309 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:36:43,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:36:43,587 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:43,587 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:36:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:43,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 17:36:43,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:43,894 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:36:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:44,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:45,058 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:45,058 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:36:45,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:36:45,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:36:45,087 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:45,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 85 treesize of output 88 [2025-04-13 17:36:45,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:36:45,109 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:36:45,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:36:45,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:36:45,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:36:45,161 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:36:45,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:36:45,200 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:36:45,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:36:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:45,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730591131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:45,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:45,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-04-13 17:36:45,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956335423] [2025-04-13 17:36:45,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:45,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 17:36:45,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:45,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 17:36:45,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=3987, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:36:45,813 INFO L87 Difference]: Start difference. First operand 404 states and 1089 transitions. Second operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:54,025 INFO L93 Difference]: Finished difference Result 1207 states and 3101 transitions. [2025-04-13 17:36:54,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 17:36:54,025 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:54,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:54,028 INFO L225 Difference]: With dead ends: 1207 [2025-04-13 17:36:54,028 INFO L226 Difference]: Without dead ends: 1120 [2025-04-13 17:36:54,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4983 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1995, Invalid=18027, Unknown=0, NotChecked=0, Total=20022 [2025-04-13 17:36:54,029 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 410 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 3011 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:54,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 183 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3011 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 17:36:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-04-13 17:36:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 620. [2025-04-13 17:36:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.756058158319871) internal successors, (1706), 619 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1706 transitions. [2025-04-13 17:36:54,479 INFO L79 Accepts]: Start accepts. Automaton has 620 states and 1706 transitions. Word has length 33 [2025-04-13 17:36:54,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:54,479 INFO L485 AbstractCegarLoop]: Abstraction has 620 states and 1706 transitions. [2025-04-13 17:36:54,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:54,479 INFO L278 IsEmpty]: Start isEmpty. Operand 620 states and 1706 transitions. [2025-04-13 17:36:54,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:54,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:54,480 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:54,487 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:36:54,680 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,SelfDestructingSolverStorable109 [2025-04-13 17:36:54,680 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:36:54,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 199855274, now seen corresponding path program 103 times [2025-04-13 17:36:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:54,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021344898] [2025-04-13 17:36:54,681 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:54,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:54,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:54,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:54,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:55,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021344898] [2025-04-13 17:36:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021344898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:36:55,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974959093] [2025-04-13 17:36:55,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:36:55,259 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:36:55,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 17:36:55,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:36:55,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:55,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:55,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:36:55,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:36:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:55,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:36:56,145 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:36:56,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:36:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:36:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974959093] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:36:56,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:36:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:36:56,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495217652] [2025-04-13 17:36:56,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:36:56,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:36:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:56,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:36:56,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=3876, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:36:56,827 INFO L87 Difference]: Start difference. First operand 620 states and 1706 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:58,876 INFO L93 Difference]: Finished difference Result 765 states and 2066 transitions. [2025-04-13 17:36:58,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:36:58,877 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:36:58,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:58,879 INFO L225 Difference]: With dead ends: 765 [2025-04-13 17:36:58,879 INFO L226 Difference]: Without dead ends: 758 [2025-04-13 17:36:58,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=625, Invalid=6181, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:36:58,880 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 112 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:58,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 136 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:36:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-04-13 17:36:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 622. [2025-04-13 17:36:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.7294685990338166) internal successors, (1695), 621 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1695 transitions. [2025-04-13 17:36:59,346 INFO L79 Accepts]: Start accepts. Automaton has 622 states and 1695 transitions. Word has length 33 [2025-04-13 17:36:59,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:59,346 INFO L485 AbstractCegarLoop]: Abstraction has 622 states and 1695 transitions. [2025-04-13 17:36:59,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:36:59,346 INFO L278 IsEmpty]: Start isEmpty. Operand 622 states and 1695 transitions. [2025-04-13 17:36:59,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:36:59,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:59,346 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:59,353 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:36:59,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:36:59,547 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:36:59,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1990330646, now seen corresponding path program 104 times [2025-04-13 17:36:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:59,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824457730] [2025-04-13 17:36:59,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:59,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:36:59,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:36:59,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:36:59,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:00,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824457730] [2025-04-13 17:37:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824457730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:00,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342139291] [2025-04-13 17:37:00,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:37:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:00,089 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:37:00,089 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:37:00,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:37:00,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:00,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:37:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:00,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 17:37:00,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:00,578 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 15 treesize of output 1 [2025-04-13 17:37:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:00,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:01,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:01,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:37:01,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:37:01,532 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:37:01,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:37:01,540 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:01,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:37:01,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:37:01,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:37:01,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:01,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:37:01,580 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:37:01,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:37:01,634 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:37:01,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 190 [2025-04-13 17:37:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342139291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:02,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 63 [2025-04-13 17:37:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728146014] [2025-04-13 17:37:02,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:02,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 17:37:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:02,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 17:37:02,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=3656, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:37:02,187 INFO L87 Difference]: Start difference. First operand 622 states and 1695 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:04,378 INFO L93 Difference]: Finished difference Result 776 states and 2090 transitions. [2025-04-13 17:37:04,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:37:04,379 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:04,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:04,381 INFO L225 Difference]: With dead ends: 776 [2025-04-13 17:37:04,381 INFO L226 Difference]: Without dead ends: 763 [2025-04-13 17:37:04,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=556, Invalid=5764, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 17:37:04,382 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 85 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:04,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 119 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:37:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-04-13 17:37:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 634. [2025-04-13 17:37:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 2.7251184834123223) internal successors, (1725), 633 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1725 transitions. [2025-04-13 17:37:04,846 INFO L79 Accepts]: Start accepts. Automaton has 634 states and 1725 transitions. Word has length 33 [2025-04-13 17:37:04,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:04,846 INFO L485 AbstractCegarLoop]: Abstraction has 634 states and 1725 transitions. [2025-04-13 17:37:04,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:04,846 INFO L278 IsEmpty]: Start isEmpty. Operand 634 states and 1725 transitions. [2025-04-13 17:37:04,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:04,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:04,847 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:04,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2025-04-13 17:37:05,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2025-04-13 17:37:05,047 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:37:05,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1979032372, now seen corresponding path program 105 times [2025-04-13 17:37:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:05,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201712487] [2025-04-13 17:37:05,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:37:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:05,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:05,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:05,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:37:05,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:06,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:06,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201712487] [2025-04-13 17:37:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201712487] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:06,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024064185] [2025-04-13 17:37:06,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:37:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:06,458 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:37:06,459 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:37:06,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:06,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:06,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:37:06,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:06,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 17:37:06,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:37:07,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:07,466 INFO L325 Elim1Store]: treesize reduction 30, result has 82.8 percent of original size [2025-04-13 17:37:07,467 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 73 treesize of output 166 [2025-04-13 17:37:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:37:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024064185] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:08,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 17] total 56 [2025-04-13 17:37:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276889343] [2025-04-13 17:37:08,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:08,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 17:37:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 17:37:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2963, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:37:08,013 INFO L87 Difference]: Start difference. First operand 634 states and 1725 transitions. Second operand has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:11,224 INFO L93 Difference]: Finished difference Result 965 states and 2568 transitions. [2025-04-13 17:37:11,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:37:11,225 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:11,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:11,227 INFO L225 Difference]: With dead ends: 965 [2025-04-13 17:37:11,227 INFO L226 Difference]: Without dead ends: 903 [2025-04-13 17:37:11,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=529, Invalid=6953, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 17:37:11,228 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 148 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:11,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 169 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:37:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-04-13 17:37:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 681. [2025-04-13 17:37:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 2.713235294117647) internal successors, (1845), 680 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1845 transitions. [2025-04-13 17:37:11,726 INFO L79 Accepts]: Start accepts. Automaton has 681 states and 1845 transitions. Word has length 33 [2025-04-13 17:37:11,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:11,726 INFO L485 AbstractCegarLoop]: Abstraction has 681 states and 1845 transitions. [2025-04-13 17:37:11,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:11,726 INFO L278 IsEmpty]: Start isEmpty. Operand 681 states and 1845 transitions. [2025-04-13 17:37:11,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:11,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:11,727 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:11,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2025-04-13 17:37:11,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:11,928 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:37:11,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1671876555, now seen corresponding path program 106 times [2025-04-13 17:37:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:11,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156704035] [2025-04-13 17:37:11,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:37:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:11,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:37:11,943 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:11,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:37:11,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:37:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:12,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156704035] [2025-04-13 17:37:12,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156704035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:12,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324766991] [2025-04-13 17:37:12,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:37:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:12,186 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:37:12,186 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:37:12,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:37:12,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:12,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:37:12,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:12,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:37:12,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:37:12,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:12,727 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:37:12,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:37:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:37:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324766991] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:12,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 8] total 28 [2025-04-13 17:37:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726227549] [2025-04-13 17:37:12,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:12,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:37:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:12,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:37:12,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:37:12,813 INFO L87 Difference]: Start difference. First operand 681 states and 1845 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 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:37:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:14,312 INFO L93 Difference]: Finished difference Result 839 states and 2272 transitions. [2025-04-13 17:37:14,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:37:14,312 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 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 33 [2025-04-13 17:37:14,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:14,314 INFO L225 Difference]: With dead ends: 839 [2025-04-13 17:37:14,314 INFO L226 Difference]: Without dead ends: 819 [2025-04-13 17:37:14,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:37:14,315 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:14,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 102 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:37:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-04-13 17:37:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 675. [2025-04-13 17:37:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 2.71513353115727) internal successors, (1830), 674 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1830 transitions. [2025-04-13 17:37:14,803 INFO L79 Accepts]: Start accepts. Automaton has 675 states and 1830 transitions. Word has length 33 [2025-04-13 17:37:14,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:14,803 INFO L485 AbstractCegarLoop]: Abstraction has 675 states and 1830 transitions. [2025-04-13 17:37:14,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 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:37:14,803 INFO L278 IsEmpty]: Start isEmpty. Operand 675 states and 1830 transitions. [2025-04-13 17:37:14,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:14,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:14,804 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:14,810 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:37:15,004 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,SelfDestructingSolverStorable113 [2025-04-13 17:37:15,004 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:37:15,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 821501712, now seen corresponding path program 107 times [2025-04-13 17:37:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:15,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522202265] [2025-04-13 17:37:15,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:37:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:15,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:37:15,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:15,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:37:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:15,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522202265] [2025-04-13 17:37:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522202265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:15,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925883677] [2025-04-13 17:37:15,553 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:37:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:15,555 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:37:15,555 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:37:15,745 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:37:15,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:15,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:37:15,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:16,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 17:37:16,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:37:16,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:16,425 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:37:16,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:37:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:37:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925883677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:16,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 7] total 41 [2025-04-13 17:37:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072047279] [2025-04-13 17:37:16,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:16,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:37:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:37:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:37:16,545 INFO L87 Difference]: Start difference. First operand 675 states and 1830 transitions. Second operand has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:18,850 INFO L93 Difference]: Finished difference Result 870 states and 2348 transitions. [2025-04-13 17:37:18,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 17:37:18,850 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:18,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:18,853 INFO L225 Difference]: With dead ends: 870 [2025-04-13 17:37:18,853 INFO L226 Difference]: Without dead ends: 845 [2025-04-13 17:37:18,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=395, Invalid=5007, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 17:37:18,853 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 115 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:18,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 91 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:37:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-04-13 17:37:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 667. [2025-04-13 17:37:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 2.7027027027027026) internal successors, (1800), 666 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1800 transitions. [2025-04-13 17:37:19,346 INFO L79 Accepts]: Start accepts. Automaton has 667 states and 1800 transitions. Word has length 33 [2025-04-13 17:37:19,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:19,346 INFO L485 AbstractCegarLoop]: Abstraction has 667 states and 1800 transitions. [2025-04-13 17:37:19,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:19,346 INFO L278 IsEmpty]: Start isEmpty. Operand 667 states and 1800 transitions. [2025-04-13 17:37:19,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:19,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:19,347 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:19,355 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:37:19,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 17:37:19,547 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:37:19,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 832799986, now seen corresponding path program 108 times [2025-04-13 17:37:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:19,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31771018] [2025-04-13 17:37:19,548 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:37:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:19,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:19,568 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:19,568 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:37:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:37:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:20,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31771018] [2025-04-13 17:37:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31771018] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:20,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390351654] [2025-04-13 17:37:20,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:37:20,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:20,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:20,139 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:37:20,140 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:37:20,332 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:20,487 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:20,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:37:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:20,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 17:37:20,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:20,790 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:37:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:21,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:21,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:21,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 168 treesize of output 164 [2025-04-13 17:37:21,832 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:37:21,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:37:21,865 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:37:21,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:37:22,016 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 17:37:22,021 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:22,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:37:22,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:37:22,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:37:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390351654] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:22,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 23] total 63 [2025-04-13 17:37:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18153684] [2025-04-13 17:37:22,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:22,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 17:37:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:22,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 17:37:22,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3598, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:37:22,501 INFO L87 Difference]: Start difference. First operand 667 states and 1800 transitions. Second operand has 64 states, 64 states have (on average 1.4375) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:42,667 INFO L93 Difference]: Finished difference Result 2802 states and 7284 transitions. [2025-04-13 17:37:42,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2025-04-13 17:37:42,668 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.4375) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:42,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:42,673 INFO L225 Difference]: With dead ends: 2802 [2025-04-13 17:37:42,673 INFO L226 Difference]: Without dead ends: 2741 [2025-04-13 17:37:42,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15944 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=5481, Invalid=43581, Unknown=0, NotChecked=0, Total=49062 [2025-04-13 17:37:42,675 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 1038 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:42,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 199 Invalid, 6065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 5577 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:37:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-04-13 17:37:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1075. [2025-04-13 17:37:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 2.972998137802607) internal successors, (3193), 1074 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 3193 transitions. [2025-04-13 17:37:43,468 INFO L79 Accepts]: Start accepts. Automaton has 1075 states and 3193 transitions. Word has length 33 [2025-04-13 17:37:43,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:43,468 INFO L485 AbstractCegarLoop]: Abstraction has 1075 states and 3193 transitions. [2025-04-13 17:37:43,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.4375) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:43,469 INFO L278 IsEmpty]: Start isEmpty. Operand 1075 states and 3193 transitions. [2025-04-13 17:37:43,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:43,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:43,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:43,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 17:37:43,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 17:37:43,670 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:37:43,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1348976851, now seen corresponding path program 109 times [2025-04-13 17:37:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:43,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212452038] [2025-04-13 17:37:43,671 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:37:43,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:37:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:37:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:44,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212452038] [2025-04-13 17:37:44,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212452038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:44,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903930784] [2025-04-13 17:37:44,235 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:37:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:44,237 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:37:44,238 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:37:44,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:37:44,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:44,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:37:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:44,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:37:44,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:44,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:45,064 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:37:45,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:37:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903930784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:45,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:37:45,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382225370] [2025-04-13 17:37:45,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:45,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:37:45,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:45,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:37:45,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=3864, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:37:45,716 INFO L87 Difference]: Start difference. First operand 1075 states and 3193 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:48,105 INFO L93 Difference]: Finished difference Result 1197 states and 3506 transitions. [2025-04-13 17:37:48,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:37:48,106 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:48,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:48,109 INFO L225 Difference]: With dead ends: 1197 [2025-04-13 17:37:48,109 INFO L226 Difference]: Without dead ends: 1185 [2025-04-13 17:37:48,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=629, Invalid=6177, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:37:48,110 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:48,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:37:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-04-13 17:37:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1085. [2025-04-13 17:37:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 2.9686346863468636) internal successors, (3218), 1084 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 3218 transitions. [2025-04-13 17:37:48,913 INFO L79 Accepts]: Start accepts. Automaton has 1085 states and 3218 transitions. Word has length 33 [2025-04-13 17:37:48,913 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:48,913 INFO L485 AbstractCegarLoop]: Abstraction has 1085 states and 3218 transitions. [2025-04-13 17:37:48,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:48,913 INFO L278 IsEmpty]: Start isEmpty. Operand 1085 states and 3218 transitions. [2025-04-13 17:37:48,914 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:48,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:48,914 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:48,921 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:37:49,115 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,SelfDestructingSolverStorable116 [2025-04-13 17:37:49,115 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:37:49,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1339146252, now seen corresponding path program 110 times [2025-04-13 17:37:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:49,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634219482] [2025-04-13 17:37:49,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:37:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:49,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:37:49,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:49,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:37:49,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634219482] [2025-04-13 17:37:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634219482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167037888] [2025-04-13 17:37:49,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:37:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:49,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:49,671 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:37:49,671 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:37:49,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:37:49,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:37:49,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:37:49,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:49,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 17:37:49,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:50,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:50,663 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:37:50,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:37:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:37:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167037888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:51,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 63 [2025-04-13 17:37:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411426552] [2025-04-13 17:37:51,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:51,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 17:37:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:51,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 17:37:51,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=3636, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:37:51,269 INFO L87 Difference]: Start difference. First operand 1085 states and 3218 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:54,369 INFO L93 Difference]: Finished difference Result 1350 states and 3934 transitions. [2025-04-13 17:37:54,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:37:54,369 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:37:54,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:54,372 INFO L225 Difference]: With dead ends: 1350 [2025-04-13 17:37:54,372 INFO L226 Difference]: Without dead ends: 1335 [2025-04-13 17:37:54,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=611, Invalid=6195, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:37:54,373 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:54,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 158 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:37:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-04-13 17:37:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1083. [2025-04-13 17:37:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 2.965804066543438) internal successors, (3209), 1082 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3209 transitions. [2025-04-13 17:37:55,168 INFO L79 Accepts]: Start accepts. Automaton has 1083 states and 3209 transitions. Word has length 33 [2025-04-13 17:37:55,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:55,168 INFO L485 AbstractCegarLoop]: Abstraction has 1083 states and 3209 transitions. [2025-04-13 17:37:55,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:55,168 INFO L278 IsEmpty]: Start isEmpty. Operand 1083 states and 3209 transitions. [2025-04-13 17:37:55,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:37:55,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:55,169 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:55,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2025-04-13 17:37:55,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:55,370 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:37:55,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1465263921, now seen corresponding path program 111 times [2025-04-13 17:37:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:55,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805675429] [2025-04-13 17:37:55,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:37:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:55,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:55,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:37:55,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:37:55,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:37:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:55,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805675429] [2025-04-13 17:37:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805675429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:37:55,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556124851] [2025-04-13 17:37:55,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:37:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:37:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:37:55,637 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:37:55,638 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:37:55,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:37:55,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 33 statements. [2025-04-13 17:37:55,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:37:55,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:55,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:37:55,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:37:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:37:56,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:56,197 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:37:56,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:37:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:37:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556124851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:56,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 17:37:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479819184] [2025-04-13 17:37:56,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:56,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:37:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:56,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:37:56,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:37:56,294 INFO L87 Difference]: Start difference. First operand 1083 states and 3209 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 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:37:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:59,412 INFO L93 Difference]: Finished difference Result 1337 states and 3762 transitions. [2025-04-13 17:37:59,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:37:59,412 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 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 33 [2025-04-13 17:37:59,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:59,415 INFO L225 Difference]: With dead ends: 1337 [2025-04-13 17:37:59,415 INFO L226 Difference]: Without dead ends: 1264 [2025-04-13 17:37:59,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=2928, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:37:59,416 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:59,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 128 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:37:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-04-13 17:38:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1077. [2025-04-13 17:38:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 2.867100371747212) internal successors, (3085), 1076 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 3085 transitions. [2025-04-13 17:38:00,240 INFO L79 Accepts]: Start accepts. Automaton has 1077 states and 3085 transitions. Word has length 33 [2025-04-13 17:38:00,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:00,240 INFO L485 AbstractCegarLoop]: Abstraction has 1077 states and 3085 transitions. [2025-04-13 17:38:00,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 30 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:38:00,240 INFO L278 IsEmpty]: Start isEmpty. Operand 1077 states and 3085 transitions. [2025-04-13 17:38:00,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:00,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:00,241 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:00,248 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:38:00,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:00,442 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:38:00,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash -787052593, now seen corresponding path program 112 times [2025-04-13 17:38:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:00,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027701650] [2025-04-13 17:38:00,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:38:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:00,450 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:00,455 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:00,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:38:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 17:38:00,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:00,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027701650] [2025-04-13 17:38:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027701650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:00,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137628358] [2025-04-13 17:38:00,639 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:38:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:00,641 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:38:00,641 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:38:00,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:00,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:00,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:38:00,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:00,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:38:00,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:38:01,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:01,067 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:38:01,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:38:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 17:38:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137628358] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:01,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 25 [2025-04-13 17:38:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869634953] [2025-04-13 17:38:01,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:01,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:38:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:38:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:38:01,156 INFO L87 Difference]: Start difference. First operand 1077 states and 3085 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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:38:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:03,125 INFO L93 Difference]: Finished difference Result 1212 states and 3383 transitions. [2025-04-13 17:38:03,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:38:03,125 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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 33 [2025-04-13 17:38:03,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:03,128 INFO L225 Difference]: With dead ends: 1212 [2025-04-13 17:38:03,128 INFO L226 Difference]: Without dead ends: 1197 [2025-04-13 17:38:03,129 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:38:03,129 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 70 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:03,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 97 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:38:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-04-13 17:38:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1073. [2025-04-13 17:38:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1072 states have (on average 2.855410447761194) internal successors, (3061), 1072 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 3061 transitions. [2025-04-13 17:38:03,967 INFO L79 Accepts]: Start accepts. Automaton has 1073 states and 3061 transitions. Word has length 33 [2025-04-13 17:38:03,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:03,967 INFO L485 AbstractCegarLoop]: Abstraction has 1073 states and 3061 transitions. [2025-04-13 17:38:03,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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:38:03,967 INFO L278 IsEmpty]: Start isEmpty. Operand 1073 states and 3061 transitions. [2025-04-13 17:38:03,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:03,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:03,968 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:03,976 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:38:04,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:04,169 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:38:04,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -872940046, now seen corresponding path program 113 times [2025-04-13 17:38:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:04,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944110421] [2025-04-13 17:38:04,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:38:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:04,177 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:38:04,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:04,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:38:04,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:04,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944110421] [2025-04-13 17:38:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944110421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:04,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459705582] [2025-04-13 17:38:04,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:38:04,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:04,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:04,537 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:38:04,538 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:38:04,737 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:38:04,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:04,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:38:04,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:04,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-13 17:38:04,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:04,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 17:38:04,929 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:38:04,955 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:38:04,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 17:38:04,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:38:05,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:38:05,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:38:05,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 17:38:05,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:38:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:05,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:05,993 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:38:05,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:38:06,022 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 17:38:06,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 17:38:06,075 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:38:06,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:38:07,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,418 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 77 [2025-04-13 17:38:07,424 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:38:07,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 109 [2025-04-13 17:38:07,467 INFO L325 Elim1Store]: treesize reduction 24, result has 77.1 percent of original size [2025-04-13 17:38:07,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 129 [2025-04-13 17:38:07,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2025-04-13 17:38:07,531 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:38:07,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 79 [2025-04-13 17:38:07,557 INFO L325 Elim1Store]: treesize reduction 16, result has 75.4 percent of original size [2025-04-13 17:38:07,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 82 [2025-04-13 17:38:07,594 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,594 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2025-04-13 17:38:07,598 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:38:07,598 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 67 [2025-04-13 17:38:07,622 INFO L325 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-04-13 17:38:07,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2025-04-13 17:38:07,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,647 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-13 17:38:07,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2025-04-13 17:38:07,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 17:38:07,666 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-04-13 17:38:07,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-04-13 17:38:07,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-04-13 17:38:07,691 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,692 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 71 [2025-04-13 17:38:07,698 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:38:07,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 100 [2025-04-13 17:38:07,725 INFO L325 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-04-13 17:38:07,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 89 [2025-04-13 17:38:07,759 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,759 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2025-04-13 17:38:07,764 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:38:07,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2025-04-13 17:38:07,788 INFO L325 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-04-13 17:38:07,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 74 [2025-04-13 17:38:07,815 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,815 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-13 17:38:07,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2025-04-13 17:38:07,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 17:38:07,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,832 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-04-13 17:38:07,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-04-13 17:38:07,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:38:07,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-04-13 17:38:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 45 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459705582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:12,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 23] total 59 [2025-04-13 17:38:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054375838] [2025-04-13 17:38:12,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:12,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-13 17:38:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:12,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-13 17:38:12,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3242, Unknown=19, NotChecked=0, Total=3540 [2025-04-13 17:38:12,814 INFO L87 Difference]: Start difference. First operand 1073 states and 3061 transitions. Second operand has 60 states, 60 states have (on average 1.45) internal successors, (87), 59 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:18,684 INFO L93 Difference]: Finished difference Result 1478 states and 4104 transitions. [2025-04-13 17:38:18,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:38:18,685 INFO L79 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.45) internal successors, (87), 59 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:38:18,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:18,688 INFO L225 Difference]: With dead ends: 1478 [2025-04-13 17:38:18,688 INFO L226 Difference]: Without dead ends: 1462 [2025-04-13 17:38:18,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=606, Invalid=7207, Unknown=19, NotChecked=0, Total=7832 [2025-04-13 17:38:18,689 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 218 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:18,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 233 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 17:38:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-04-13 17:38:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1119. [2025-04-13 17:38:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 2.881932021466905) internal successors, (3222), 1118 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3222 transitions. [2025-04-13 17:38:19,576 INFO L79 Accepts]: Start accepts. Automaton has 1119 states and 3222 transitions. Word has length 33 [2025-04-13 17:38:19,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:19,576 INFO L485 AbstractCegarLoop]: Abstraction has 1119 states and 3222 transitions. [2025-04-13 17:38:19,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.45) internal successors, (87), 59 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:19,576 INFO L278 IsEmpty]: Start isEmpty. Operand 1119 states and 3222 transitions. [2025-04-13 17:38:19,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:19,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:19,577 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:19,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 17:38:19,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:19,778 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:38:19,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 789992400, now seen corresponding path program 114 times [2025-04-13 17:38:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:19,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294891171] [2025-04-13 17:38:19,778 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:38:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:19,786 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:38:19,797 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:19,798 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:38:19,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:20,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:20,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294891171] [2025-04-13 17:38:20,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294891171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:20,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015279389] [2025-04-13 17:38:20,368 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:38:20,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:20,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:20,370 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:38:20,371 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:38:20,578 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:38:20,612 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:20,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:38:20,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:20,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:38:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:21,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:21,341 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:38:21,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:38:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015279389] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:21,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:21,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 50 [2025-04-13 17:38:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589896072] [2025-04-13 17:38:21,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:21,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 17:38:21,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:21,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 17:38:21,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2371, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:38:21,850 INFO L87 Difference]: Start difference. First operand 1119 states and 3222 transitions. Second operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:25,449 INFO L93 Difference]: Finished difference Result 1382 states and 3906 transitions. [2025-04-13 17:38:25,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 17:38:25,450 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:38:25,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:25,453 INFO L225 Difference]: With dead ends: 1382 [2025-04-13 17:38:25,453 INFO L226 Difference]: Without dead ends: 1304 [2025-04-13 17:38:25,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=5283, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:38:25,454 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 156 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:25,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 169 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:38:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-04-13 17:38:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1121. [2025-04-13 17:38:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 2.883035714285714) internal successors, (3229), 1120 states have internal predecessors, (3229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 3229 transitions. [2025-04-13 17:38:26,348 INFO L79 Accepts]: Start accepts. Automaton has 1121 states and 3229 transitions. Word has length 33 [2025-04-13 17:38:26,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:26,348 INFO L485 AbstractCegarLoop]: Abstraction has 1121 states and 3229 transitions. [2025-04-13 17:38:26,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:26,349 INFO L278 IsEmpty]: Start isEmpty. Operand 1121 states and 3229 transitions. [2025-04-13 17:38:26,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:26,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:26,350 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:26,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2025-04-13 17:38:26,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:26,550 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:38:26,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 801290674, now seen corresponding path program 115 times [2025-04-13 17:38:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:26,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800863997] [2025-04-13 17:38:26,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:38:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:26,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:38:26,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:26,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:26,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:27,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800863997] [2025-04-13 17:38:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800863997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:27,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251092889] [2025-04-13 17:38:27,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:38:27,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:27,230 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:38:27,231 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:38:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:38:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:38:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:28,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:28,273 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:38:28,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 53 treesize of output 90 [2025-04-13 17:38:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251092889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:29,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:38:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102140720] [2025-04-13 17:38:29,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:29,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:38:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:29,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:38:29,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3877, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:38:29,049 INFO L87 Difference]: Start difference. First operand 1121 states and 3229 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:32,841 INFO L93 Difference]: Finished difference Result 1330 states and 3725 transitions. [2025-04-13 17:38:32,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:38:32,841 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:38:32,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:32,844 INFO L225 Difference]: With dead ends: 1330 [2025-04-13 17:38:32,844 INFO L226 Difference]: Without dead ends: 1306 [2025-04-13 17:38:32,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=670, Invalid=6640, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:38:32,845 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:32,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 170 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:38:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-04-13 17:38:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1099. [2025-04-13 17:38:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1098 states have (on average 2.859744990892532) internal successors, (3140), 1098 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 3140 transitions. [2025-04-13 17:38:33,726 INFO L79 Accepts]: Start accepts. Automaton has 1099 states and 3140 transitions. Word has length 33 [2025-04-13 17:38:33,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:33,726 INFO L485 AbstractCegarLoop]: Abstraction has 1099 states and 3140 transitions. [2025-04-13 17:38:33,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:33,726 INFO L278 IsEmpty]: Start isEmpty. Operand 1099 states and 3140 transitions. [2025-04-13 17:38:33,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:33,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:33,727 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:33,734 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:38:33,927 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,SelfDestructingSolverStorable122 [2025-04-13 17:38:33,928 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:38:33,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1151537168, now seen corresponding path program 116 times [2025-04-13 17:38:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:33,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151894343] [2025-04-13 17:38:33,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:33,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:33,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:33,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:33,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:34,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151894343] [2025-04-13 17:38:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151894343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:34,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411881128] [2025-04-13 17:38:34,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:34,672 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:38:34,672 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:38:34,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:34,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:34,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:34,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:34,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 17:38:34,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:35,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:36,084 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:38:36,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:38:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411881128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:36,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 66 [2025-04-13 17:38:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763059885] [2025-04-13 17:38:36,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:36,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 17:38:36,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:36,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 17:38:36,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4038, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:38:36,944 INFO L87 Difference]: Start difference. First operand 1099 states and 3140 transitions. Second operand has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:41,690 INFO L93 Difference]: Finished difference Result 1311 states and 3644 transitions. [2025-04-13 17:38:41,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:38:41,691 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:38:41,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:41,694 INFO L225 Difference]: With dead ends: 1311 [2025-04-13 17:38:41,694 INFO L226 Difference]: Without dead ends: 1304 [2025-04-13 17:38:41,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=716, Invalid=8596, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 17:38:41,694 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 176 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:41,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 220 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:38:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-04-13 17:38:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1081. [2025-04-13 17:38:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 2.849074074074074) internal successors, (3077), 1080 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3077 transitions. [2025-04-13 17:38:42,576 INFO L79 Accepts]: Start accepts. Automaton has 1081 states and 3077 transitions. Word has length 33 [2025-04-13 17:38:42,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:42,576 INFO L485 AbstractCegarLoop]: Abstraction has 1081 states and 3077 transitions. [2025-04-13 17:38:42,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:42,576 INFO L278 IsEmpty]: Start isEmpty. Operand 1081 states and 3077 transitions. [2025-04-13 17:38:42,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:42,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:42,577 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:42,584 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:38:42,777 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,SelfDestructingSolverStorable123 [2025-04-13 17:38:42,778 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:38:42,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1917873077, now seen corresponding path program 117 times [2025-04-13 17:38:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:42,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886926849] [2025-04-13 17:38:42,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:38:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:42,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:38:42,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:42,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:38:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:43,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:43,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886926849] [2025-04-13 17:38:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886926849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:43,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958646829] [2025-04-13 17:38:43,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:38:43,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:43,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:43,616 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:38:43,617 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:38:43,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:38:43,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:43,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:38:43,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:43,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 17:38:43,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:44,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:45,128 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:38:45,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:38:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:38:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958646829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:45,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 66 [2025-04-13 17:38:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305127030] [2025-04-13 17:38:45,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:45,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 17:38:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:45,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 17:38:45,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=4118, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:38:45,987 INFO L87 Difference]: Start difference. First operand 1081 states and 3077 transitions. Second operand has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:50,379 INFO L93 Difference]: Finished difference Result 1355 states and 3792 transitions. [2025-04-13 17:38:50,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:38:50,380 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:38:50,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:50,383 INFO L225 Difference]: With dead ends: 1355 [2025-04-13 17:38:50,383 INFO L226 Difference]: Without dead ends: 1319 [2025-04-13 17:38:50,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=834, Invalid=10508, Unknown=0, NotChecked=0, Total=11342 [2025-04-13 17:38:50,384 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 233 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:50,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 302 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:38:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-04-13 17:38:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1101. [2025-04-13 17:38:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1100 states have (on average 2.8427272727272728) internal successors, (3127), 1100 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 3127 transitions. [2025-04-13 17:38:51,282 INFO L79 Accepts]: Start accepts. Automaton has 1101 states and 3127 transitions. Word has length 33 [2025-04-13 17:38:51,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:51,282 INFO L485 AbstractCegarLoop]: Abstraction has 1101 states and 3127 transitions. [2025-04-13 17:38:51,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:51,283 INFO L278 IsEmpty]: Start isEmpty. Operand 1101 states and 3127 transitions. [2025-04-13 17:38:51,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:51,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:51,284 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:51,291 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:38:51,484 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,SelfDestructingSolverStorable124 [2025-04-13 17:38:51,484 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:38:51,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1016727405, now seen corresponding path program 118 times [2025-04-13 17:38:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:51,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348667885] [2025-04-13 17:38:51,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:38:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:51,492 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:51,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:51,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:38:51,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:51,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:51,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348667885] [2025-04-13 17:38:51,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348667885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:51,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548568676] [2025-04-13 17:38:51,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:38:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:51,948 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:38:51,948 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:38:52,155 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:38:52,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:52,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:38:52,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:52,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:38:52,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:38:52,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:52,641 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:38:52,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:38:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:38:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548568676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:52,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:52,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 37 [2025-04-13 17:38:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388091006] [2025-04-13 17:38:52,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:52,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:38:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:52,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:38:52,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:38:52,902 INFO L87 Difference]: Start difference. First operand 1101 states and 3127 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:38:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:56,576 INFO L93 Difference]: Finished difference Result 1385 states and 3894 transitions. [2025-04-13 17:38:56,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 17:38:56,576 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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) Word has length 33 [2025-04-13 17:38:56,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:56,579 INFO L225 Difference]: With dead ends: 1385 [2025-04-13 17:38:56,579 INFO L226 Difference]: Without dead ends: 1341 [2025-04-13 17:38:56,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=531, Invalid=5475, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 17:38:56,580 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 147 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:56,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 137 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:38:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-04-13 17:38:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1083. [2025-04-13 17:38:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 2.8354898336414047) internal successors, (3068), 1082 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3068 transitions. [2025-04-13 17:38:57,480 INFO L79 Accepts]: Start accepts. Automaton has 1083 states and 3068 transitions. Word has length 33 [2025-04-13 17:38:57,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:57,480 INFO L485 AbstractCegarLoop]: Abstraction has 1083 states and 3068 transitions. [2025-04-13 17:38:57,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:38:57,480 INFO L278 IsEmpty]: Start isEmpty. Operand 1083 states and 3068 transitions. [2025-04-13 17:38:57,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:38:57,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:57,482 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:57,488 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:38:57,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2025-04-13 17:38:57,682 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:38:57,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 829229162, now seen corresponding path program 119 times [2025-04-13 17:38:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:57,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124193559] [2025-04-13 17:38:57,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:38:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:57,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:38:57,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:57,700 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:38:57,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:38:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:58,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124193559] [2025-04-13 17:38:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124193559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:58,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313098811] [2025-04-13 17:38:58,089 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:38:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:58,091 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:38:58,091 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:38:58,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:38:58,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:38:58,355 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:38:58,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:58,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:38:58,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:38:58,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:58,800 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:38:58,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:38:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-13 17:38:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313098811] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:58,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 7] total 36 [2025-04-13 17:38:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563562067] [2025-04-13 17:38:58,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:58,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:38:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:58,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:38:58,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:38:58,959 INFO L87 Difference]: Start difference. First operand 1083 states and 3068 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:39:01,645 INFO L93 Difference]: Finished difference Result 1183 states and 3319 transitions. [2025-04-13 17:39:01,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:39:01,645 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:39:01,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:39:01,648 INFO L225 Difference]: With dead ends: 1183 [2025-04-13 17:39:01,648 INFO L226 Difference]: Without dead ends: 1170 [2025-04-13 17:39:01,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=3043, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:39:01,649 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 70 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:39:01,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 150 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:39:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-04-13 17:39:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1077. [2025-04-13 17:39:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 2.829925650557621) internal successors, (3045), 1076 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 3045 transitions. [2025-04-13 17:39:02,548 INFO L79 Accepts]: Start accepts. Automaton has 1077 states and 3045 transitions. Word has length 33 [2025-04-13 17:39:02,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:39:02,548 INFO L485 AbstractCegarLoop]: Abstraction has 1077 states and 3045 transitions. [2025-04-13 17:39:02,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:02,548 INFO L278 IsEmpty]: Start isEmpty. Operand 1077 states and 3045 transitions. [2025-04-13 17:39:02,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:39:02,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:39:02,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:39:02,557 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:39:02,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:02,750 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:39:02,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:39:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash -805072662, now seen corresponding path program 120 times [2025-04-13 17:39:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:39:02,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710919641] [2025-04-13 17:39:02,750 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:39:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:39:02,758 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:39:02,770 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:02,770 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:39:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:39:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710919641] [2025-04-13 17:39:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710919641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:39:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047829626] [2025-04-13 17:39:03,530 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:39:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:03,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:39:03,532 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:39:03,533 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:39:03,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:39:03,837 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:03,837 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:39:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:03,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:39:03,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:04,241 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:39:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:04,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:05,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:39:05,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:39:05,602 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:39:05,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:39:05,651 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:39:05,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:39:05,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:39:05,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:39:05,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:39:05,906 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:39:05,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:39:05,911 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 17:39:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 15 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047829626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:39:06,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:39:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-04-13 17:39:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978515896] [2025-04-13 17:39:06,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:39:06,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 17:39:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:39:06,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 17:39:06,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=4100, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:39:06,514 INFO L87 Difference]: Start difference. First operand 1077 states and 3045 transitions. Second operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:39:39,215 INFO L93 Difference]: Finished difference Result 4528 states and 11941 transitions. [2025-04-13 17:39:39,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2025-04-13 17:39:39,215 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:39:39,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:39:39,223 INFO L225 Difference]: With dead ends: 4528 [2025-04-13 17:39:39,223 INFO L226 Difference]: Without dead ends: 4385 [2025-04-13 17:39:39,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19071 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=6417, Invalid=52875, Unknown=0, NotChecked=0, Total=59292 [2025-04-13 17:39:39,226 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 1424 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 6683 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 7006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 6683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:39:39,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 318 Invalid, 7006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 6683 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-04-13 17:39:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2025-04-13 17:39:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 1574. [2025-04-13 17:39:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 2.9593134138588684) internal successors, (4655), 1573 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4655 transitions. [2025-04-13 17:39:40,526 INFO L79 Accepts]: Start accepts. Automaton has 1574 states and 4655 transitions. Word has length 33 [2025-04-13 17:39:40,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:39:40,526 INFO L485 AbstractCegarLoop]: Abstraction has 1574 states and 4655 transitions. [2025-04-13 17:39:40,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:40,526 INFO L278 IsEmpty]: Start isEmpty. Operand 1574 states and 4655 transitions. [2025-04-13 17:39:40,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:39:40,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:39:40,528 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:39:40,544 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:39:40,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:40,729 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:39:40,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:39:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -175017141, now seen corresponding path program 121 times [2025-04-13 17:39:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:39:40,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067592928] [2025-04-13 17:39:40,729 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:39:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:39:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:39:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:39:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:39:41,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067592928] [2025-04-13 17:39:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067592928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:39:41,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479911986] [2025-04-13 17:39:41,375 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:39:41,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:39:41,377 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:39:41,378 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:39:41,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:39:41,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:41,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:39:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:41,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:39:41,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:42,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:42,377 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:39:42,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:39:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479911986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:39:43,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:39:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:39:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692151802] [2025-04-13 17:39:43,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:39:43,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:39:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:39:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:39:43,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:39:43,161 INFO L87 Difference]: Start difference. First operand 1574 states and 4655 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:39:46,437 INFO L93 Difference]: Finished difference Result 1742 states and 5115 transitions. [2025-04-13 17:39:46,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:39:46,438 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:39:46,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:39:46,442 INFO L225 Difference]: With dead ends: 1742 [2025-04-13 17:39:46,442 INFO L226 Difference]: Without dead ends: 1730 [2025-04-13 17:39:46,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=631, Invalid=6175, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:39:46,443 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:39:46,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 150 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:39:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-04-13 17:39:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1582. [2025-04-13 17:39:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 2.956989247311828) internal successors, (4675), 1581 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 4675 transitions. [2025-04-13 17:39:47,792 INFO L79 Accepts]: Start accepts. Automaton has 1582 states and 4675 transitions. Word has length 33 [2025-04-13 17:39:47,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:39:47,792 INFO L485 AbstractCegarLoop]: Abstraction has 1582 states and 4675 transitions. [2025-04-13 17:39:47,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:47,792 INFO L278 IsEmpty]: Start isEmpty. Operand 1582 states and 4675 transitions. [2025-04-13 17:39:47,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:39:47,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:39:47,794 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:39:47,801 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:39:47,994 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,SelfDestructingSolverStorable128 [2025-04-13 17:39:47,995 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:39:47,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:39:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1969470418, now seen corresponding path program 122 times [2025-04-13 17:39:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:39:47,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019471284] [2025-04-13 17:39:47,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:39:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:39:48,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:39:48,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:48,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:39:48,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:39:48,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019471284] [2025-04-13 17:39:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019471284] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:39:48,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153565497] [2025-04-13 17:39:48,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:39:48,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:39:48,703 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:39:48,703 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:39:48,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:39:48,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:48,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:39:48,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:48,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:39:48,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:49,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:49,782 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:39:49,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:39:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:50,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153565497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:39:50,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:39:50,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:39:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786902852] [2025-04-13 17:39:50,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:39:50,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:39:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:39:50,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:39:50,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3872, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:39:50,575 INFO L87 Difference]: Start difference. First operand 1582 states and 4675 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:39:55,544 INFO L93 Difference]: Finished difference Result 1935 states and 5691 transitions. [2025-04-13 17:39:55,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:39:55,545 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:39:55,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:39:55,549 INFO L225 Difference]: With dead ends: 1935 [2025-04-13 17:39:55,549 INFO L226 Difference]: Without dead ends: 1928 [2025-04-13 17:39:55,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=681, Invalid=6629, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:39:55,550 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 179 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:39:55,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:39:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-04-13 17:39:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1588. [2025-04-13 17:39:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 2.959042218021424) internal successors, (4696), 1587 states have internal predecessors, (4696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 4696 transitions. [2025-04-13 17:39:56,896 INFO L79 Accepts]: Start accepts. Automaton has 1588 states and 4696 transitions. Word has length 33 [2025-04-13 17:39:56,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:39:56,896 INFO L485 AbstractCegarLoop]: Abstraction has 1588 states and 4696 transitions. [2025-04-13 17:39:56,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:56,896 INFO L278 IsEmpty]: Start isEmpty. Operand 1588 states and 4696 transitions. [2025-04-13 17:39:56,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:39:56,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:39:56,898 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:39:56,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2025-04-13 17:39:57,098 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,SelfDestructingSolverStorable129 [2025-04-13 17:39:57,098 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:39:57,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:39:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash 769540333, now seen corresponding path program 123 times [2025-04-13 17:39:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:39:57,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066611635] [2025-04-13 17:39:57,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:39:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:39:57,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:39:57,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:57,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:39:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:39:57,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066611635] [2025-04-13 17:39:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066611635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:39:57,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185673193] [2025-04-13 17:39:57,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:39:57,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:39:57,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:39:57,761 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:39:57,762 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:39:57,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:39:58,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:39:58,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:39:58,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:39:58,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 17:39:58,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:58,447 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 15 treesize of output 1 [2025-04-13 17:39:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:58,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:59,703 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:39:59,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:39:59,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:39:59,727 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:39:59,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:39:59,737 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:39:59,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:39:59,802 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:39:59,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 190 [2025-04-13 17:40:00,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:40:00,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 85 treesize of output 88 [2025-04-13 17:40:00,072 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:40:00,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:40:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:00,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185673193] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:00,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-04-13 17:40:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839875328] [2025-04-13 17:40:00,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:00,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 17:40:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:00,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 17:40:00,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=4256, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:40:00,646 INFO L87 Difference]: Start difference. First operand 1588 states and 4696 transitions. Second operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:07,460 INFO L93 Difference]: Finished difference Result 2088 states and 6012 transitions. [2025-04-13 17:40:07,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-13 17:40:07,460 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:40:07,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:07,465 INFO L225 Difference]: With dead ends: 2088 [2025-04-13 17:40:07,465 INFO L226 Difference]: Without dead ends: 2080 [2025-04-13 17:40:07,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=859, Invalid=13421, Unknown=0, NotChecked=0, Total=14280 [2025-04-13 17:40:07,466 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:07,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 237 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 17:40:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-04-13 17:40:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1606. [2025-04-13 17:40:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 2.9538940809968848) internal successors, (4741), 1605 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4741 transitions. [2025-04-13 17:40:08,842 INFO L79 Accepts]: Start accepts. Automaton has 1606 states and 4741 transitions. Word has length 33 [2025-04-13 17:40:08,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:08,842 INFO L485 AbstractCegarLoop]: Abstraction has 1606 states and 4741 transitions. [2025-04-13 17:40:08,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:08,843 INFO L278 IsEmpty]: Start isEmpty. Operand 1606 states and 4741 transitions. [2025-04-13 17:40:08,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:08,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:08,844 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:08,851 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:40:09,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:09,045 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:40:09,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash -936910453, now seen corresponding path program 124 times [2025-04-13 17:40:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:09,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303589827] [2025-04-13 17:40:09,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:40:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:09,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:09,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:09,059 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:40:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 17:40:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:09,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303589827] [2025-04-13 17:40:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303589827] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:09,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261935700] [2025-04-13 17:40:09,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:40:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:09,277 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:40:09,287 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:40:09,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:09,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:09,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:40:09,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:09,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:40:09,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:40:09,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:09,823 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:40:09,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:40:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 17:40:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261935700] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:09,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 27 [2025-04-13 17:40:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49786903] [2025-04-13 17:40:09,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:09,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:40:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:09,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:40:09,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:40:09,938 INFO L87 Difference]: Start difference. First operand 1606 states and 4741 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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:40:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:13,045 INFO L93 Difference]: Finished difference Result 1782 states and 5225 transitions. [2025-04-13 17:40:13,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:40:13,045 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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 33 [2025-04-13 17:40:13,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:13,049 INFO L225 Difference]: With dead ends: 1782 [2025-04-13 17:40:13,049 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 17:40:13,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1860, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:40:13,049 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:13,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 87 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:40:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 17:40:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1578. [2025-04-13 17:40:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 2.9454660748256183) internal successors, (4645), 1577 states have internal predecessors, (4645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4645 transitions. [2025-04-13 17:40:14,411 INFO L79 Accepts]: Start accepts. Automaton has 1578 states and 4645 transitions. Word has length 33 [2025-04-13 17:40:14,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:14,411 INFO L485 AbstractCegarLoop]: Abstraction has 1578 states and 4645 transitions. [2025-04-13 17:40:14,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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:40:14,411 INFO L278 IsEmpty]: Start isEmpty. Operand 1578 states and 4645 transitions. [2025-04-13 17:40:14,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:14,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:14,413 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:14,420 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:40:14,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:14,613 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:40:14,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -702013240, now seen corresponding path program 125 times [2025-04-13 17:40:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:14,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184120131] [2025-04-13 17:40:14,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:40:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:14,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:40:14,630 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:14,630 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:40:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:15,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:15,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184120131] [2025-04-13 17:40:15,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184120131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:15,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314844664] [2025-04-13 17:40:15,044 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:40:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:15,047 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:40:15,048 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:40:15,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:40:15,359 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:15,359 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:40:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:15,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:40:15,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:40:15,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:15,881 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:40:15,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:40:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:40:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314844664] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 9] total 35 [2025-04-13 17:40:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705812929] [2025-04-13 17:40:16,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:16,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:40:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:40:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:40:16,008 INFO L87 Difference]: Start difference. First operand 1578 states and 4645 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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:40:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:21,188 INFO L93 Difference]: Finished difference Result 1971 states and 5841 transitions. [2025-04-13 17:40:21,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:40:21,188 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:40:21,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:21,193 INFO L225 Difference]: With dead ends: 1971 [2025-04-13 17:40:21,193 INFO L226 Difference]: Without dead ends: 1964 [2025-04-13 17:40:21,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=299, Invalid=3483, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:40:21,194 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:21,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 118 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:40:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-04-13 17:40:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1564. [2025-04-13 17:40:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 2.9494561740243124) internal successors, (4610), 1563 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 4610 transitions. [2025-04-13 17:40:22,587 INFO L79 Accepts]: Start accepts. Automaton has 1564 states and 4610 transitions. Word has length 33 [2025-04-13 17:40:22,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:22,587 INFO L485 AbstractCegarLoop]: Abstraction has 1564 states and 4610 transitions. [2025-04-13 17:40:22,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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:40:22,587 INFO L278 IsEmpty]: Start isEmpty. Operand 1564 states and 4610 transitions. [2025-04-13 17:40:22,589 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:22,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:22,589 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:22,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2025-04-13 17:40:22,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:22,789 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:40:22,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -390694901, now seen corresponding path program 126 times [2025-04-13 17:40:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:22,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770032572] [2025-04-13 17:40:22,790 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:40:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:22,798 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:40:22,812 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:22,812 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:40:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:23,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770032572] [2025-04-13 17:40:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770032572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:23,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673436290] [2025-04-13 17:40:23,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:40:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:23,265 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:40:23,265 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:40:23,489 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-13 17:40:23,544 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:23,544 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 17:40:23,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:23,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 17:40:23,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:24,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:24,155 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:40:24,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:40:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673436290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:24,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 48 [2025-04-13 17:40:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477307988] [2025-04-13 17:40:24,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:24,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 17:40:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:24,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 17:40:24,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2118, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:40:24,560 INFO L87 Difference]: Start difference. First operand 1564 states and 4610 transitions. Second operand has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 48 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:40:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:27,375 INFO L93 Difference]: Finished difference Result 1666 states and 4879 transitions. [2025-04-13 17:40:27,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:40:27,375 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 48 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) Word has length 33 [2025-04-13 17:40:27,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:27,379 INFO L225 Difference]: With dead ends: 1666 [2025-04-13 17:40:27,379 INFO L226 Difference]: Without dead ends: 1658 [2025-04-13 17:40:27,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=2878, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:40:27,380 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:27,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 136 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:40:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-04-13 17:40:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1584. [2025-04-13 17:40:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 2.9437776373973468) internal successors, (4660), 1583 states have internal predecessors, (4660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 4660 transitions. [2025-04-13 17:40:28,783 INFO L79 Accepts]: Start accepts. Automaton has 1584 states and 4660 transitions. Word has length 33 [2025-04-13 17:40:28,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:28,783 INFO L485 AbstractCegarLoop]: Abstraction has 1584 states and 4660 transitions. [2025-04-13 17:40:28,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.489795918367347) internal successors, (73), 48 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:40:28,783 INFO L278 IsEmpty]: Start isEmpty. Operand 1584 states and 4660 transitions. [2025-04-13 17:40:28,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:28,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:28,785 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:28,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 17:40:28,985 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,SelfDestructingSolverStorable133 [2025-04-13 17:40:28,985 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:40:28,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1128257642, now seen corresponding path program 127 times [2025-04-13 17:40:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:28,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070911839] [2025-04-13 17:40:28,986 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:40:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:28,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:40:29,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:29,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:40:29,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:29,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:29,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070911839] [2025-04-13 17:40:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070911839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:29,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663693135] [2025-04-13 17:40:29,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:40:29,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:29,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:29,625 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:40:29,626 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:40:29,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:40:29,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:29,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:40:29,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:29,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:40:29,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:30,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:30,595 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:40:30,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:40:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663693135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:31,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:40:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010248042] [2025-04-13 17:40:31,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:31,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:40:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:31,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:40:31,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=3865, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:40:31,408 INFO L87 Difference]: Start difference. First operand 1584 states and 4660 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:34,887 INFO L93 Difference]: Finished difference Result 1709 states and 5001 transitions. [2025-04-13 17:40:34,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:40:34,888 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:40:34,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:34,892 INFO L225 Difference]: With dead ends: 1709 [2025-04-13 17:40:34,892 INFO L226 Difference]: Without dead ends: 1699 [2025-04-13 17:40:34,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=616, Invalid=5864, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 17:40:34,893 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 76 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:34,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 136 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:40:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-04-13 17:40:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1584. [2025-04-13 17:40:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 2.9437776373973468) internal successors, (4660), 1583 states have internal predecessors, (4660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 4660 transitions. [2025-04-13 17:40:36,294 INFO L79 Accepts]: Start accepts. Automaton has 1584 states and 4660 transitions. Word has length 33 [2025-04-13 17:40:36,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:36,294 INFO L485 AbstractCegarLoop]: Abstraction has 1584 states and 4660 transitions. [2025-04-13 17:40:36,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:36,294 INFO L278 IsEmpty]: Start isEmpty. Operand 1584 states and 4660 transitions. [2025-04-13 17:40:36,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:36,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:36,296 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:36,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2025-04-13 17:40:36,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2025-04-13 17:40:36,496 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:40:36,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1072449675, now seen corresponding path program 128 times [2025-04-13 17:40:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:36,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140663861] [2025-04-13 17:40:36,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:40:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:36,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:36,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:36,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:40:36,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:37,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:37,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140663861] [2025-04-13 17:40:37,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140663861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:37,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716812938] [2025-04-13 17:40:37,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:40:37,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:37,161 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:40:37,161 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:40:37,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:37,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:37,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:40:37,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:37,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 17:40:37,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:38,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:38,427 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:40:38,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:40:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:40:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716812938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:39,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 66 [2025-04-13 17:40:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879603420] [2025-04-13 17:40:39,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:39,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 17:40:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:39,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 17:40:39,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4020, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:40:39,213 INFO L87 Difference]: Start difference. First operand 1584 states and 4660 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 66 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:42,733 INFO L93 Difference]: Finished difference Result 1655 states and 4819 transitions. [2025-04-13 17:40:42,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:40:42,734 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 66 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:40:42,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:42,738 INFO L225 Difference]: With dead ends: 1655 [2025-04-13 17:40:42,738 INFO L226 Difference]: Without dead ends: 1619 [2025-04-13 17:40:42,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=590, Invalid=6382, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 17:40:42,738 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:42,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 209 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:40:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-04-13 17:40:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1583. [2025-04-13 17:40:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 2.9424778761061945) internal successors, (4655), 1582 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 4655 transitions. [2025-04-13 17:40:44,161 INFO L79 Accepts]: Start accepts. Automaton has 1583 states and 4655 transitions. Word has length 33 [2025-04-13 17:40:44,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:44,161 INFO L485 AbstractCegarLoop]: Abstraction has 1583 states and 4655 transitions. [2025-04-13 17:40:44,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 66 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:44,161 INFO L278 IsEmpty]: Start isEmpty. Operand 1583 states and 4655 transitions. [2025-04-13 17:40:44,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:44,163 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:44,170 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:40:44,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 17:40:44,363 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:40:44,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -635705, now seen corresponding path program 129 times [2025-04-13 17:40:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:44,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473267361] [2025-04-13 17:40:44,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:40:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:44,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:40:44,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:44,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:40:44,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 17:40:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:44,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473267361] [2025-04-13 17:40:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473267361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:44,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528671143] [2025-04-13 17:40:44,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:40:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:44,644 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:40:44,644 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:40:44,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:40:44,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:44,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:40:44,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:44,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:40:44,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:45,071 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 15 treesize of output 1 [2025-04-13 17:40:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:45,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:45,919 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:40:45,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:40:45,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:40:45,941 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:40:45,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:40:45,948 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:40:45,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:40:45,980 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:40:45,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:40:46,030 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:40:46,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:40:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:40:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528671143] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:46,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 45 [2025-04-13 17:40:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375307167] [2025-04-13 17:40:46,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:46,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 17:40:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:46,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 17:40:46,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:40:46,444 INFO L87 Difference]: Start difference. First operand 1583 states and 4655 transitions. Second operand has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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:40:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:50,659 INFO L93 Difference]: Finished difference Result 1798 states and 5152 transitions. [2025-04-13 17:40:50,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:40:50,659 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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) Word has length 33 [2025-04-13 17:40:50,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:50,663 INFO L225 Difference]: With dead ends: 1798 [2025-04-13 17:40:50,664 INFO L226 Difference]: Without dead ends: 1766 [2025-04-13 17:40:50,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=2920, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:40:50,664 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 110 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:50,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 148 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:40:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-04-13 17:40:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1659. [2025-04-13 17:40:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1658 states have (on average 2.9559710494571774) internal successors, (4901), 1658 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4901 transitions. [2025-04-13 17:40:52,131 INFO L79 Accepts]: Start accepts. Automaton has 1659 states and 4901 transitions. Word has length 33 [2025-04-13 17:40:52,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:52,131 INFO L485 AbstractCegarLoop]: Abstraction has 1659 states and 4901 transitions. [2025-04-13 17:40:52,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 45 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:40:52,131 INFO L278 IsEmpty]: Start isEmpty. Operand 1659 states and 4901 transitions. [2025-04-13 17:40:52,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:52,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:52,133 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:52,140 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:40:52,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 17:40:52,333 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:40:52,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 622164363, now seen corresponding path program 130 times [2025-04-13 17:40:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:52,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149694111] [2025-04-13 17:40:52,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:40:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:52,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:52,347 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:52,347 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:40:52,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:40:52,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:52,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149694111] [2025-04-13 17:40:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149694111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:52,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809168122] [2025-04-13 17:40:52,558 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:40:52,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:52,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:52,559 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:40:52,560 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:40:52,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:40:52,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:52,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:40:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:52,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:40:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:40:53,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:53,062 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:40:53,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:40:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:40:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809168122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:53,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 25 [2025-04-13 17:40:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119395178] [2025-04-13 17:40:53,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:53,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:40:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:53,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:40:53,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:40:53,170 INFO L87 Difference]: Start difference. First operand 1659 states and 4901 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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:40:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:56,569 INFO L93 Difference]: Finished difference Result 1762 states and 5095 transitions. [2025-04-13 17:40:56,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:40:56,570 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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 33 [2025-04-13 17:40:56,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:56,574 INFO L225 Difference]: With dead ends: 1762 [2025-04-13 17:40:56,574 INFO L226 Difference]: Without dead ends: 1742 [2025-04-13 17:40:56,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:40:56,574 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:56,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 104 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:40:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-04-13 17:40:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1659. [2025-04-13 17:40:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1658 states have (on average 2.951145958986731) internal successors, (4893), 1658 states have internal predecessors, (4893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4893 transitions. [2025-04-13 17:40:58,050 INFO L79 Accepts]: Start accepts. Automaton has 1659 states and 4893 transitions. Word has length 33 [2025-04-13 17:40:58,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:58,050 INFO L485 AbstractCegarLoop]: Abstraction has 1659 states and 4893 transitions. [2025-04-13 17:40:58,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 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:40:58,050 INFO L278 IsEmpty]: Start isEmpty. Operand 1659 states and 4893 transitions. [2025-04-13 17:40:58,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:40:58,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:58,051 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:58,058 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:40:58,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:58,252 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:40:58,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 677575623, now seen corresponding path program 131 times [2025-04-13 17:40:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:58,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140827158] [2025-04-13 17:40:58,252 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:40:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:58,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:40:58,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:58,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:40:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 17:40:58,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:58,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140827158] [2025-04-13 17:40:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140827158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:58,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247520974] [2025-04-13 17:40:58,551 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:40:58,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:58,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:58,553 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:40:58,553 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:40:58,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:40:58,842 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:40:58,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:40:58,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:58,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:40:58,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:40:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:40:59,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:40:59,205 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:40:59,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:40:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:40:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247520974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:40:59,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:40:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 7] total 27 [2025-04-13 17:40:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964707366] [2025-04-13 17:40:59,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:40:59,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:40:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:40:59,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:40:59,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:40:59,237 INFO L87 Difference]: Start difference. First operand 1659 states and 4893 transitions. Second operand has 28 states, 28 states have (on average 2.0) 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:41:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:02,525 INFO L93 Difference]: Finished difference Result 1822 states and 5252 transitions. [2025-04-13 17:41:02,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:41:02,525 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) 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 33 [2025-04-13 17:41:02,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:02,530 INFO L225 Difference]: With dead ends: 1822 [2025-04-13 17:41:02,531 INFO L226 Difference]: Without dead ends: 1814 [2025-04-13 17:41:02,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:41:02,531 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:02,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 114 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:41:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2025-04-13 17:41:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1659. [2025-04-13 17:41:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1658 states have (on average 2.951145958986731) internal successors, (4893), 1658 states have internal predecessors, (4893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4893 transitions. [2025-04-13 17:41:04,008 INFO L79 Accepts]: Start accepts. Automaton has 1659 states and 4893 transitions. Word has length 33 [2025-04-13 17:41:04,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:04,008 INFO L485 AbstractCegarLoop]: Abstraction has 1659 states and 4893 transitions. [2025-04-13 17:41:04,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) 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:41:04,008 INFO L278 IsEmpty]: Start isEmpty. Operand 1659 states and 4893 transitions. [2025-04-13 17:41:04,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:41:04,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:04,010 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:04,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2025-04-13 17:41:04,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2025-04-13 17:41:04,210 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:41:04,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 591688170, now seen corresponding path program 132 times [2025-04-13 17:41:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:04,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082955388] [2025-04-13 17:41:04,211 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:41:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:04,218 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:41:04,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:04,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-13 17:41:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:41:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:04,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082955388] [2025-04-13 17:41:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082955388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:04,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959014616] [2025-04-13 17:41:04,774 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:41:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:04,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:04,776 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:41:04,777 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:41:05,008 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 6 equivalence classes. [2025-04-13 17:41:05,118 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:05,118 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-13 17:41:05,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:05,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 17:41:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:05,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:05,966 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:41:05,967 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:41:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959014616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:06,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 22] total 61 [2025-04-13 17:41:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079642092] [2025-04-13 17:41:06,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:06,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-13 17:41:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-13 17:41:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3481, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:41:06,734 INFO L87 Difference]: Start difference. First operand 1659 states and 4893 transitions. Second operand has 62 states, 62 states have (on average 1.435483870967742) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:11,133 INFO L93 Difference]: Finished difference Result 1890 states and 5546 transitions. [2025-04-13 17:41:11,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:41:11,133 INFO L79 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.435483870967742) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:41:11,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:11,137 INFO L225 Difference]: With dead ends: 1890 [2025-04-13 17:41:11,137 INFO L226 Difference]: Without dead ends: 1809 [2025-04-13 17:41:11,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=757, Invalid=8173, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 17:41:11,138 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 313 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:11,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 205 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:41:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-04-13 17:41:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1696. [2025-04-13 17:41:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 2.944542772861357) internal successors, (4991), 1695 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4991 transitions. [2025-04-13 17:41:12,648 INFO L79 Accepts]: Start accepts. Automaton has 1696 states and 4991 transitions. Word has length 33 [2025-04-13 17:41:12,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:12,648 INFO L485 AbstractCegarLoop]: Abstraction has 1696 states and 4991 transitions. [2025-04-13 17:41:12,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.435483870967742) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:12,648 INFO L278 IsEmpty]: Start isEmpty. Operand 1696 states and 4991 transitions. [2025-04-13 17:41:12,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:41:12,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:12,650 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:12,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2025-04-13 17:41:12,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:12,850 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:41:12,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2040346680, now seen corresponding path program 133 times [2025-04-13 17:41:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:12,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003391756] [2025-04-13 17:41:12,851 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:41:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:12,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:41:12,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:12,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:41:12,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:13,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003391756] [2025-04-13 17:41:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003391756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:13,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358736678] [2025-04-13 17:41:13,478 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:41:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:13,479 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:41:13,481 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:41:13,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:41:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:41:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:13,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:41:13,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:14,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:14,483 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:41:14,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:41:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358736678] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:15,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 17:41:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277172341] [2025-04-13 17:41:15,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:15,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:41:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:15,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:41:15,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=3875, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:41:15,272 INFO L87 Difference]: Start difference. First operand 1696 states and 4991 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:19,455 INFO L93 Difference]: Finished difference Result 1891 states and 5545 transitions. [2025-04-13 17:41:19,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:41:19,455 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:41:19,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:19,459 INFO L225 Difference]: With dead ends: 1891 [2025-04-13 17:41:19,460 INFO L226 Difference]: Without dead ends: 1878 [2025-04-13 17:41:19,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=630, Invalid=6342, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 17:41:19,460 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 158 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:19,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 132 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:41:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2025-04-13 17:41:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1696. [2025-04-13 17:41:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 2.944542772861357) internal successors, (4991), 1695 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4991 transitions. [2025-04-13 17:41:20,998 INFO L79 Accepts]: Start accepts. Automaton has 1696 states and 4991 transitions. Word has length 33 [2025-04-13 17:41:20,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:20,998 INFO L485 AbstractCegarLoop]: Abstraction has 1696 states and 4991 transitions. [2025-04-13 17:41:20,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:20,998 INFO L278 IsEmpty]: Start isEmpty. Operand 1696 states and 4991 transitions. [2025-04-13 17:41:21,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:41:21,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:21,000 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:21,007 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:41:21,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:21,200 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:41:21,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2029048406, now seen corresponding path program 134 times [2025-04-13 17:41:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:21,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673231750] [2025-04-13 17:41:21,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:41:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:21,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:41:21,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:21,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:41:21,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:21,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673231750] [2025-04-13 17:41:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673231750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:21,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647506978] [2025-04-13 17:41:21,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:41:21,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:21,911 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:41:21,911 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:41:22,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:41:22,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:22,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:41:22,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:22,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 17:41:22,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:22,572 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 15 treesize of output 1 [2025-04-13 17:41:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:23,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:23,934 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:23,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:41:23,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:41:23,957 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:41:23,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 17:41:23,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:23,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:41:23,995 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:41:23,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:41:24,032 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:41:24,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:41:24,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:24,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:41:24,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:24,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:41:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647506978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:24,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-04-13 17:41:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042217709] [2025-04-13 17:41:24,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:24,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 17:41:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:24,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 17:41:24,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=4183, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:41:24,775 INFO L87 Difference]: Start difference. First operand 1696 states and 4991 transitions. Second operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:31,582 INFO L93 Difference]: Finished difference Result 2138 states and 6210 transitions. [2025-04-13 17:41:31,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:41:31,583 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:41:31,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:31,587 INFO L225 Difference]: With dead ends: 2138 [2025-04-13 17:41:31,587 INFO L226 Difference]: Without dead ends: 2116 [2025-04-13 17:41:31,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=651, Invalid=8469, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 17:41:31,588 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 304 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:31,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 185 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:41:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-04-13 17:41:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1696. [2025-04-13 17:41:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 2.944542772861357) internal successors, (4991), 1695 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4991 transitions. [2025-04-13 17:41:33,154 INFO L79 Accepts]: Start accepts. Automaton has 1696 states and 4991 transitions. Word has length 33 [2025-04-13 17:41:33,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:33,154 INFO L485 AbstractCegarLoop]: Abstraction has 1696 states and 4991 transitions. [2025-04-13 17:41:33,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:33,154 INFO L278 IsEmpty]: Start isEmpty. Operand 1696 states and 4991 transitions. [2025-04-13 17:41:33,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:41:33,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:33,155 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:33,165 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:41:33,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:33,356 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:41:33,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1678801912, now seen corresponding path program 135 times [2025-04-13 17:41:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:33,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008203087] [2025-04-13 17:41:33,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:41:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:33,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:41:33,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:33,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:41:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:41:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:33,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008203087] [2025-04-13 17:41:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008203087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:33,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046354972] [2025-04-13 17:41:33,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:41:33,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:33,775 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:41:33,775 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:41:34,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:41:34,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:34,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:41:34,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:34,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 17:41:34,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:34,428 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 15 treesize of output 1 [2025-04-13 17:41:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:34,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:35,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:35,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:41:35,487 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:41:35,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:41:35,529 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:41:35,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:41:35,719 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:35,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:41:35,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:41:35,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:41:35,750 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:41:35,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:41:35,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:41:35,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:41:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:41:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046354972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:36,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 23] total 62 [2025-04-13 17:41:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080431380] [2025-04-13 17:41:36,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:36,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-13 17:41:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-13 17:41:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3562, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 17:41:36,228 INFO L87 Difference]: Start difference. First operand 1696 states and 4991 transitions. Second operand has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:41,879 INFO L93 Difference]: Finished difference Result 2037 states and 5957 transitions. [2025-04-13 17:41:41,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:41:41,880 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:41:41,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:41,884 INFO L225 Difference]: With dead ends: 2037 [2025-04-13 17:41:41,884 INFO L226 Difference]: Without dead ends: 2021 [2025-04-13 17:41:41,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=484, Invalid=5066, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 17:41:41,885 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:41,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 158 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:41:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2025-04-13 17:41:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1696. [2025-04-13 17:41:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 2.944542772861357) internal successors, (4991), 1695 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4991 transitions. [2025-04-13 17:41:43,454 INFO L79 Accepts]: Start accepts. Automaton has 1696 states and 4991 transitions. Word has length 33 [2025-04-13 17:41:43,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:43,454 INFO L485 AbstractCegarLoop]: Abstraction has 1696 states and 4991 transitions. [2025-04-13 17:41:43,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:43,455 INFO L278 IsEmpty]: Start isEmpty. Operand 1696 states and 4991 transitions. [2025-04-13 17:41:43,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:41:43,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:43,456 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:43,463 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:41:43,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:43,657 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:41:43,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash 588904810, now seen corresponding path program 136 times [2025-04-13 17:41:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:43,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072659135] [2025-04-13 17:41:43,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:41:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:43,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:41:43,671 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:43,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:41:43,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:43,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072659135] [2025-04-13 17:41:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072659135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:43,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014624505] [2025-04-13 17:41:43,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:41:43,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:43,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:43,937 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:41:43,938 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:41:44,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:41:44,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:41:44,195 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:41:44,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:44,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:41:44,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:44,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:44,690 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:41:44,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:41:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014624505] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:44,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 34 [2025-04-13 17:41:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485700008] [2025-04-13 17:41:44,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:44,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:41:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:44,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:41:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:41:44,828 INFO L87 Difference]: Start difference. First operand 1696 states and 4991 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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:41:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:50,640 INFO L93 Difference]: Finished difference Result 2057 states and 6057 transitions. [2025-04-13 17:41:50,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:41:50,640 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 33 [2025-04-13 17:41:50,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:50,645 INFO L225 Difference]: With dead ends: 2057 [2025-04-13 17:41:50,645 INFO L226 Difference]: Without dead ends: 2032 [2025-04-13 17:41:50,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=295, Invalid=2567, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:41:50,646 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 434 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:50,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 128 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:41:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2025-04-13 17:41:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1527. [2025-04-13 17:41:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 2.8944954128440368) internal successors, (4417), 1526 states have internal predecessors, (4417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 4417 transitions. [2025-04-13 17:41:52,120 INFO L79 Accepts]: Start accepts. Automaton has 1527 states and 4417 transitions. Word has length 33 [2025-04-13 17:41:52,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:52,120 INFO L485 AbstractCegarLoop]: Abstraction has 1527 states and 4417 transitions. [2025-04-13 17:41:52,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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:41:52,120 INFO L278 IsEmpty]: Start isEmpty. Operand 1527 states and 4417 transitions. [2025-04-13 17:41:52,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:41:52,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:52,122 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:52,128 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:41:52,322 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,SelfDestructingSolverStorable143 [2025-04-13 17:41:52,322 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:41:52,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 783819580, now seen corresponding path program 137 times [2025-04-13 17:41:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:52,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112034186] [2025-04-13 17:41:52,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:41:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:52,331 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:41:52,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:41:52,336 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:41:52,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:52,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112034186] [2025-04-13 17:41:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112034186] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:52,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699114633] [2025-04-13 17:41:52,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:41:52,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:52,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:52,409 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:41:52,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-04-13 17:41:52,649 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:41:52,738 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:41:52,739 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:41:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:52,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:41:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:52,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699114633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:52,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 6] total 17 [2025-04-13 17:41:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401974874] [2025-04-13 17:41:52,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:52,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:41:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:41:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:41:52,936 INFO L87 Difference]: Start difference. First operand 1527 states and 4417 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:41:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:41:55,883 INFO L93 Difference]: Finished difference Result 1704 states and 4824 transitions. [2025-04-13 17:41:55,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:41:55,883 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 34 [2025-04-13 17:41:55,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:41:55,887 INFO L225 Difference]: With dead ends: 1704 [2025-04-13 17:41:55,887 INFO L226 Difference]: Without dead ends: 1695 [2025-04-13 17:41:55,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:41:55,887 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:41:55,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 90 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:41:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-04-13 17:41:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1605. [2025-04-13 17:41:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 2.8952618453865338) internal successors, (4644), 1604 states have internal predecessors, (4644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:41:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4644 transitions. [2025-04-13 17:41:57,517 INFO L79 Accepts]: Start accepts. Automaton has 1605 states and 4644 transitions. Word has length 34 [2025-04-13 17:41:57,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:41:57,517 INFO L485 AbstractCegarLoop]: Abstraction has 1605 states and 4644 transitions. [2025-04-13 17:41:57,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:41:57,517 INFO L278 IsEmpty]: Start isEmpty. Operand 1605 states and 4644 transitions. [2025-04-13 17:41:57,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:41:57,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:41:57,519 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:41:57,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2025-04-13 17:41:57,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2025-04-13 17:41:57,719 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:41:57,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:41:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1299664870, now seen corresponding path program 138 times [2025-04-13 17:41:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:41:57,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556672744] [2025-04-13 17:41:57,720 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:41:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:41:57,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:41:57,739 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:41:57,739 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:41:57,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:41:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:41:58,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556672744] [2025-04-13 17:41:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556672744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:41:58,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281065272] [2025-04-13 17:41:58,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:41:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:41:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:41:58,114 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:41:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-04-13 17:41:58,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:41:58,384 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:41:58,384 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:41:58,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:41:58,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:41:58,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:41:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:58,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:41:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:41:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281065272] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:41:58,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:41:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 6] total 35 [2025-04-13 17:41:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991431328] [2025-04-13 17:41:58,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:41:58,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:41:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:41:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:41:58,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:41:58,714 INFO L87 Difference]: Start difference. First operand 1605 states and 4644 transitions. Second operand has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 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:42:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:03,750 INFO L93 Difference]: Finished difference Result 2206 states and 6268 transitions. [2025-04-13 17:42:03,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:42:03,751 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 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) Word has length 34 [2025-04-13 17:42:03,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:03,755 INFO L225 Difference]: With dead ends: 2206 [2025-04-13 17:42:03,755 INFO L226 Difference]: Without dead ends: 1983 [2025-04-13 17:42:03,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=3132, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:42:03,756 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 122 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:03,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 163 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:42:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-04-13 17:42:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1775. [2025-04-13 17:42:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 2.9408117249154455) internal successors, (5217), 1774 states have internal predecessors, (5217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 5217 transitions. [2025-04-13 17:42:05,623 INFO L79 Accepts]: Start accepts. Automaton has 1775 states and 5217 transitions. Word has length 34 [2025-04-13 17:42:05,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:42:05,623 INFO L485 AbstractCegarLoop]: Abstraction has 1775 states and 5217 transitions. [2025-04-13 17:42:05,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 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:42:05,623 INFO L278 IsEmpty]: Start isEmpty. Operand 1775 states and 5217 transitions. [2025-04-13 17:42:05,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:42:05,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:42:05,625 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:42:05,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2025-04-13 17:42:05,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:05,826 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:42:05,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:42:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 947791860, now seen corresponding path program 139 times [2025-04-13 17:42:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:42:05,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206361892] [2025-04-13 17:42:05,826 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:42:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:42:05,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 17:42:05,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:05,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:42:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:42:05,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206361892] [2025-04-13 17:42:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206361892] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:42:05,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929860227] [2025-04-13 17:42:05,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:42:05,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:05,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:42:05,943 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:42:05,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-04-13 17:42:06,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 17:42:06,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:06,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:42:06,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:06,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:42:06,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:06,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:06,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929860227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:06,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:06,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 6] total 17 [2025-04-13 17:42:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975754013] [2025-04-13 17:42:06,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:06,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:42:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:06,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:42:06,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:06,370 INFO L87 Difference]: Start difference. First operand 1775 states and 5217 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:42:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:10,363 INFO L93 Difference]: Finished difference Result 2032 states and 5935 transitions. [2025-04-13 17:42:10,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:42:10,364 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 34 [2025-04-13 17:42:10,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:10,368 INFO L225 Difference]: With dead ends: 2032 [2025-04-13 17:42:10,368 INFO L226 Difference]: Without dead ends: 2023 [2025-04-13 17:42:10,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:10,369 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:10,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:42:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-04-13 17:42:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1883. [2025-04-13 17:42:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 3.001594048884166) internal successors, (5649), 1882 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5649 transitions. [2025-04-13 17:42:12,328 INFO L79 Accepts]: Start accepts. Automaton has 1883 states and 5649 transitions. Word has length 34 [2025-04-13 17:42:12,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:42:12,328 INFO L485 AbstractCegarLoop]: Abstraction has 1883 states and 5649 transitions. [2025-04-13 17:42:12,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:42:12,328 INFO L278 IsEmpty]: Start isEmpty. Operand 1883 states and 5649 transitions. [2025-04-13 17:42:12,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:42:12,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:42:12,330 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:42:12,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2025-04-13 17:42:12,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 17:42:12,531 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:42:12,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:42:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1899473754, now seen corresponding path program 140 times [2025-04-13 17:42:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:42:12,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496128093] [2025-04-13 17:42:12,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:42:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:42:12,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:42:12,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:12,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:42:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:42:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:42:12,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496128093] [2025-04-13 17:42:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496128093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:42:12,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888885983] [2025-04-13 17:42:12,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:42:12,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:12,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:42:12,862 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:42:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2025-04-13 17:42:13,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:42:13,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:13,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:42:13,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:13,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:42:13,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:13,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888885983] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:13,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 6] total 34 [2025-04-13 17:42:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947839606] [2025-04-13 17:42:13,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:13,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:42:13,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:13,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:42:13,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:42:13,502 INFO L87 Difference]: Start difference. First operand 1883 states and 5649 transitions. Second operand has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 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:42:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:18,710 INFO L93 Difference]: Finished difference Result 2297 states and 6808 transitions. [2025-04-13 17:42:18,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:42:18,710 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 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) Word has length 34 [2025-04-13 17:42:18,710 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:18,715 INFO L225 Difference]: With dead ends: 2297 [2025-04-13 17:42:18,715 INFO L226 Difference]: Without dead ends: 2205 [2025-04-13 17:42:18,715 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:42:18,716 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 103 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:18,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:42:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-04-13 17:42:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2040. [2025-04-13 17:42:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2039 states have (on average 3.0505149583128985) internal successors, (6220), 2039 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 6220 transitions. [2025-04-13 17:42:20,952 INFO L79 Accepts]: Start accepts. Automaton has 2040 states and 6220 transitions. Word has length 34 [2025-04-13 17:42:20,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:42:20,952 INFO L485 AbstractCegarLoop]: Abstraction has 2040 states and 6220 transitions. [2025-04-13 17:42:20,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 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:42:20,952 INFO L278 IsEmpty]: Start isEmpty. Operand 2040 states and 6220 transitions. [2025-04-13 17:42:20,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:42:20,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:42:20,954 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:42:20,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2025-04-13 17:42:21,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 17:42:21,155 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:42:21,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:42:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1336841396, now seen corresponding path program 141 times [2025-04-13 17:42:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:42:21,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442243051] [2025-04-13 17:42:21,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:42:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:42:21,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:42:21,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:21,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:42:21,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:42:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:42:22,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442243051] [2025-04-13 17:42:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442243051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:42:22,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147890693] [2025-04-13 17:42:22,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:42:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:42:22,225 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:42:22,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2025-04-13 17:42:22,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:42:22,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:22,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:42:22,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:22,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:42:22,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:42:23,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:42:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147890693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:23,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 17] total 57 [2025-04-13 17:42:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696943399] [2025-04-13 17:42:23,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:23,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-13 17:42:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:23,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-13 17:42:23,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3089, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:42:23,920 INFO L87 Difference]: Start difference. First operand 2040 states and 6220 transitions. Second operand has 59 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 58 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:35,584 INFO L93 Difference]: Finished difference Result 3571 states and 10592 transitions. [2025-04-13 17:42:35,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 17:42:35,585 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 58 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 17:42:35,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:35,591 INFO L225 Difference]: With dead ends: 3571 [2025-04-13 17:42:35,591 INFO L226 Difference]: Without dead ends: 2971 [2025-04-13 17:42:35,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1009, Invalid=8497, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 17:42:35,592 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 367 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 3296 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:35,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 258 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3296 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 17:42:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-04-13 17:42:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2294. [2025-04-13 17:42:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 2.978194505015264) internal successors, (6829), 2293 states have internal predecessors, (6829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 6829 transitions. [2025-04-13 17:42:38,397 INFO L79 Accepts]: Start accepts. Automaton has 2294 states and 6829 transitions. Word has length 34 [2025-04-13 17:42:38,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:42:38,397 INFO L485 AbstractCegarLoop]: Abstraction has 2294 states and 6829 transitions. [2025-04-13 17:42:38,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 58 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:38,397 INFO L278 IsEmpty]: Start isEmpty. Operand 2294 states and 6829 transitions. [2025-04-13 17:42:38,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:42:38,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:42:38,400 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:42:38,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2025-04-13 17:42:38,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2025-04-13 17:42:38,600 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:42:38,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:42:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -388037094, now seen corresponding path program 142 times [2025-04-13 17:42:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:42:38,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720919348] [2025-04-13 17:42:38,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:42:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:42:38,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:42:38,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:38,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:42:38,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:42:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:42:38,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720919348] [2025-04-13 17:42:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720919348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:42:38,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717563111] [2025-04-13 17:42:38,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:42:38,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:38,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:42:38,708 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:42:38,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-04-13 17:42:38,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:42:38,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:38,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:42:38,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:38,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:42:38,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:39,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-13 17:42:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717563111] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:39,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 6] total 17 [2025-04-13 17:42:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448911734] [2025-04-13 17:42:39,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:39,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:42:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:39,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:42:39,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:39,170 INFO L87 Difference]: Start difference. First operand 2294 states and 6829 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:42:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:46,025 INFO L93 Difference]: Finished difference Result 2787 states and 8325 transitions. [2025-04-13 17:42:46,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:42:46,025 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 34 [2025-04-13 17:42:46,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:46,031 INFO L225 Difference]: With dead ends: 2787 [2025-04-13 17:42:46,031 INFO L226 Difference]: Without dead ends: 2778 [2025-04-13 17:42:46,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:46,032 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:46,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 77 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:42:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2025-04-13 17:42:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2538. [2025-04-13 17:42:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2537 states have (on average 3.075679936933386) internal successors, (7803), 2537 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:42:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 7803 transitions. [2025-04-13 17:42:49,176 INFO L79 Accepts]: Start accepts. Automaton has 2538 states and 7803 transitions. Word has length 34 [2025-04-13 17:42:49,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:42:49,176 INFO L485 AbstractCegarLoop]: Abstraction has 2538 states and 7803 transitions. [2025-04-13 17:42:49,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:42:49,176 INFO L278 IsEmpty]: Start isEmpty. Operand 2538 states and 7803 transitions. [2025-04-13 17:42:49,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:42:49,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:42:49,179 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:42:49,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Forceful destruction successful, exit code 0 [2025-04-13 17:42:49,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:49,379 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:42:49,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:42:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1075107482, now seen corresponding path program 143 times [2025-04-13 17:42:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:42:49,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755636837] [2025-04-13 17:42:49,380 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:42:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:42:49,388 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:42:49,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:49,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:42:49,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:42:49,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755636837] [2025-04-13 17:42:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755636837] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:42:49,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474554702] [2025-04-13 17:42:49,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:42:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:42:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:42:49,470 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:42:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-04-13 17:42:49,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 17:42:49,795 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:42:49,795 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:42:49,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:42:49,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:42:49,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:49,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:42:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474554702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:49,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 6] total 17 [2025-04-13 17:42:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811600109] [2025-04-13 17:42:49,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:49,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:42:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:49,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:42:49,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:49,972 INFO L87 Difference]: Start difference. First operand 2538 states and 7803 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:42:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:42:57,878 INFO L93 Difference]: Finished difference Result 2884 states and 8713 transitions. [2025-04-13 17:42:57,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:42:57,878 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 34 [2025-04-13 17:42:57,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:42:57,885 INFO L225 Difference]: With dead ends: 2884 [2025-04-13 17:42:57,885 INFO L226 Difference]: Without dead ends: 2875 [2025-04-13 17:42:57,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:42:57,885 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:42:57,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 91 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:42:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2025-04-13 17:43:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2672. [2025-04-13 17:43:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2671 states have (on average 3.0984649943841256) internal successors, (8276), 2671 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 8276 transitions. [2025-04-13 17:43:01,552 INFO L79 Accepts]: Start accepts. Automaton has 2672 states and 8276 transitions. Word has length 34 [2025-04-13 17:43:01,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:01,552 INFO L485 AbstractCegarLoop]: Abstraction has 2672 states and 8276 transitions. [2025-04-13 17:43:01,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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:43:01,552 INFO L278 IsEmpty]: Start isEmpty. Operand 2672 states and 8276 transitions. [2025-04-13 17:43:01,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:43:01,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:01,555 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:01,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2025-04-13 17:43:01,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:01,755 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:01,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1150619954, now seen corresponding path program 144 times [2025-04-13 17:43:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:01,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288969321] [2025-04-13 17:43:01,756 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:43:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:01,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:43:01,771 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:43:01,771 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:43:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 17:43:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:01,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288969321] [2025-04-13 17:43:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288969321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:01,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747582359] [2025-04-13 17:43:01,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:43:01,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:01,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:01,898 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:01,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-04-13 17:43:02,160 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:43:02,188 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:43:02,188 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:43:02,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:02,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:43:02,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 17:43:02,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 17:43:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747582359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:02,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2025-04-13 17:43:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175448583] [2025-04-13 17:43:02,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:02,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:43:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:02,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:43:02,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:43:02,527 INFO L87 Difference]: Start difference. First operand 2672 states and 8276 transitions. Second operand has 32 states, 32 states have (on average 1.78125) 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:43:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:11,077 INFO L93 Difference]: Finished difference Result 4303 states and 12725 transitions. [2025-04-13 17:43:11,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:43:11,077 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.78125) 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 35 [2025-04-13 17:43:11,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:11,084 INFO L225 Difference]: With dead ends: 4303 [2025-04-13 17:43:11,084 INFO L226 Difference]: Without dead ends: 2326 [2025-04-13 17:43:11,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:43:11,086 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:11,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 71 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:43:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-04-13 17:43:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1954. [2025-04-13 17:43:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 2.8745519713261647) internal successors, (5614), 1953 states have internal predecessors, (5614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 5614 transitions. [2025-04-13 17:43:14,142 INFO L79 Accepts]: Start accepts. Automaton has 1954 states and 5614 transitions. Word has length 35 [2025-04-13 17:43:14,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:14,142 INFO L485 AbstractCegarLoop]: Abstraction has 1954 states and 5614 transitions. [2025-04-13 17:43:14,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.78125) 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:43:14,143 INFO L278 IsEmpty]: Start isEmpty. Operand 1954 states and 5614 transitions. [2025-04-13 17:43:14,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:43:14,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:14,144 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:14,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2025-04-13 17:43:14,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:14,345 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:14,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1916877325, now seen corresponding path program 145 times [2025-04-13 17:43:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:14,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728345809] [2025-04-13 17:43:14,345 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:43:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:14,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:43:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:43:14,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:43:14,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 17:43:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:14,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728345809] [2025-04-13 17:43:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728345809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:14,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126956556] [2025-04-13 17:43:14,478 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:43:14,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:14,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:14,480 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:14,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-04-13 17:43:14,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:43:14,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:43:14,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:43:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:14,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:43:14,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 17:43:14,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 17:43:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126956556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:15,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2025-04-13 17:43:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909857944] [2025-04-13 17:43:15,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:15,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:43:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:15,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:43:15,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:43:15,131 INFO L87 Difference]: Start difference. First operand 1954 states and 5614 transitions. Second operand has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:22,364 INFO L93 Difference]: Finished difference Result 3597 states and 10028 transitions. [2025-04-13 17:43:22,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 17:43:22,365 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 17:43:22,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:22,370 INFO L225 Difference]: With dead ends: 3597 [2025-04-13 17:43:22,370 INFO L226 Difference]: Without dead ends: 1113 [2025-04-13 17:43:22,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=593, Invalid=2713, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:43:22,371 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 190 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:22,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 107 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:43:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-04-13 17:43:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 886. [2025-04-13 17:43:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 2.687005649717514) internal successors, (2378), 885 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2378 transitions. [2025-04-13 17:43:24,403 INFO L79 Accepts]: Start accepts. Automaton has 886 states and 2378 transitions. Word has length 35 [2025-04-13 17:43:24,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:24,403 INFO L485 AbstractCegarLoop]: Abstraction has 886 states and 2378 transitions. [2025-04-13 17:43:24,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:24,404 INFO L278 IsEmpty]: Start isEmpty. Operand 886 states and 2378 transitions. [2025-04-13 17:43:24,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 17:43:24,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:24,404 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:24,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2025-04-13 17:43:24,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:24,605 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:24,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:24,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1653564025, now seen corresponding path program 146 times [2025-04-13 17:43:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:24,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538898583] [2025-04-13 17:43:24,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:43:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:24,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 17:43:24,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:43:24,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:43:24,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:43:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:24,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538898583] [2025-04-13 17:43:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538898583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:24,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753591724] [2025-04-13 17:43:24,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:43:24,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:24,748 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:24,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2025-04-13 17:43:25,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 17:43:25,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:43:25,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:43:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:25,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:43:25,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:43:25,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 17:43:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753591724] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:25,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2025-04-13 17:43:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13710441] [2025-04-13 17:43:25,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:25,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:43:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:43:25,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:43:25,326 INFO L87 Difference]: Start difference. First operand 886 states and 2378 transitions. Second operand has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:28,903 INFO L93 Difference]: Finished difference Result 917 states and 2427 transitions. [2025-04-13 17:43:28,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:43:28,903 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 17:43:28,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:28,907 INFO L225 Difference]: With dead ends: 917 [2025-04-13 17:43:28,907 INFO L226 Difference]: Without dead ends: 677 [2025-04-13 17:43:28,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=796, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:43:28,907 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:28,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 70 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:43:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-04-13 17:43:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2025-04-13 17:43:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 2.8476331360946747) internal successors, (1925), 676 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1925 transitions. [2025-04-13 17:43:30,659 INFO L79 Accepts]: Start accepts. Automaton has 677 states and 1925 transitions. Word has length 36 [2025-04-13 17:43:30,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:30,659 INFO L485 AbstractCegarLoop]: Abstraction has 677 states and 1925 transitions. [2025-04-13 17:43:30,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:30,659 INFO L278 IsEmpty]: Start isEmpty. Operand 677 states and 1925 transitions. [2025-04-13 17:43:30,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:43:30,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:30,660 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:30,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Forceful destruction successful, exit code 0 [2025-04-13 17:43:30,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,150 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:30,860 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:30,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2000943356, now seen corresponding path program 147 times [2025-04-13 17:43:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:30,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151559135] [2025-04-13 17:43:30,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:43:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:30,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:30,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:30,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:43:30,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:43:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:31,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151559135] [2025-04-13 17:43:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151559135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:31,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606980380] [2025-04-13 17:43:31,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:43:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:31,412 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:31,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2025-04-13 17:43:31,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:31,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:31,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:43:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:31,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:43:31,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:43:32,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:32,317 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:43:32,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:43:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:43:32,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606980380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:32,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:32,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 19] total 46 [2025-04-13 17:43:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876037421] [2025-04-13 17:43:32,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:32,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 17:43:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:32,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 17:43:32,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:43:32,757 INFO L87 Difference]: Start difference. First operand 677 states and 1925 transitions. Second operand has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 46 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:43:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:37,190 INFO L93 Difference]: Finished difference Result 865 states and 2409 transitions. [2025-04-13 17:43:37,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:43:37,190 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 46 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 37 [2025-04-13 17:43:37,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:37,194 INFO L225 Difference]: With dead ends: 865 [2025-04-13 17:43:37,194 INFO L226 Difference]: Without dead ends: 857 [2025-04-13 17:43:37,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=381, Invalid=3909, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:43:37,195 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 123 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:37,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 170 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:43:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-04-13 17:43:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 679. [2025-04-13 17:43:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 2.855457227138643) internal successors, (1936), 678 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1936 transitions. [2025-04-13 17:43:39,001 INFO L79 Accepts]: Start accepts. Automaton has 679 states and 1936 transitions. Word has length 37 [2025-04-13 17:43:39,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:39,001 INFO L485 AbstractCegarLoop]: Abstraction has 679 states and 1936 transitions. [2025-04-13 17:43:39,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 46 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:43:39,001 INFO L278 IsEmpty]: Start isEmpty. Operand 679 states and 1936 transitions. [2025-04-13 17:43:39,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:43:39,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:39,002 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:39,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Forceful destruction successful, exit code 0 [2025-04-13 17:43:39,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,151 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:39,202 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:39,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1966632523, now seen corresponding path program 148 times [2025-04-13 17:43:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:39,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798228546] [2025-04-13 17:43:39,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:43:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:39,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:43:39,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:39,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:43:39,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:43:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:39,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798228546] [2025-04-13 17:43:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798228546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:39,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103201389] [2025-04-13 17:43:39,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:43:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:39,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:39,625 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:39,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2025-04-13 17:43:39,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:43:39,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:39,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:43:39,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:39,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:43:39,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:43:40,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:40,527 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:43:40,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:43:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:43:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103201389] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:40,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 39 [2025-04-13 17:43:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481778572] [2025-04-13 17:43:40,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:40,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:43:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:40,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:43:40,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1456, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:43:40,718 INFO L87 Difference]: Start difference. First operand 679 states and 1936 transitions. Second operand has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 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:43:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:45,618 INFO L93 Difference]: Finished difference Result 778 states and 2095 transitions. [2025-04-13 17:43:45,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:43:45,618 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 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) Word has length 37 [2025-04-13 17:43:45,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:45,622 INFO L225 Difference]: With dead ends: 778 [2025-04-13 17:43:45,622 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 17:43:45,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=298, Invalid=4394, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:43:45,622 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:45,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 220 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:43:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 17:43:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 695. [2025-04-13 17:43:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.792507204610951) internal successors, (1938), 694 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1938 transitions. [2025-04-13 17:43:47,484 INFO L79 Accepts]: Start accepts. Automaton has 695 states and 1938 transitions. Word has length 37 [2025-04-13 17:43:47,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:47,484 INFO L485 AbstractCegarLoop]: Abstraction has 695 states and 1938 transitions. [2025-04-13 17:43:47,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.825) internal successors, (73), 39 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:43:47,485 INFO L278 IsEmpty]: Start isEmpty. Operand 695 states and 1938 transitions. [2025-04-13 17:43:47,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:43:47,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:47,485 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:47,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Ended with exit code 0 [2025-04-13 17:43:47,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 17:43:47,686 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:47,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash 656546044, now seen corresponding path program 149 times [2025-04-13 17:43:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:47,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596715610] [2025-04-13 17:43:47,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:43:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:47,695 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:47,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:47,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:43:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:43:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:48,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596715610] [2025-04-13 17:43:48,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596715610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:48,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056068461] [2025-04-13 17:43:48,209 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:43:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:48,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:48,211 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:48,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-04-13 17:43:48,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:48,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:48,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:43:48,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:48,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:43:48,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:43:48,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:48,983 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:43:48,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:43:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:43:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056068461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:49,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 12] total 37 [2025-04-13 17:43:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413166483] [2025-04-13 17:43:49,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:49,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:43:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:49,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:43:49,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:43:49,162 INFO L87 Difference]: Start difference. First operand 695 states and 1938 transitions. Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 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:43:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:43:55,373 INFO L93 Difference]: Finished difference Result 919 states and 2546 transitions. [2025-04-13 17:43:55,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 17:43:55,373 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 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 37 [2025-04-13 17:43:55,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:43:55,377 INFO L225 Difference]: With dead ends: 919 [2025-04-13 17:43:55,377 INFO L226 Difference]: Without dead ends: 851 [2025-04-13 17:43:55,378 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=623, Invalid=7209, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 17:43:55,378 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 194 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:43:55,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 162 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:43:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-04-13 17:43:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 635. [2025-04-13 17:43:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 2.7917981072555205) internal successors, (1770), 634 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1770 transitions. [2025-04-13 17:43:57,117 INFO L79 Accepts]: Start accepts. Automaton has 635 states and 1770 transitions. Word has length 37 [2025-04-13 17:43:57,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:43:57,117 INFO L485 AbstractCegarLoop]: Abstraction has 635 states and 1770 transitions. [2025-04-13 17:43:57,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 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:43:57,117 INFO L278 IsEmpty]: Start isEmpty. Operand 635 states and 1770 transitions. [2025-04-13 17:43:57,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:43:57,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:43:57,118 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:43:57,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Ended with exit code 0 [2025-04-13 17:43:57,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 153 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2025-04-13 17:43:57,318 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:43:57,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:43:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash -113017287, now seen corresponding path program 150 times [2025-04-13 17:43:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:43:57,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879068645] [2025-04-13 17:43:57,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:43:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:43:57,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:57,342 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:57,342 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:43:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:43:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:43:58,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879068645] [2025-04-13 17:43:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879068645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:43:58,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284489649] [2025-04-13 17:43:58,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:43:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:43:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:43:58,238 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:43:58,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2025-04-13 17:43:58,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:43:58,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:43:58,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:43:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:43:58,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-13 17:43:58,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:43:59,200 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 15 treesize of output 1 [2025-04-13 17:43:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:43:59,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:00,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:00,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:44:00,821 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:44:00,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:44:00,878 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:44:00,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 190 [2025-04-13 17:44:01,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:01,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:44:01,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:44:01,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:44:01,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:01,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:44:01,063 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:01,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:44:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284489649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:01,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2025-04-13 17:44:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014881105] [2025-04-13 17:44:01,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:01,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-04-13 17:44:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:01,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-04-13 17:44:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=5790, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 17:44:01,824 INFO L87 Difference]: Start difference. First operand 635 states and 1770 transitions. Second operand has 80 states, 80 states have (on average 1.3125) internal successors, (105), 79 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:07,048 INFO L93 Difference]: Finished difference Result 753 states and 2051 transitions. [2025-04-13 17:44:07,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 17:44:07,048 INFO L79 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.3125) internal successors, (105), 79 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:44:07,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:07,052 INFO L225 Difference]: With dead ends: 753 [2025-04-13 17:44:07,053 INFO L226 Difference]: Without dead ends: 746 [2025-04-13 17:44:07,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=779, Invalid=8727, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 17:44:07,053 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 112 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:07,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 219 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:44:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-04-13 17:44:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 645. [2025-04-13 17:44:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 2.7872670807453415) internal successors, (1795), 644 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call 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:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1795 transitions. [2025-04-13 17:44:08,794 INFO L79 Accepts]: Start accepts. Automaton has 645 states and 1795 transitions. Word has length 37 [2025-04-13 17:44:08,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:08,794 INFO L485 AbstractCegarLoop]: Abstraction has 645 states and 1795 transitions. [2025-04-13 17:44:08,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.3125) internal successors, (105), 79 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:08,794 INFO L278 IsEmpty]: Start isEmpty. Operand 645 states and 1795 transitions. [2025-04-13 17:44:08,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:44:08,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:08,795 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:08,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Ended with exit code 0 [2025-04-13 17:44:08,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 154 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 17:44:08,995 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:44:08,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2130051660, now seen corresponding path program 151 times [2025-04-13 17:44:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:08,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633793102] [2025-04-13 17:44:08,996 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:44:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:44:09,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:09,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:09,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:09,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633793102] [2025-04-13 17:44:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633793102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:09,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490781] [2025-04-13 17:44:09,738 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:44:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:09,739 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-04-13 17:44:10,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:44:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:10,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:44:10,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:10,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:10,870 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:44:10,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:44:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:11,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 77 [2025-04-13 17:44:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754262633] [2025-04-13 17:44:11,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:11,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-13 17:44:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:11,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-13 17:44:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5451, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 17:44:11,806 INFO L87 Difference]: Start difference. First operand 645 states and 1795 transitions. Second operand has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:15,391 INFO L93 Difference]: Finished difference Result 669 states and 1844 transitions. [2025-04-13 17:44:15,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:44:15,391 INFO L79 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:44:15,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:15,394 INFO L225 Difference]: With dead ends: 669 [2025-04-13 17:44:15,394 INFO L226 Difference]: Without dead ends: 655 [2025-04-13 17:44:15,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=740, Invalid=6570, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:44:15,395 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:15,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:44:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-04-13 17:44:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-04-13 17:44:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 2.782874617737003) internal successors, (1820), 654 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call 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:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1820 transitions. [2025-04-13 17:44:17,135 INFO L79 Accepts]: Start accepts. Automaton has 655 states and 1820 transitions. Word has length 37 [2025-04-13 17:44:17,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:17,135 INFO L485 AbstractCegarLoop]: Abstraction has 655 states and 1820 transitions. [2025-04-13 17:44:17,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:17,135 INFO L278 IsEmpty]: Start isEmpty. Operand 655 states and 1820 transitions. [2025-04-13 17:44:17,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:44:17,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:17,135 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:17,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Ended with exit code 0 [2025-04-13 17:44:17,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158,155 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:17,336 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:44:17,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -412302600, now seen corresponding path program 152 times [2025-04-13 17:44:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:17,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852800803] [2025-04-13 17:44:17,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:17,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:44:17,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:17,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:17,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:18,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852800803] [2025-04-13 17:44:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852800803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:18,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656717215] [2025-04-13 17:44:18,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:18,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:18,208 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:18,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-04-13 17:44:18,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:44:18,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:18,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:18,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:18,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-13 17:44:18,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:18,729 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 15 treesize of output 1 [2025-04-13 17:44:18,812 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 8 treesize of output 1 [2025-04-13 17:44:18,856 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 8 treesize of output 1 [2025-04-13 17:44:18,904 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 8 treesize of output 1 [2025-04-13 17:44:18,952 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 8 treesize of output 1 [2025-04-13 17:44:18,999 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 8 treesize of output 1 [2025-04-13 17:44:19,045 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 15 treesize of output 1 [2025-04-13 17:44:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 1 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:19,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:20,691 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:44:20,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:44:20,723 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 17:44:20,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 17:44:20,778 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:44:20,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:44:22,278 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~i_AB~0 4)) (.cse17 (* c_~i_BA~0 4)) (.cse12 (= c_~i_BA~0 0))) (let ((.cse7 (not .cse12)) (.cse6 (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (= c_~i_AB~0 0)) (.cse4 (+ .cse17 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse17 20)) (.cse2 (+ 20 .cse16)) (.cse1 (+ 20 .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (and (forall ((v_arrayElimArr_37 (Array Int Int)) (v_subst_708 Int)) (let ((.cse0 (select (store |c_#memory_int#1| v_subst_708 v_arrayElimArr_37) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse0 .cse1) (select v_arrayElimArr_37 .cse2)) (not (= (select v_arrayElimArr_37 .cse3) (select .cse0 .cse4)))))) (or (forall ((v_arrayElimArr_37 (Array Int Int)) (v_subst_707 Int)) (let ((.cse5 (select (store |c_#memory_int#1| v_subst_707 v_arrayElimArr_37) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select v_arrayElimArr_37 20) (select .cse5 .cse6))) (= (select .cse5 .cse1) (select v_arrayElimArr_37 .cse2))))) .cse7)) .cse8) (or .cse7 (forall ((v_arrayElimArr_37 (Array Int Int)) (v_subst_709 Int)) (let ((.cse11 (select (store |c_#memory_int#1| v_subst_709 v_arrayElimArr_37) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse11 .cse1)) (.cse10 (select v_arrayElimArr_37 20))) (or (= .cse9 (select v_arrayElimArr_37 .cse2)) (= .cse9 .cse10) (not (= (select .cse11 .cse6) .cse10))))))) (or (and (or .cse12 (forall ((v_arrayElimArr_36 (Array Int Int)) (v_subst_705 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_705 v_arrayElimArr_36) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select v_arrayElimArr_36 .cse3))))) (or .cse7 (forall ((v_arrayElimArr_36 (Array Int Int)) (v_subst_706 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_706 v_arrayElimArr_36) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (select v_arrayElimArr_36 20)))))) (< c_~i_AB~0 1)) (or (and (or (forall ((v_arrayElimArr_38 (Array Int Int)) (v_subst_702 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_702 v_arrayElimArr_38) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select v_arrayElimArr_38 .cse3)))) .cse12) (or .cse7 (forall ((v_arrayElimArr_38 (Array Int Int)) (v_subst_703 Int)) (not (= (select v_arrayElimArr_38 20) (select (select (store |c_#memory_int#1| v_subst_703 v_arrayElimArr_38) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)))))) (< (+ c_~i_AB~0 5) c_~An~0)) (or (forall ((v_arrayElimArr_37 (Array Int Int)) (v_subst_704 Int)) (let ((.cse13 (select (store |c_#memory_int#1| v_subst_704 v_arrayElimArr_37) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse13 .cse6) (select v_arrayElimArr_37 20)) (not (= (select v_arrayElimArr_37 .cse3) (select .cse13 .cse4)))))) (not .cse8)) (forall ((v_subst_710 Int) (v_arrayElimArr_37 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int#1| v_subst_710 v_arrayElimArr_37) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse14 .cse1))) (or (not (= (select .cse14 .cse4) (select v_arrayElimArr_37 .cse3))) (= .cse15 (select v_arrayElimArr_37 .cse2)) (= .cse15 (select v_arrayElimArr_37 20))))))))) is different from false [2025-04-13 17:44:22,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:22,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 17:44:22,314 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:44:22,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 90 [2025-04-13 17:44:22,316 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:44:22,340 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-13 17:44:22,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 87 treesize of output 87 [2025-04-13 17:44:22,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:22,367 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 17:44:22,373 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:44:22,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-13 17:44:22,380 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:44:22,381 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:44:22,428 INFO L325 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2025-04-13 17:44:22,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2025-04-13 17:44:22,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:22,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:44:22,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:44:22,557 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:44:22,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 17:44:22,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:22,561 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:44:22,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:44:22,565 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 17:44:22,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:22,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:44:22,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:44:22,578 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 17:44:22,578 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-13 17:44:22,582 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 17:44:22,583 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 1 [2025-04-13 17:44:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 42 refuted. 4 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-13 17:44:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656717215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:23,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2025-04-13 17:44:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441413889] [2025-04-13 17:44:23,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:23,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-04-13 17:44:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:23,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-04-13 17:44:23,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=5808, Unknown=20, NotChecked=154, Total=6320 [2025-04-13 17:44:23,069 INFO L87 Difference]: Start difference. First operand 655 states and 1820 transitions. Second operand has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:33,003 INFO L93 Difference]: Finished difference Result 1205 states and 3221 transitions. [2025-04-13 17:44:33,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 17:44:33,003 INFO L79 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:44:33,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:33,007 INFO L225 Difference]: With dead ends: 1205 [2025-04-13 17:44:33,007 INFO L226 Difference]: Without dead ends: 1084 [2025-04-13 17:44:33,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=883, Invalid=16923, Unknown=20, NotChecked=264, Total=18090 [2025-04-13 17:44:33,009 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 254 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 5370 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 5688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:33,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 411 Invalid, 5688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5370 Invalid, 0 Unknown, 238 Unchecked, 2.5s Time] [2025-04-13 17:44:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-04-13 17:44:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 863. [2025-04-13 17:44:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 2.7633410672853826) internal successors, (2382), 862 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call 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:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 2382 transitions. [2025-04-13 17:44:35,061 INFO L79 Accepts]: Start accepts. Automaton has 863 states and 2382 transitions. Word has length 37 [2025-04-13 17:44:35,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:35,061 INFO L485 AbstractCegarLoop]: Abstraction has 863 states and 2382 transitions. [2025-04-13 17:44:35,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:35,061 INFO L278 IsEmpty]: Start isEmpty. Operand 863 states and 2382 transitions. [2025-04-13 17:44:35,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:44:35,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:35,062 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:35,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Ended with exit code 0 [2025-04-13 17:44:35,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,156 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:35,262 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:44:35,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash -356891340, now seen corresponding path program 153 times [2025-04-13 17:44:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:35,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228069334] [2025-04-13 17:44:35,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:35,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:44:35,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:35,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:44:35,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:44:35,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:35,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228069334] [2025-04-13 17:44:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228069334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:35,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090421000] [2025-04-13 17:44:35,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:35,845 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:35,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-04-13 17:44:36,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:44:36,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:36,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:44:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:36,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:44:36,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:37,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:37,175 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:44:37,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 17:44:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090421000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:38,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 26] total 71 [2025-04-13 17:44:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392393395] [2025-04-13 17:44:38,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:38,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-04-13 17:44:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:38,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-04-13 17:44:38,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=4711, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 17:44:38,170 INFO L87 Difference]: Start difference. First operand 863 states and 2382 transitions. Second operand has 72 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 71 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:42,527 INFO L93 Difference]: Finished difference Result 947 states and 2583 transitions. [2025-04-13 17:44:42,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:44:42,527 INFO L79 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 71 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:44:42,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:42,532 INFO L225 Difference]: With dead ends: 947 [2025-04-13 17:44:42,532 INFO L226 Difference]: Without dead ends: 939 [2025-04-13 17:44:42,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=700, Invalid=7310, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 17:44:42,532 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:42,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 210 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:44:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-04-13 17:44:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 851. [2025-04-13 17:44:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 2.7411764705882353) internal successors, (2330), 850 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call 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,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 2330 transitions. [2025-04-13 17:44:44,572 INFO L79 Accepts]: Start accepts. Automaton has 851 states and 2330 transitions. Word has length 37 [2025-04-13 17:44:44,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:44,572 INFO L485 AbstractCegarLoop]: Abstraction has 851 states and 2330 transitions. [2025-04-13 17:44:44,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 71 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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,573 INFO L278 IsEmpty]: Start isEmpty. Operand 851 states and 2330 transitions. [2025-04-13 17:44:44,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:44:44,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:44,573 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:44,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Ended with exit code 0 [2025-04-13 17:44:44,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,157 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:44,774 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:44:44,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash -442778793, now seen corresponding path program 154 times [2025-04-13 17:44:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:44,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142863845] [2025-04-13 17:44:44,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:44,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:44:44,791 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:44,791 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:44:44,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-04-13 17:44:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:45,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142863845] [2025-04-13 17:44:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142863845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:45,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954658023] [2025-04-13 17:44:45,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:45,026 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:45,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-04-13 17:44:45,330 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:44:45,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:45,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:44:45,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:45,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:44:45,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:44:45,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:45,854 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:44:45,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:44:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-04-13 17:44:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954658023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:45,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:45,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 8] total 36 [2025-04-13 17:44:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626747485] [2025-04-13 17:44:45,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:45,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:44:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:45,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:44:45,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:44:45,983 INFO L87 Difference]: Start difference. First operand 851 states and 2330 transitions. Second operand has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:51,324 INFO L93 Difference]: Finished difference Result 1033 states and 2716 transitions. [2025-04-13 17:44:51,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:44:51,324 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:44:51,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:51,328 INFO L225 Difference]: With dead ends: 1033 [2025-04-13 17:44:51,328 INFO L226 Difference]: Without dead ends: 1016 [2025-04-13 17:44:51,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:44:51,329 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 140 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:51,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 142 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:44:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-04-13 17:44:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 853. [2025-04-13 17:44:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 2.733568075117371) internal successors, (2329), 852 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call 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:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2329 transitions. [2025-04-13 17:44:53,379 INFO L79 Accepts]: Start accepts. Automaton has 853 states and 2329 transitions. Word has length 37 [2025-04-13 17:44:53,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:53,379 INFO L485 AbstractCegarLoop]: Abstraction has 853 states and 2329 transitions. [2025-04-13 17:44:53,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:53,380 INFO L278 IsEmpty]: Start isEmpty. Operand 853 states and 2329 transitions. [2025-04-13 17:44:53,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:44:53,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:53,380 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:53,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2025-04-13 17:44:53,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable161 [2025-04-13 17:44:53,581 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:44:53,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1220153653, now seen corresponding path program 155 times [2025-04-13 17:44:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:53,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227570136] [2025-04-13 17:44:53,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:53,591 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:44:53,600 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:53,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:44:53,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:44:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:53,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227570136] [2025-04-13 17:44:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227570136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:53,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061773209] [2025-04-13 17:44:53,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:53,984 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:53,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-04-13 17:44:54,270 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:44:54,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:44:54,409 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:44:54,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:54,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:44:54,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:44:54,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:54,897 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:44:54,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 53 treesize of output 75 [2025-04-13 17:44:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:44:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061773209] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:54,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 9] total 33 [2025-04-13 17:44:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409626147] [2025-04-13 17:44:54,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:54,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:44:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:44:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:44:54,935 INFO L87 Difference]: Start difference. First operand 853 states and 2329 transitions. Second operand has 34 states, 34 states have (on average 1.8529411764705883) 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:45:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:01,817 INFO L93 Difference]: Finished difference Result 1140 states and 2984 transitions. [2025-04-13 17:45:01,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:45:01,817 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8529411764705883) 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 37 [2025-04-13 17:45:01,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:01,822 INFO L225 Difference]: With dead ends: 1140 [2025-04-13 17:45:01,822 INFO L226 Difference]: Without dead ends: 1133 [2025-04-13 17:45:01,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:45:01,822 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:01,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 169 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:45:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-04-13 17:45:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 845. [2025-04-13 17:45:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 2.735781990521327) internal successors, (2309), 844 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call 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:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2309 transitions. [2025-04-13 17:45:03,860 INFO L79 Accepts]: Start accepts. Automaton has 845 states and 2309 transitions. Word has length 37 [2025-04-13 17:45:03,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:03,861 INFO L485 AbstractCegarLoop]: Abstraction has 845 states and 2309 transitions. [2025-04-13 17:45:03,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8529411764705883) 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:45:03,861 INFO L278 IsEmpty]: Start isEmpty. Operand 845 states and 2309 transitions. [2025-04-13 17:45:03,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:45:03,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:03,861 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:03,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:04,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,159 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:04,062 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:45:04,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1178369766, now seen corresponding path program 156 times [2025-04-13 17:45:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:04,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648086018] [2025-04-13 17:45:04,062 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:04,072 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:45:04,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:04,085 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:45:04,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:04,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648086018] [2025-04-13 17:45:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648086018] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:04,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551368300] [2025-04-13 17:45:04,604 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:04,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:04,606 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:04,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2025-04-13 17:45:04,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:45:04,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:04,928 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:45:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:45:04,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:05,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:05,941 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:45:05,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:45:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551368300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:06,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:06,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 26] total 72 [2025-04-13 17:45:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887453232] [2025-04-13 17:45:06,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:06,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-04-13 17:45:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:06,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-04-13 17:45:06,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4848, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:45:06,863 INFO L87 Difference]: Start difference. First operand 845 states and 2309 transitions. Second operand has 73 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:12,917 INFO L93 Difference]: Finished difference Result 1144 states and 3018 transitions. [2025-04-13 17:45:12,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 17:45:12,917 INFO L79 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:45:12,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:12,922 INFO L225 Difference]: With dead ends: 1144 [2025-04-13 17:45:12,922 INFO L226 Difference]: Without dead ends: 1118 [2025-04-13 17:45:12,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=739, Invalid=8767, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 17:45:12,922 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:12,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 224 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:45:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-04-13 17:45:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 877. [2025-04-13 17:45:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 2.752283105022831) internal successors, (2411), 876 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call 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,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2411 transitions. [2025-04-13 17:45:15,005 INFO L79 Accepts]: Start accepts. Automaton has 877 states and 2411 transitions. Word has length 37 [2025-04-13 17:45:15,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:15,005 INFO L485 AbstractCegarLoop]: Abstraction has 877 states and 2411 transitions. [2025-04-13 17:45:15,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:15,006 INFO L278 IsEmpty]: Start isEmpty. Operand 877 states and 2411 transitions. [2025-04-13 17:45:15,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:45:15,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:15,007 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:15,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2025-04-13 17:45:15,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,160 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:15,207 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:45:15,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash 532243542, now seen corresponding path program 157 times [2025-04-13 17:45:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:15,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878793949] [2025-04-13 17:45:15,208 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:45:15,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:15,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:15,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:15,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878793949] [2025-04-13 17:45:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878793949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:15,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359425740] [2025-04-13 17:45:15,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:15,979 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:15,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2025-04-13 17:45:16,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:45:16,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:16,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:16,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:16,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:45:16,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 32 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:17,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:17,165 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:45:17,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:45:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359425740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:18,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 77 [2025-04-13 17:45:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574327279] [2025-04-13 17:45:18,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:18,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-13 17:45:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:18,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-13 17:45:18,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=5451, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 17:45:18,150 INFO L87 Difference]: Start difference. First operand 877 states and 2411 transitions. Second operand has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:22,411 INFO L93 Difference]: Finished difference Result 902 states and 2455 transitions. [2025-04-13 17:45:22,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:45:22,411 INFO L79 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:45:22,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:22,416 INFO L225 Difference]: With dead ends: 902 [2025-04-13 17:45:22,416 INFO L226 Difference]: Without dead ends: 879 [2025-04-13 17:45:22,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=739, Invalid=6571, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:45:22,416 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:22,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 206 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:45:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-04-13 17:45:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2025-04-13 17:45:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 2.7494305239179955) internal successors, (2414), 878 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call 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:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 2414 transitions. [2025-04-13 17:45:24,483 INFO L79 Accepts]: Start accepts. Automaton has 879 states and 2414 transitions. Word has length 37 [2025-04-13 17:45:24,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:24,483 INFO L485 AbstractCegarLoop]: Abstraction has 879 states and 2414 transitions. [2025-04-13 17:45:24,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:24,483 INFO L278 IsEmpty]: Start isEmpty. Operand 879 states and 2414 transitions. [2025-04-13 17:45:24,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:45:24,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:24,484 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:24,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Ended with exit code 0 [2025-04-13 17:45:24,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,161 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:24,685 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:45:24,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2044974694, now seen corresponding path program 158 times [2025-04-13 17:45:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:24,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886796484] [2025-04-13 17:45:24,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:24,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:45:24,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:24,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:24,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:25,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886796484] [2025-04-13 17:45:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886796484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:25,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395530441] [2025-04-13 17:45:25,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:25,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:25,564 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:25,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2025-04-13 17:45:25,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:45:25,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:25,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:25,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:25,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-13 17:45:25,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:26,084 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 15 treesize of output 1 [2025-04-13 17:45:26,169 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 8 treesize of output 1 [2025-04-13 17:45:26,214 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 8 treesize of output 1 [2025-04-13 17:45:26,263 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 8 treesize of output 1 [2025-04-13 17:45:26,306 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 8 treesize of output 1 [2025-04-13 17:45:26,356 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 8 treesize of output 1 [2025-04-13 17:45:26,406 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 15 treesize of output 1 [2025-04-13 17:45:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:27,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:28,056 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:45:28,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:45:28,080 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 17:45:28,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 17:45:28,109 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 17:45:28,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 17:45:29,503 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~i_BA~0 4)) (.cse0 (= c_~i_BA~0 0)) (.cse15 (* c_~i_AB~0 4))) (let ((.cse3 (+ 20 .cse15)) (.cse2 (+ 20 .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (not .cse0)) (.cse4 (+ .cse14 20)) (.cse5 (+ .cse14 20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (and (or (forall ((v_arrayElimArr_48 (Array Int Int)) (v_subst_714 Int)) (let ((.cse1 (select (store |c_#memory_int#1| v_subst_714 v_arrayElimArr_48) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse1 .cse2) (select v_arrayElimArr_48 .cse3)) (not (= (select v_arrayElimArr_48 .cse4) (select .cse1 .cse5)))))) (= c_~i_AB~0 0)) (forall ((v_arrayElimArr_48 (Array Int Int)) (v_subst_713 Int)) (let ((.cse6 (select (store |c_#memory_int#1| v_subst_713 v_arrayElimArr_48) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse6 .cse2))) (or (not (= (select .cse6 .cse5) (select v_arrayElimArr_48 .cse4))) (= .cse7 (select v_arrayElimArr_48 20)) (= .cse7 (select v_arrayElimArr_48 .cse3)))))))) (or (and (or (forall ((v_arrayElimArr_47 (Array Int Int)) (v_subst_716 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_716 v_arrayElimArr_47) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8) (select v_arrayElimArr_47 20)))) .cse9) (or (forall ((v_arrayElimArr_47 (Array Int Int)) (v_subst_715 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_715 v_arrayElimArr_47) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) (select v_arrayElimArr_47 .cse4)))) .cse0)) (< (+ c_~i_AB~0 5) c_~An~0)) (or (and (forall ((v_arrayElimArr_48 (Array Int Int)) (v_subst_717 Int)) (let ((.cse10 (select (store |c_#memory_int#1| v_subst_717 v_arrayElimArr_48) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select v_arrayElimArr_48 20)) (.cse12 (select .cse10 .cse2))) (or (not (= (select .cse10 .cse8) .cse11)) (= .cse12 .cse11) (= .cse12 (select v_arrayElimArr_48 .cse3)))))) (forall ((v_arrayElimArr_48 (Array Int Int)) (v_subst_718 Int)) (let ((.cse13 (select (store |c_#memory_int#1| v_subst_718 v_arrayElimArr_48) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select v_arrayElimArr_48 .cse3) (select .cse13 .cse2)) (not (= (select .cse13 .cse8) (select v_arrayElimArr_48 20))))))) .cse9) (or (and (or (forall ((v_arrayElimArr_46 (Array Int Int)) (v_subst_712 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_712 v_arrayElimArr_46) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse8) (select v_arrayElimArr_46 20)))) .cse9) (or .cse0 (forall ((v_arrayElimArr_46 (Array Int Int)) (v_subst_711 Int)) (not (= (select v_arrayElimArr_46 .cse4) (select (select (store |c_#memory_int#1| v_subst_711 v_arrayElimArr_46) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5)))))) (< c_~i_AB~0 1))))) is different from false [2025-04-13 17:45:29,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,529 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 17:45:29,534 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:45:29,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 90 [2025-04-13 17:45:29,537 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:45:29,562 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-13 17:45:29,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 87 treesize of output 87 [2025-04-13 17:45:29,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,592 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:45:29,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:45:29,597 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:45:29,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 4 [2025-04-13 17:45:29,603 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,603 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 17:45:29,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 17:45:29,608 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 17:45:29,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 4 [2025-04-13 17:45:29,613 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,613 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 17:45:29,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-13 17:45:29,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,621 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-04-13 17:45:29,627 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:45:29,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 75 [2025-04-13 17:45:29,631 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:45:29,657 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 17:45:29,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 72 treesize of output 78 [2025-04-13 17:45:29,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,685 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 17:45:29,692 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:45:29,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-13 17:45:29,694 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 17:45:29,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 17:45:29,720 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 17:45:29,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 78 [2025-04-13 17:45:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 22 proven. 45 refuted. 4 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-13 17:45:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395530441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:30,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2025-04-13 17:45:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527566504] [2025-04-13 17:45:30,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:30,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-04-13 17:45:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:30,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-04-13 17:45:30,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=5812, Unknown=18, NotChecked=154, Total=6320 [2025-04-13 17:45:30,217 INFO L87 Difference]: Start difference. First operand 879 states and 2414 transitions. Second operand has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:41,089 INFO L93 Difference]: Finished difference Result 1621 states and 4313 transitions. [2025-04-13 17:45:41,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 17:45:41,089 INFO L79 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:45:41,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:41,094 INFO L225 Difference]: With dead ends: 1621 [2025-04-13 17:45:41,094 INFO L226 Difference]: Without dead ends: 1393 [2025-04-13 17:45:41,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3356 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=895, Invalid=17181, Unknown=18, NotChecked=266, Total=18360 [2025-04-13 17:45:41,095 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 301 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 5434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:41,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 349 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5101 Invalid, 0 Unknown, 253 Unchecked, 2.4s Time] [2025-04-13 17:45:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-04-13 17:45:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1055. [2025-04-13 17:45:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1054 states have (on average 2.7362428842504745) internal successors, (2884), 1054 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call 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:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2884 transitions. [2025-04-13 17:45:43,524 INFO L79 Accepts]: Start accepts. Automaton has 1055 states and 2884 transitions. Word has length 37 [2025-04-13 17:45:43,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:43,525 INFO L485 AbstractCegarLoop]: Abstraction has 1055 states and 2884 transitions. [2025-04-13 17:45:43,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:43,525 INFO L278 IsEmpty]: Start isEmpty. Operand 1055 states and 2884 transitions. [2025-04-13 17:45:43,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:45:43,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:43,526 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:43,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2025-04-13 17:45:43,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,162 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:43,727 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:45:43,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1989563434, now seen corresponding path program 159 times [2025-04-13 17:45:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:43,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474026257] [2025-04-13 17:45:43,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:43,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:45:43,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:43,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:45:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:44,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474026257] [2025-04-13 17:45:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474026257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:44,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904100315] [2025-04-13 17:45:44,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:44,300 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2025-04-13 17:45:44,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:45:44,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:44,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:45:44,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:44,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-13 17:45:44,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:45,152 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 15 treesize of output 1 [2025-04-13 17:45:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:45,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:46,477 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:46,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 17:45:46,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:46,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 17:45:46,514 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:46,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 17:45:46,549 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 17:45:46,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 17:45:46,586 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:45:46,586 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select 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 194 [2025-04-13 17:45:46,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:46,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 85 treesize of output 88 [2025-04-13 17:45:46,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 17:45:46,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-04-13 17:45:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:47,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904100315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:47,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:47,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 72 [2025-04-13 17:45:47,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466425081] [2025-04-13 17:45:47,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:47,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-04-13 17:45:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:47,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-04-13 17:45:47,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=4891, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:45:47,423 INFO L87 Difference]: Start difference. First operand 1055 states and 2884 transitions. Second operand has 73 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 72 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:52,906 INFO L93 Difference]: Finished difference Result 1139 states and 3087 transitions. [2025-04-13 17:45:52,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:45:52,906 INFO L79 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 72 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:45:52,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:52,911 INFO L225 Difference]: With dead ends: 1139 [2025-04-13 17:45:52,911 INFO L226 Difference]: Without dead ends: 1131 [2025-04-13 17:45:52,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=493, Invalid=6313, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 17:45:52,912 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 72 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:52,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:45:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-04-13 17:45:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1045. [2025-04-13 17:45:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 2.721264367816092) internal successors, (2841), 1044 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call 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:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 2841 transitions. [2025-04-13 17:45:55,299 INFO L79 Accepts]: Start accepts. Automaton has 1045 states and 2841 transitions. Word has length 37 [2025-04-13 17:45:55,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:55,300 INFO L485 AbstractCegarLoop]: Abstraction has 1045 states and 2841 transitions. [2025-04-13 17:45:55,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 72 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:55,300 INFO L278 IsEmpty]: Start isEmpty. Operand 1045 states and 2841 transitions. [2025-04-13 17:45:55,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:45:55,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:55,301 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:55,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:55,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 163 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2025-04-13 17:45:55,501 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:45:55,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2075450887, now seen corresponding path program 160 times [2025-04-13 17:45:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:55,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313225962] [2025-04-13 17:45:55,502 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:55,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:45:55,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:55,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-13 17:45:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:55,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313225962] [2025-04-13 17:45:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313225962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:55,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761032348] [2025-04-13 17:45:55,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:55,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:55,754 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:55,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2025-04-13 17:45:56,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:45:56,070 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:45:56,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:56,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:45:56,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:45:56,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:56,358 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 17:45:56,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 17:45:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-13 17:45:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761032348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:56,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 29 [2025-04-13 17:45:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746274317] [2025-04-13 17:45:56,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:56,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:45:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:56,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:45:56,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:45:56,498 INFO L87 Difference]: Start difference. First operand 1045 states and 2841 transitions. Second operand has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:02,817 INFO L93 Difference]: Finished difference Result 1287 states and 3365 transitions. [2025-04-13 17:46:02,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:46:02,817 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:02,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:02,822 INFO L225 Difference]: With dead ends: 1287 [2025-04-13 17:46:02,822 INFO L226 Difference]: Without dead ends: 1265 [2025-04-13 17:46:02,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1979, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:46:02,822 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 147 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:02,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 134 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:46:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-04-13 17:46:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1045. [2025-04-13 17:46:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 2.721264367816092) internal successors, (2841), 1044 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call 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:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 2841 transitions. [2025-04-13 17:46:05,132 INFO L79 Accepts]: Start accepts. Automaton has 1045 states and 2841 transitions. Word has length 37 [2025-04-13 17:46:05,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:05,132 INFO L485 AbstractCegarLoop]: Abstraction has 1045 states and 2841 transitions. [2025-04-13 17:46:05,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:05,132 INFO L278 IsEmpty]: Start isEmpty. Operand 1045 states and 2841 transitions. [2025-04-13 17:46:05,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:05,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:05,133 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:05,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:05,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167,164 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:05,333 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:46:05,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -412518441, now seen corresponding path program 161 times [2025-04-13 17:46:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:05,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314394172] [2025-04-13 17:46:05,334 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:05,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:46:05,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:05,354 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:46:05,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:05,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314394172] [2025-04-13 17:46:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314394172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:05,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642059369] [2025-04-13 17:46:05,984 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:05,986 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:46:05,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-04-13 17:46:06,293 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:46:06,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:06,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 17:46:06,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:06,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:46:06,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-13 17:46:07,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:07,157 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 17:46:07,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 17:46:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-04-13 17:46:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642059369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:07,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 9] total 45 [2025-04-13 17:46:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686921057] [2025-04-13 17:46:07,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:07,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 17:46:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:07,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 17:46:07,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:46:07,348 INFO L87 Difference]: Start difference. First operand 1045 states and 2841 transitions. Second operand has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:15,976 INFO L93 Difference]: Finished difference Result 1368 states and 3599 transitions. [2025-04-13 17:46:15,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:46:15,976 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:15,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:15,981 INFO L225 Difference]: With dead ends: 1368 [2025-04-13 17:46:15,981 INFO L226 Difference]: Without dead ends: 1352 [2025-04-13 17:46:15,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=439, Invalid=6041, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 17:46:15,982 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:15,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 184 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:46:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-04-13 17:46:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1031. [2025-04-13 17:46:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 2.704854368932039) internal successors, (2786), 1030 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call 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:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2786 transitions. [2025-04-13 17:46:18,373 INFO L79 Accepts]: Start accepts. Automaton has 1031 states and 2786 transitions. Word has length 37 [2025-04-13 17:46:18,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:18,373 INFO L485 AbstractCegarLoop]: Abstraction has 1031 states and 2786 transitions. [2025-04-13 17:46:18,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 45 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:18,374 INFO L278 IsEmpty]: Start isEmpty. Operand 1031 states and 2786 transitions. [2025-04-13 17:46:18,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:18,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:18,374 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:18,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2025-04-13 17:46:18,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2025-04-13 17:46:18,575 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:46:18,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash -401220167, now seen corresponding path program 162 times [2025-04-13 17:46:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:18,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385514236] [2025-04-13 17:46:18,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:18,585 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:46:18,599 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:18,600 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:46:18,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:19,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385514236] [2025-04-13 17:46:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385514236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:19,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55570499] [2025-04-13 17:46:19,440 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:19,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:19,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:19,442 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:46:19,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2025-04-13 17:46:19,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 17:46:19,811 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:19,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:46:19,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:19,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:46:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:20,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:20,893 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:46:20,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:46:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55570499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:21,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 75 [2025-04-13 17:46:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606441430] [2025-04-13 17:46:21,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:21,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-04-13 17:46:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-04-13 17:46:21,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=5157, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:46:21,885 INFO L87 Difference]: Start difference. First operand 1031 states and 2786 transitions. Second operand has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:30,124 INFO L93 Difference]: Finished difference Result 1309 states and 3461 transitions. [2025-04-13 17:46:30,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 17:46:30,124 INFO L79 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:30,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:30,130 INFO L225 Difference]: With dead ends: 1309 [2025-04-13 17:46:30,130 INFO L226 Difference]: Without dead ends: 1302 [2025-04-13 17:46:30,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=941, Invalid=9361, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 17:46:30,131 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:30,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 233 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:46:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-04-13 17:46:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1031. [2025-04-13 17:46:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 2.704854368932039) internal successors, (2786), 1030 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call 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:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2786 transitions. [2025-04-13 17:46:32,486 INFO L79 Accepts]: Start accepts. Automaton has 1031 states and 2786 transitions. Word has length 37 [2025-04-13 17:46:32,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:32,486 INFO L485 AbstractCegarLoop]: Abstraction has 1031 states and 2786 transitions. [2025-04-13 17:46:32,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:32,486 INFO L278 IsEmpty]: Start isEmpty. Operand 1031 states and 2786 transitions. [2025-04-13 17:46:32,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:32,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:32,487 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:32,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:32,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 17:46:32,687 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:46:32,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 772739543, now seen corresponding path program 163 times [2025-04-13 17:46:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:32,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774889787] [2025-04-13 17:46:32,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:32,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:46:32,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:32,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:32,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:33,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774889787] [2025-04-13 17:46:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774889787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:33,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710128655] [2025-04-13 17:46:33,426 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:33,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:33,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:33,428 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:46:33,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-04-13 17:46:33,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:46:33,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:33,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:33,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:33,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:46:33,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:34,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:34,676 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:46:34,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:46:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710128655] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:35,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 77 [2025-04-13 17:46:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106840635] [2025-04-13 17:46:35,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:35,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-04-13 17:46:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:35,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-04-13 17:46:35,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=558, Invalid=5448, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 17:46:35,631 INFO L87 Difference]: Start difference. First operand 1031 states and 2786 transitions. Second operand has 78 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 77 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:43,540 INFO L93 Difference]: Finished difference Result 1263 states and 3374 transitions. [2025-04-13 17:46:43,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:46:43,540 INFO L79 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 77 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:43,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:43,544 INFO L225 Difference]: With dead ends: 1263 [2025-04-13 17:46:43,544 INFO L226 Difference]: Without dead ends: 1256 [2025-04-13 17:46:43,545 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2511 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=786, Invalid=7770, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 17:46:43,545 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:43,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 198 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:46:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-04-13 17:46:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1035. [2025-04-13 17:46:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 2.7040618955512574) internal successors, (2796), 1034 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call 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:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 2796 transitions. [2025-04-13 17:46:45,901 INFO L79 Accepts]: Start accepts. Automaton has 1035 states and 2796 transitions. Word has length 37 [2025-04-13 17:46:45,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:45,902 INFO L485 AbstractCegarLoop]: Abstraction has 1035 states and 2796 transitions. [2025-04-13 17:46:45,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 77 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:45,902 INFO L278 IsEmpty]: Start isEmpty. Operand 1035 states and 2796 transitions. [2025-04-13 17:46:45,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:45,903 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:45,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Ended with exit code 0 [2025-04-13 17:46:46,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170,167 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:46,103 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:46:46,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2040196721, now seen corresponding path program 164 times [2025-04-13 17:46:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:46,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916529113] [2025-04-13 17:46:46,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:46,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:46:46,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:46,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:46,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916529113] [2025-04-13 17:46:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916529113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:46,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293456402] [2025-04-13 17:46:46,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:46,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:46,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:46,860 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:46:46,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2025-04-13 17:46:47,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:46:47,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:47,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:47,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:47,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 17:46:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:47,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:48,001 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:46:48,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 17:46:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293456402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:48,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:48,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 65 [2025-04-13 17:46:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319025474] [2025-04-13 17:46:48,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:48,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 17:46:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:48,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 17:46:48,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3818, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:46:48,903 INFO L87 Difference]: Start difference. First operand 1035 states and 2796 transitions. Second operand has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:57,405 INFO L93 Difference]: Finished difference Result 1327 states and 3543 transitions. [2025-04-13 17:46:57,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:46:57,406 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:57,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:57,410 INFO L225 Difference]: With dead ends: 1327 [2025-04-13 17:46:57,410 INFO L226 Difference]: Without dead ends: 1320 [2025-04-13 17:46:57,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=700, Invalid=6272, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 17:46:57,411 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:57,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 165 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:46:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-04-13 17:46:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1037. [2025-04-13 17:46:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 2.7036679536679538) internal successors, (2801), 1036 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call 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:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2801 transitions. [2025-04-13 17:46:59,769 INFO L79 Accepts]: Start accepts. Automaton has 1037 states and 2801 transitions. Word has length 37 [2025-04-13 17:46:59,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:59,770 INFO L485 AbstractCegarLoop]: Abstraction has 1037 states and 2801 transitions. [2025-04-13 17:46:59,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call 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:59,770 INFO L278 IsEmpty]: Start isEmpty. Operand 1037 states and 2801 transitions. [2025-04-13 17:46:59,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:59,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:59,771 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:59,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:59,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2025-04-13 17:46:59,971 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:46:59,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 557061783, now seen corresponding path program 165 times [2025-04-13 17:46:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:59,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617421892] [2025-04-13 17:46:59,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:59,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:47:00,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:47:00,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:47:00,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:00,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617421892] [2025-04-13 17:47:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617421892] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:00,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726459754] [2025-04-13 17:47:00,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:00,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:00,941 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:47:00,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2025-04-13 17:47:01,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 5 equivalence classes. [2025-04-13 17:47:01,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:47:01,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 17:47:01,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:01,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 17:47:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:02,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:02,474 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:47:02,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 53 treesize of output 90 [2025-04-13 17:47:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726459754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:03,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 75 [2025-04-13 17:47:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936227353] [2025-04-13 17:47:03,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:03,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-04-13 17:47:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:03,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-04-13 17:47:03,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=5187, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:47:03,580 INFO L87 Difference]: Start difference. First operand 1037 states and 2801 transitions. Second operand has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:14,327 INFO L93 Difference]: Finished difference Result 1449 states and 3842 transitions. [2025-04-13 17:47:14,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 17:47:14,327 INFO L79 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:47:14,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:14,332 INFO L225 Difference]: With dead ends: 1449 [2025-04-13 17:47:14,332 INFO L226 Difference]: Without dead ends: 1442 [2025-04-13 17:47:14,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=887, Invalid=11103, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 17:47:14,333 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 146 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:14,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 186 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:47:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. Received shutdown request... [2025-04-13 17:47:15,914 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:47:15,949 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:47:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1094. [2025-04-13 17:47:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 2.6935041171088745) internal successors, (2944), 1093 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call 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:16,819 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:47:16,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Ended with exit code 0 [2025-04-13 17:47:17,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172,169 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:17,020 WARN L610 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). [2025-04-13 17:47:17,021 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:47:17,021 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:47:17,023 INFO L422 BasicCegarLoop]: Path program histogram: [165, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:47:17,025 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:47:17,025 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:47:17,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:47:17 BasicIcfg [2025-04-13 17:47:17,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:47:17,027 INFO L158 Benchmark]: Toolchain (without parser) took 855032.29ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 118.5MB in the beginning and 927.6MB in the end (delta: -809.1MB). Peak memory consumption was 853.8MB. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.21ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 104.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.22ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 101.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: Boogie Preprocessor took 52.57ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: RCFGBuilder took 490.57ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 50.6MB in the end (delta: 49.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 INFO L158 Benchmark]: TraceAbstraction took 854229.66ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 50.6MB in the beginning and 927.6MB in the end (delta: -877.1MB). Peak memory consumption was 786.7MB. Max. memory is 8.0GB. [2025-04-13 17:47:17,027 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.21ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 104.2MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.22ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 101.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.57ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 490.57ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 50.6MB in the end (delta: 49.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 854229.66ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 50.6MB in the beginning and 927.6MB in the end (delta: -877.1MB). Peak memory consumption was 786.7MB. 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: 85]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - 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: 854.1s, OverallIterations: 173, TraceHistogramMax: 6, PathProgramHistogramMax: 165, EmptinessCheckTime: 0.1s, AutomataDifference: 455.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19143 SdHoareTripleChecker+Valid, 87.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19143 mSDsluCounter, 19148 SdHoareTripleChecker+Invalid, 76.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 595 IncrementalHoareTripleChecker+Unchecked, 18167 mSDsCounter, 2489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222189 IncrementalHoareTripleChecker+Invalid, 225273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2489 mSolverCounterUnsat, 981 mSDtfsCounter, 222189 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15121 GetRequests, 5869 SyntacticMatches, 26 SemanticMatches, 9226 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 162360 ImplicationChecksByTransitivity, 217.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2672occurred in iteration=151, InterpolantAutomatonStates: 4964, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 116.5s AutomataMinimizationTime, 173 MinimizatonAttempts, 24540 StatesRemovedByMinimization, 148 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 212.7s InterpolantComputationTime, 10074 NumberOfCodeBlocks, 10056 NumberOfCodeBlocksAsserted, 899 NumberOfCheckSat, 14564 ConstructedInterpolants, 322 QuantifiedInterpolants, 219445 SizeOfPredicates, 1297 NumberOfNonLiveVariables, 43986 ConjunctsInSsa, 6097 ConjunctsInUnsatCore, 509 InterpolantComputations, 6 PerfectInterpolantSequences, 9060/21990 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 [2025-04-13 17:47:17,036 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Exception during sending of exit command (exit): Stream Closed Completed graceful shutdown