/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/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:06:14,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:06:14,928 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:06:14,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:06:14,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:06:14,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:06:14,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:06:14,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:06:14,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:06:14,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:06:14,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:06:14,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:06:14,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:06:14,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:06:14,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:14,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:14,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:14,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:06:14,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:06:14,960 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:06:15,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:06:15,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:06:15,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:06:15,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:06:15,216 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:06:15,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 17:06:16,616 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0789854f5/84e1b2481d224335b4a9e6831b45b96f/FLAG37a34007e [2025-04-13 17:06:16,875 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:06:16,875 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 17:06:16,889 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0789854f5/84e1b2481d224335b4a9e6831b45b96f/FLAG37a34007e [2025-04-13 17:06:17,618 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0789854f5/84e1b2481d224335b4a9e6831b45b96f [2025-04-13 17:06:17,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:06:17,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:06:17,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:17,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:06:17,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:06:17,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:17" (1/1) ... [2025-04-13 17:06:17,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442c0645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:17, skipping insertion in model container [2025-04-13 17:06:17,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:17" (1/1) ... [2025-04-13 17:06:17,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:06:17,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2025-04-13 17:06:17,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:17,966 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:06:18,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2025-04-13 17:06:18,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:18,100 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:06:18,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18 WrapperNode [2025-04-13 17:06:18,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:18,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:18,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:06:18,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:06:18,105 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:06:18" (1/1) ... [2025-04-13 17:06:18,140 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:06:18" (1/1) ... [2025-04-13 17:06:18,208 INFO L138 Inliner]: procedures = 277, calls = 830, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 939 [2025-04-13 17:06:18,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:18,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:06:18,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:06:18,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:06:18,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,272 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 17:06:18,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:06:18,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:06:18,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:06:18,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:06:18,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (1/1) ... [2025-04-13 17:06:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:18,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:18,356 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:06:18,358 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:06:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:06:18,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:06:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:06:18,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:06:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:06:18,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:06:18,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:06:18,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:06:18,376 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:06:18,480 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:06:18,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:06:19,361 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:06:19,362 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:06:19,362 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:06:30,576 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:30,581 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:30,583 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:06:30,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:30 BoogieIcfgContainer [2025-04-13 17:06:30,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:06:30,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:06:30,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:06:30,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:06:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:06:17" (1/3) ... [2025-04-13 17:06:30,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362874ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:30, skipping insertion in model container [2025-04-13 17:06:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:18" (2/3) ... [2025-04-13 17:06:30,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362874ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:30, skipping insertion in model container [2025-04-13 17:06:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:30" (3/3) ... [2025-04-13 17:06:30,593 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-04-13 17:06:30,605 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:06:30,607 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 17:06:30,607 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:06:30,676 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:06:30,701 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 17:06:30,722 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:30,740 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:06:30,748 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;@1023dbc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:06:30,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:06:30,751 INFO L278 IsEmpty]: Start isEmpty. Operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:30,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:06:30,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:30,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:06:30,756 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:30,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1901818711, now seen corresponding path program 1 times [2025-04-13 17:06:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:30,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174102682] [2025-04-13 17:06:30,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:30,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:06:30,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:06:30,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:30,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:31,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174102682] [2025-04-13 17:06:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174102682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:31,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:06:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131530833] [2025-04-13 17:06:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:31,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:06:31,424 INFO L87 Difference]: Start difference. First operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:31,538 INFO L93 Difference]: Finished difference Result 200 states and 488 transitions. [2025-04-13 17:06:31,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:31,539 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 17:06:31,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:31,546 INFO L225 Difference]: With dead ends: 200 [2025-04-13 17:06:31,546 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 17:06:31,551 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:06:31,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:31,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 17:06:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-13 17:06:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 2.4468085106382977) internal successors, (345), 143 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 345 transitions. [2025-04-13 17:06:31,593 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 345 transitions. Word has length 5 [2025-04-13 17:06:31,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:31,593 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 345 transitions. [2025-04-13 17:06:31,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:31,593 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 345 transitions. [2025-04-13 17:06:31,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:06:31,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:31,594 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:31,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:06:31,594 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:31,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1461569350, now seen corresponding path program 1 times [2025-04-13 17:06:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:31,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857641518] [2025-04-13 17:06:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:31,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:06:31,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:06:31,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:31,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857641518] [2025-04-13 17:06:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857641518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:31,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117924577] [2025-04-13 17:06:31,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:31,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:31,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:31,989 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:06:31,991 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:06:32,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:06:32,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:06:32,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:32,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:32,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:06:32,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:32,328 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:06:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:32,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:32,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117924577] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:32,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:32,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 17:06:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009217798] [2025-04-13 17:06:32,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:32,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:06:32,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:32,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:06:32,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:06:32,395 INFO L87 Difference]: Start difference. First operand 144 states and 345 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:32,589 INFO L93 Difference]: Finished difference Result 561 states and 1392 transitions. [2025-04-13 17:06:32,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:32,589 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-13 17:06:32,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:32,592 INFO L225 Difference]: With dead ends: 561 [2025-04-13 17:06:32,592 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 17:06:32,593 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:06:32,593 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:32,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 17:06:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 429. [2025-04-13 17:06:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 426 states have (on average 2.5539906103286385) internal successors, (1088), 428 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1088 transitions. [2025-04-13 17:06:32,621 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1088 transitions. Word has length 9 [2025-04-13 17:06:32,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:32,621 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1088 transitions. [2025-04-13 17:06:32,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:32,621 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1088 transitions. [2025-04-13 17:06:32,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:32,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:32,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:32,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:06:32,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:32,826 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:32,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash 102686500, now seen corresponding path program 1 times [2025-04-13 17:06:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:32,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75173984] [2025-04-13 17:06:32,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:32,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:32,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:32,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:32,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:33,102 INFO L134 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:06:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:33,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75173984] [2025-04-13 17:06:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75173984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:06:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538444434] [2025-04-13 17:06:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:33,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:06:33,104 INFO L87 Difference]: Start difference. First operand 429 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:33,175 INFO L93 Difference]: Finished difference Result 639 states and 1647 transitions. [2025-04-13 17:06:33,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:33,177 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 17:06:33,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:33,179 INFO L225 Difference]: With dead ends: 639 [2025-04-13 17:06:33,179 INFO L226 Difference]: Without dead ends: 312 [2025-04-13 17:06:33,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:06:33,180 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:33,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-13 17:06:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 296. [2025-04-13 17:06:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 292 states have (on average 2.4315068493150687) internal successors, (710), 295 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 710 transitions. [2025-04-13 17:06:33,196 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 710 transitions. Word has length 10 [2025-04-13 17:06:33,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:33,197 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 710 transitions. [2025-04-13 17:06:33,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:33,197 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 710 transitions. [2025-04-13 17:06:33,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:06:33,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:33,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:33,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:06:33,197 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:33,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1111775140, now seen corresponding path program 1 times [2025-04-13 17:06:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:33,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011323829] [2025-04-13 17:06:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:06:33,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:06:33,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:34,135 INFO L134 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:06:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:34,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011323829] [2025-04-13 17:06:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011323829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:06:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352671927] [2025-04-13 17:06:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:34,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:06:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:34,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:06:34,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:06:34,136 INFO L87 Difference]: Start difference. First operand 296 states and 710 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:34,233 INFO L93 Difference]: Finished difference Result 382 states and 900 transitions. [2025-04-13 17:06:34,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:06:34,235 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 17:06:34,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:34,238 INFO L225 Difference]: With dead ends: 382 [2025-04-13 17:06:34,238 INFO L226 Difference]: Without dead ends: 361 [2025-04-13 17:06:34,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:06:34,241 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:34,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-13 17:06:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 315. [2025-04-13 17:06:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 2.446945337620579) internal successors, (761), 314 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 761 transitions. [2025-04-13 17:06:34,261 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 761 transitions. Word has length 11 [2025-04-13 17:06:34,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:34,261 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 761 transitions. [2025-04-13 17:06:34,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:34,262 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 761 transitions. [2025-04-13 17:06:34,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:06:34,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:34,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:34,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:06:34,264 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:34,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 948073535, now seen corresponding path program 1 times [2025-04-13 17:06:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:34,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792228194] [2025-04-13 17:06:34,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:34,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:06:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:06:34,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:35,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792228194] [2025-04-13 17:06:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792228194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:35,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723006950] [2025-04-13 17:06:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:35,314 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:06:35,316 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:06:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:06:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:06:35,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:35,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:06:35,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:35,690 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 25 treesize of output 1 [2025-04-13 17:06:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:35,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:06:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723006950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:06:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 17:06:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029076014] [2025-04-13 17:06:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:35,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:06:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:06:35,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:35,747 INFO L87 Difference]: Start difference. First operand 315 states and 761 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:06:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:35,826 INFO L93 Difference]: Finished difference Result 363 states and 869 transitions. [2025-04-13 17:06:35,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:06:35,827 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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 15 [2025-04-13 17:06:35,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:35,829 INFO L225 Difference]: With dead ends: 363 [2025-04-13 17:06:35,832 INFO L226 Difference]: Without dead ends: 347 [2025-04-13 17:06:35,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:35,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:35,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-13 17:06:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 299. [2025-04-13 17:06:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 295 states have (on average 2.4237288135593222) internal successors, (715), 298 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:06:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 715 transitions. [2025-04-13 17:06:35,845 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 715 transitions. Word has length 15 [2025-04-13 17:06:35,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:35,846 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 715 transitions. [2025-04-13 17:06:35,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:06:35,846 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 715 transitions. [2025-04-13 17:06:35,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:06:35,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:35,849 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:35,861 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:06:36,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:36,050 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:36,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 603944896, now seen corresponding path program 1 times [2025-04-13 17:06:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:36,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919267421] [2025-04-13 17:06:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:36,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:36,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:36,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:36,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:36,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:36,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919267421] [2025-04-13 17:06:36,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919267421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:36,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692468272] [2025-04-13 17:06:36,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:36,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:36,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:36,535 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:06:36,536 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:06:36,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:36,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:36,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:36,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:06:36,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:36,841 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:06:36,864 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:06:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:37,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:06:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692468272] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:06:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 17:06:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897738460] [2025-04-13 17:06:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:37,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:06:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:37,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:06:37,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:06:37,198 INFO L87 Difference]: Start difference. First operand 299 states and 715 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:37,327 INFO L93 Difference]: Finished difference Result 403 states and 960 transitions. [2025-04-13 17:06:37,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:06:37,327 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:06:37,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:37,330 INFO L225 Difference]: With dead ends: 403 [2025-04-13 17:06:37,330 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 17:06:37,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:06:37,331 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:37,331 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 17:06:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 301. [2025-04-13 17:06:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 297 states have (on average 2.451178451178451) internal successors, (728), 300 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 728 transitions. [2025-04-13 17:06:37,342 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 728 transitions. Word has length 19 [2025-04-13 17:06:37,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:37,342 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 728 transitions. [2025-04-13 17:06:37,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:37,343 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 728 transitions. [2025-04-13 17:06:37,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:06:37,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:37,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:37,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:06:37,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:37,544 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:37,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1856878686, now seen corresponding path program 1 times [2025-04-13 17:06:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:37,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828341690] [2025-04-13 17:06:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:37,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:37,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:37,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:37,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:38,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828341690] [2025-04-13 17:06:38,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828341690] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:38,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715708819] [2025-04-13 17:06:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:38,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:38,517 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:06:38,518 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:06:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:06:38,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:06:38,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:06:38,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 17:06:38,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 50 [2025-04-13 17:06:38,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-04-13 17:06:38,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:06:38,909 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2025-04-13 17:06:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:39,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715708819] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:39,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-13 17:06:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063161061] [2025-04-13 17:06:39,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:39,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:06:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:39,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:06:39,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:06:39,411 INFO L87 Difference]: Start difference. First operand 301 states and 728 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 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:06:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:39,801 INFO L93 Difference]: Finished difference Result 662 states and 1580 transitions. [2025-04-13 17:06:39,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:06:39,802 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 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 19 [2025-04-13 17:06:39,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:39,805 INFO L225 Difference]: With dead ends: 662 [2025-04-13 17:06:39,805 INFO L226 Difference]: Without dead ends: 602 [2025-04-13 17:06:39,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:06:39,806 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:39,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-04-13 17:06:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 409. [2025-04-13 17:06:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 2.4790123456790125) internal successors, (1004), 408 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1004 transitions. [2025-04-13 17:06:39,818 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 1004 transitions. Word has length 19 [2025-04-13 17:06:39,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:39,819 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 1004 transitions. [2025-04-13 17:06:39,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 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:06:39,819 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 1004 transitions. [2025-04-13 17:06:39,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:06:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:39,819 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 17:06:39,830 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:06:40,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,020 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:40,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 193794019, now seen corresponding path program 2 times [2025-04-13 17:06:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:40,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571957679] [2025-04-13 17:06:40,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:40,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:06:40,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:06:40,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:40,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571957679] [2025-04-13 17:06:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571957679] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:40,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487910102] [2025-04-13 17:06:40,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:40,374 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:06:40,376 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:06:40,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 17:06:40,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:06:40,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:06:40,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:40,629 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:06:40,664 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:06:40,689 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:06:40,715 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:06:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487910102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:40,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 17:06:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484212769] [2025-04-13 17:06:40,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:40,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:06:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:40,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:06:40,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:06:40,803 INFO L87 Difference]: Start difference. First operand 409 states and 1004 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 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:06:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:41,345 INFO L93 Difference]: Finished difference Result 2398 states and 5895 transitions. [2025-04-13 17:06:41,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:06:41,345 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 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 21 [2025-04-13 17:06:41,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:41,354 INFO L225 Difference]: With dead ends: 2398 [2025-04-13 17:06:41,355 INFO L226 Difference]: Without dead ends: 2330 [2025-04-13 17:06:41,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=353, Invalid=517, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:06:41,356 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 551 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:41,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 0 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-04-13 17:06:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 1359. [2025-04-13 17:06:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1355 states have (on average 2.6125461254612548) internal successors, (3540), 1358 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 3540 transitions. [2025-04-13 17:06:41,404 INFO L79 Accepts]: Start accepts. Automaton has 1359 states and 3540 transitions. Word has length 21 [2025-04-13 17:06:41,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:41,405 INFO L485 AbstractCegarLoop]: Abstraction has 1359 states and 3540 transitions. [2025-04-13 17:06:41,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 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:06:41,405 INFO L278 IsEmpty]: Start isEmpty. Operand 1359 states and 3540 transitions. [2025-04-13 17:06:41,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:06:41,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:41,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:41,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 17:06:41,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:41,607 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:41,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1938866408, now seen corresponding path program 2 times [2025-04-13 17:06:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:41,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826924339] [2025-04-13 17:06:41,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:41,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:06:41,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:06:41,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:41,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826924339] [2025-04-13 17:06:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826924339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:42,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886131361] [2025-04-13 17:06:42,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:42,968 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:06:42,970 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:06:43,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:06:43,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:06:43,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:43,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1815 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:06:43,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:43,304 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:06:43,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 50 [2025-04-13 17:06:43,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-04-13 17:06:43,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-13 17:06:43,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 48 [2025-04-13 17:06:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:43,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886131361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:44,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-04-13 17:06:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464313136] [2025-04-13 17:06:44,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:44,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 17:06:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 17:06:44,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:06:44,322 INFO L87 Difference]: Start difference. First operand 1359 states and 3540 transitions. Second operand has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 18 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:06:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:45,022 INFO L93 Difference]: Finished difference Result 2339 states and 5864 transitions. [2025-04-13 17:06:45,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:06:45,023 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 18 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 27 [2025-04-13 17:06:45,023 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:45,033 INFO L225 Difference]: With dead ends: 2339 [2025-04-13 17:06:45,033 INFO L226 Difference]: Without dead ends: 2219 [2025-04-13 17:06:45,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:06:45,037 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:45,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:06:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2025-04-13 17:06:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 1357. [2025-04-13 17:06:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1353 states have (on average 2.608277900960828) internal successors, (3529), 1356 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 3529 transitions. [2025-04-13 17:06:45,075 INFO L79 Accepts]: Start accepts. Automaton has 1357 states and 3529 transitions. Word has length 27 [2025-04-13 17:06:45,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:45,077 INFO L485 AbstractCegarLoop]: Abstraction has 1357 states and 3529 transitions. [2025-04-13 17:06:45,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.764705882352941) internal successors, (81), 18 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:06:45,077 INFO L278 IsEmpty]: Start isEmpty. Operand 1357 states and 3529 transitions. [2025-04-13 17:06:45,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:06:45,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:45,078 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:45,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:45,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:45,279 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:45,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -585068634, now seen corresponding path program 1 times [2025-04-13 17:06:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:45,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331710355] [2025-04-13 17:06:45,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:45,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:06:45,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:45,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:45,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:45,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331710355] [2025-04-13 17:06:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331710355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:45,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231171092] [2025-04-13 17:06:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:45,795 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:06:45,796 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:06:45,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:06:46,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:46,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:46,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:46,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:06:46,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:46,051 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:06:46,076 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:06:46,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 8 treesize of output 1 [2025-04-13 17:06:46,198 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:06:46,220 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:06:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:46,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:06:46,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231171092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:46,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:46,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 19 [2025-04-13 17:06:46,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600555412] [2025-04-13 17:06:46,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:46,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 17:06:46,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:46,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 17:06:46,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:06:46,660 INFO L87 Difference]: Start difference. First operand 1357 states and 3529 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:47,337 INFO L93 Difference]: Finished difference Result 4006 states and 10328 transitions. [2025-04-13 17:06:47,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:06:47,339 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:06:47,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:47,377 INFO L225 Difference]: With dead ends: 4006 [2025-04-13 17:06:47,377 INFO L226 Difference]: Without dead ends: 3930 [2025-04-13 17:06:47,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:06:47,383 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:47,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:06:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2025-04-13 17:06:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 2155. [2025-04-13 17:06:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2151 states have (on average 2.703858670385867) internal successors, (5816), 2154 states have internal predecessors, (5816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 5816 transitions. [2025-04-13 17:06:47,464 INFO L79 Accepts]: Start accepts. Automaton has 2155 states and 5816 transitions. Word has length 35 [2025-04-13 17:06:47,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:47,464 INFO L485 AbstractCegarLoop]: Abstraction has 2155 states and 5816 transitions. [2025-04-13 17:06:47,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:47,464 INFO L278 IsEmpty]: Start isEmpty. Operand 2155 states and 5816 transitions. [2025-04-13 17:06:47,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:06:47,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:47,466 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:47,493 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:06:47,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:47,670 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:47,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1614998482, now seen corresponding path program 3 times [2025-04-13 17:06:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:47,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319285709] [2025-04-13 17:06:47,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:47,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:06:48,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:48,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:06:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:49,648 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:06:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:49,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319285709] [2025-04-13 17:06:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319285709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:49,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377195600] [2025-04-13 17:06:49,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:49,650 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:06:49,652 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:06:49,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 17:06:50,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:06:50,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:06:50,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:50,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 17:06:50,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:50,166 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:06:50,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-04-13 17:06:50,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-04-13 17:06:50,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2025-04-13 17:06:50,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 83 [2025-04-13 17:06:50,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-04-13 17:06:50,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 70 [2025-04-13 17:06:50,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 209 treesize of output 157 [2025-04-13 17:06:50,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2025-04-13 17:06:50,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 128 [2025-04-13 17:06:54,277 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:06:54,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:55,186 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:06:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377195600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:55,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-13 17:06:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533176771] [2025-04-13 17:06:55,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:55,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:06:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:06:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:06:55,188 INFO L87 Difference]: Start difference. First operand 2155 states and 5816 transitions. Second operand has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:56,655 INFO L93 Difference]: Finished difference Result 3630 states and 9287 transitions. [2025-04-13 17:06:56,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:06:56,656 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:06:56,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:56,671 INFO L225 Difference]: With dead ends: 3630 [2025-04-13 17:06:56,671 INFO L226 Difference]: Without dead ends: 3423 [2025-04-13 17:06:56,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=1086, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:06:56,673 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:56,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:06:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2025-04-13 17:06:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 1997. [2025-04-13 17:06:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1993 states have (on average 2.6859006522829905) internal successors, (5353), 1996 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 5353 transitions. [2025-04-13 17:06:56,740 INFO L79 Accepts]: Start accepts. Automaton has 1997 states and 5353 transitions. Word has length 35 [2025-04-13 17:06:56,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:56,741 INFO L485 AbstractCegarLoop]: Abstraction has 1997 states and 5353 transitions. [2025-04-13 17:06:56,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:56,741 INFO L278 IsEmpty]: Start isEmpty. Operand 1997 states and 5353 transitions. [2025-04-13 17:06:56,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 17:06:56,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:56,743 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:56,754 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:06:56,944 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,SelfDestructingSolverStorable10 [2025-04-13 17:06:56,944 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:56,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2142534726, now seen corresponding path program 2 times [2025-04-13 17:06:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:56,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948493359] [2025-04-13 17:06:56,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:56,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:57,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:57,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:57,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:57,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948493359] [2025-04-13 17:06:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948493359] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:57,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077745668] [2025-04-13 17:06:57,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:57,891 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:06:57,891 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:06:57,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:06:58,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:06:58,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:58,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:06:58,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:58,159 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:06:58,173 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:06:58,188 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:06:58,205 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:06:58,224 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:06:58,244 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:06:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:58,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:06:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077745668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:58,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 24 [2025-04-13 17:06:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612841409] [2025-04-13 17:06:58,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:58,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:06:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:06:58,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:06:58,709 INFO L87 Difference]: Start difference. First operand 1997 states and 5353 transitions. Second operand has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 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:06:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:59,631 INFO L93 Difference]: Finished difference Result 6013 states and 15668 transitions. [2025-04-13 17:06:59,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:06:59,632 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 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) Word has length 43 [2025-04-13 17:06:59,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:59,661 INFO L225 Difference]: With dead ends: 6013 [2025-04-13 17:06:59,661 INFO L226 Difference]: Without dead ends: 5916 [2025-04-13 17:06:59,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:06:59,664 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 490 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:59,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 0 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:06:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2025-04-13 17:06:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 2393. [2025-04-13 17:06:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2389 states have (on average 2.69945583926329) internal successors, (6449), 2392 states have internal predecessors, (6449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 6449 transitions. [2025-04-13 17:06:59,736 INFO L79 Accepts]: Start accepts. Automaton has 2393 states and 6449 transitions. Word has length 43 [2025-04-13 17:06:59,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:59,736 INFO L485 AbstractCegarLoop]: Abstraction has 2393 states and 6449 transitions. [2025-04-13 17:06:59,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 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:06:59,736 INFO L278 IsEmpty]: Start isEmpty. Operand 2393 states and 6449 transitions. [2025-04-13 17:06:59,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 17:06:59,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:59,739 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:59,748 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:06:59,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:59,939 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:06:59,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -887275148, now seen corresponding path program 4 times [2025-04-13 17:06:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:59,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21151201] [2025-04-13 17:06:59,940 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:59,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:07:00,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:07:00,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:07:00,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:01,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21151201] [2025-04-13 17:07:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21151201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:01,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214106110] [2025-04-13 17:07:01,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:07:01,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:01,933 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:07:01,935 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:07:02,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 17:07:02,190 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 17:07:02,190 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:07:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:02,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:07:02,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:02,233 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:07:02,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 64 [2025-04-13 17:07:02,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 90 [2025-04-13 17:07:02,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 28 [2025-04-13 17:07:02,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 159 treesize of output 131 [2025-04-13 17:07:02,462 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:02,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 135 [2025-04-13 17:07:02,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 99 [2025-04-13 17:07:02,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 317 treesize of output 265 [2025-04-13 17:07:02,875 INFO L325 Elim1Store]: treesize reduction 186, result has 14.3 percent of original size [2025-04-13 17:07:02,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 265 treesize of output 175 [2025-04-13 17:07:02,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 17:07:02,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 187 [2025-04-13 17:07:03,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 635 treesize of output 535 [2025-04-13 17:07:03,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:03,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 329 [2025-04-13 17:07:03,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 374 [2025-04-13 17:07:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:14,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214106110] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:15,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 17:07:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447701619] [2025-04-13 17:07:15,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:15,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:07:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:15,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:07:15,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:07:15,035 INFO L87 Difference]: Start difference. First operand 2393 states and 6449 transitions. Second operand has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:24,025 INFO L93 Difference]: Finished difference Result 12563 states and 31459 transitions. [2025-04-13 17:07:24,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 17:07:24,025 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 17:07:24,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:24,058 INFO L225 Difference]: With dead ends: 12563 [2025-04-13 17:07:24,058 INFO L226 Difference]: Without dead ends: 11867 [2025-04-13 17:07:24,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1819, Invalid=6191, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 17:07:24,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 984 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:24,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 0 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 17:07:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2025-04-13 17:07:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 4051. [2025-04-13 17:07:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 4047 states have (on average 2.8505065480602916) internal successors, (11536), 4050 states have internal predecessors, (11536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 11536 transitions. [2025-04-13 17:07:24,204 INFO L79 Accepts]: Start accepts. Automaton has 4051 states and 11536 transitions. Word has length 43 [2025-04-13 17:07:24,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:24,205 INFO L485 AbstractCegarLoop]: Abstraction has 4051 states and 11536 transitions. [2025-04-13 17:07:24,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:24,205 INFO L278 IsEmpty]: Start isEmpty. Operand 4051 states and 11536 transitions. [2025-04-13 17:07:24,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 17:07:24,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:24,207 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-04-13 17:07:24,218 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:07:24,408 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,SelfDestructingSolverStorable12 [2025-04-13 17:07:24,408 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:24,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1035705781, now seen corresponding path program 3 times [2025-04-13 17:07:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:24,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889896583] [2025-04-13 17:07:24,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:07:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:24,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 17:07:24,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 17:07:24,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:07:24,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:25,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:25,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889896583] [2025-04-13 17:07:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889896583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:25,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913994242] [2025-04-13 17:07:25,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:07:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:25,352 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:07:25,353 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:07:25,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 17:07:26,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 17:07:26,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:07:26,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:26,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:07:26,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:26,391 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:07:26,408 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:07:26,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 8 treesize of output 1 [2025-04-13 17:07:26,451 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:07:26,474 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:07:26,494 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:07:26,514 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:07:26,536 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:07:26,557 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:07:26,585 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:07:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:26,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:07:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913994242] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:07:26,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:07:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2025-04-13 17:07:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015297151] [2025-04-13 17:07:26,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:07:26,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:07:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:07:26,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:07:26,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:07:26,743 INFO L87 Difference]: Start difference. First operand 4051 states and 11536 transitions. Second operand has 35 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:07:29,110 INFO L93 Difference]: Finished difference Result 37258 states and 108101 transitions. [2025-04-13 17:07:29,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 17:07:29,111 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 17:07:29,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:07:29,365 INFO L225 Difference]: With dead ends: 37258 [2025-04-13 17:07:29,365 INFO L226 Difference]: Without dead ends: 37127 [2025-04-13 17:07:29,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4234 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3441, Invalid=6261, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 17:07:29,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3059 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:07:29,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 0 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:07:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37127 states. [2025-04-13 17:07:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37127 to 24577. [2025-04-13 17:07:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24577 states, 24573 states have (on average 2.9832336304073577) internal successors, (73307), 24576 states have internal predecessors, (73307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24577 states to 24577 states and 73307 transitions. [2025-04-13 17:07:29,934 INFO L79 Accepts]: Start accepts. Automaton has 24577 states and 73307 transitions. Word has length 45 [2025-04-13 17:07:29,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:07:29,935 INFO L485 AbstractCegarLoop]: Abstraction has 24577 states and 73307 transitions. [2025-04-13 17:07:29,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:07:29,935 INFO L278 IsEmpty]: Start isEmpty. Operand 24577 states and 73307 transitions. [2025-04-13 17:07:29,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 17:07:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:07:29,938 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:07:29,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 17:07:30,138 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,SelfDestructingSolverStorable13 [2025-04-13 17:07:30,139 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:07:30,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:07:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 620185786, now seen corresponding path program 5 times [2025-04-13 17:07:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:07:30,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456124210] [2025-04-13 17:07:30,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:07:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:07:30,172 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 17:07:30,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 17:07:30,413 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:07:30,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:07:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:07:32,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456124210] [2025-04-13 17:07:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456124210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:07:32,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119235744] [2025-04-13 17:07:32,730 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:07:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:07:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:07:32,732 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:07:32,738 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:07:32,871 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 17:07:33,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 17:07:33,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 17:07:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:07:33,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:07:33,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:07:33,156 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:07:33,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 50 [2025-04-13 17:07:33,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-04-13 17:07:33,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2025-04-13 17:07:33,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 123 treesize of output 95 [2025-04-13 17:07:33,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:33,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2025-04-13 17:07:33,367 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:33,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 84 [2025-04-13 17:07:33,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 237 treesize of output 185 [2025-04-13 17:07:33,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:33,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2025-04-13 17:07:33,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 158 [2025-04-13 17:07:34,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 465 treesize of output 365 [2025-04-13 17:07:34,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:34,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2025-04-13 17:07:34,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 265 [2025-04-13 17:07:35,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 921 treesize of output 725 [2025-04-13 17:07:35,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:35,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 725 treesize of output 503 [2025-04-13 17:07:36,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:07:36,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 843 treesize of output 689 [2025-04-13 17:08:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:01,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:08:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119235744] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:08:03,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:08:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 32 [2025-04-13 17:08:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171933414] [2025-04-13 17:08:03,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:08:03,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:08:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:08:03,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:08:03,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:08:03,150 INFO L87 Difference]: Start difference. First operand 24577 states and 73307 transitions. Second operand has 33 states, 32 states have (on average 4.78125) internal successors, (153), 33 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:08:08,029 INFO L93 Difference]: Finished difference Result 38809 states and 113629 transitions. [2025-04-13 17:08:08,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:08:08,029 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.78125) internal successors, (153), 33 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-13 17:08:08,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:08:08,164 INFO L225 Difference]: With dead ends: 38809 [2025-04-13 17:08:08,164 INFO L226 Difference]: Without dead ends: 38398 [2025-04-13 17:08:08,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=806, Invalid=2616, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:08:08,183 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 550 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:08:08,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 0 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 17:08:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38398 states. [2025-04-13 17:08:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38398 to 27223. [2025-04-13 17:08:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27223 states, 27219 states have (on average 2.993203277122598) internal successors, (81472), 27222 states have internal predecessors, (81472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27223 states to 27223 states and 81472 transitions. [2025-04-13 17:08:09,014 INFO L79 Accepts]: Start accepts. Automaton has 27223 states and 81472 transitions. Word has length 51 [2025-04-13 17:08:09,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:08:09,014 INFO L485 AbstractCegarLoop]: Abstraction has 27223 states and 81472 transitions. [2025-04-13 17:08:09,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.78125) internal successors, (153), 33 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:08:09,015 INFO L278 IsEmpty]: Start isEmpty. Operand 27223 states and 81472 transitions. [2025-04-13 17:08:09,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-13 17:08:09,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:08:09,019 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:08:09,029 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:08:09,219 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,SelfDestructingSolverStorable14 [2025-04-13 17:08:09,219 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:08:09,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:08:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1452354048, now seen corresponding path program 6 times [2025-04-13 17:08:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:08:09,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370740774] [2025-04-13 17:08:09,222 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:08:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:08:09,247 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 7 equivalence classes. [2025-04-13 17:08:10,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 17:08:10,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-13 17:08:10,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:08:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:08:12,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370740774] [2025-04-13 17:08:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370740774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:08:12,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96497828] [2025-04-13 17:08:12,913 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:08:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:08:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:08:12,915 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:08:12,916 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:08:13,054 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 7 equivalence classes. [2025-04-13 17:08:14,070 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 17:08:14,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-13 17:08:14,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:08:14,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1987 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:08:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:08:14,110 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:08:14,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-04-13 17:08:14,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-04-13 17:08:14,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-04-13 17:08:14,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 83 [2025-04-13 17:08:14,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-04-13 17:08:14,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2025-04-13 17:08:14,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 209 treesize of output 157 [2025-04-13 17:08:14,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2025-04-13 17:08:14,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 128 [2025-04-13 17:08:15,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 405 treesize of output 305 [2025-04-13 17:08:15,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 269 [2025-04-13 17:08:15,449 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 316 [2025-04-13 17:08:16,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 797 treesize of output 601 [2025-04-13 17:08:16,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 479 [2025-04-13 17:08:16,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 618 treesize of output 526 [2025-04-13 17:08:20,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 1581 treesize of output 1193 [2025-04-13 17:08:20,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 1193 treesize of output 889 [2025-04-13 17:08:22,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 1267 treesize of output 973 [2025-04-13 17:09:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:09:31,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:09:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 12 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:09:33,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96497828] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:09:33,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:09:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 36 [2025-04-13 17:09:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640467718] [2025-04-13 17:09:33,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:09:33,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:09:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:09:33,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:09:33,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:09:33,130 INFO L87 Difference]: Start difference. First operand 27223 states and 81472 transitions. Second operand has 37 states, 36 states have (on average 4.638888888888889) internal successors, (167), 37 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:09:40,693 INFO L93 Difference]: Finished difference Result 41178 states and 120851 transitions. [2025-04-13 17:09:40,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:09:40,694 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.638888888888889) internal successors, (167), 37 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-04-13 17:09:40,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:09:40,795 INFO L225 Difference]: With dead ends: 41178 [2025-04-13 17:09:40,795 INFO L226 Difference]: Without dead ends: 40653 [2025-04-13 17:09:40,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1057, Invalid=3499, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:09:40,813 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 872 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:09:40,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 0 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 17:09:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40653 states. [2025-04-13 17:09:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40653 to 26641. [2025-04-13 17:09:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26641 states, 26637 states have (on average 2.9930923152006605) internal successors, (79727), 26640 states have internal predecessors, (79727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 79727 transitions. [2025-04-13 17:09:41,387 INFO L79 Accepts]: Start accepts. Automaton has 26641 states and 79727 transitions. Word has length 59 [2025-04-13 17:09:41,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:09:41,387 INFO L485 AbstractCegarLoop]: Abstraction has 26641 states and 79727 transitions. [2025-04-13 17:09:41,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.638888888888889) internal successors, (167), 37 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:41,387 INFO L278 IsEmpty]: Start isEmpty. Operand 26641 states and 79727 transitions. [2025-04-13 17:09:41,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-13 17:09:41,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:09:41,391 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:09:41,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 17:09:41,591 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,SelfDestructingSolverStorable15 [2025-04-13 17:09:41,591 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:09:41,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:09:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash -994844837, now seen corresponding path program 3 times [2025-04-13 17:09:41,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:09:41,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809990823] [2025-04-13 17:09:41,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:09:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:09:41,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 12 equivalence classes. [2025-04-13 17:09:41,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 63 statements. [2025-04-13 17:09:41,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:09:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-04-13 17:09:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:09:42,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809990823] [2025-04-13 17:09:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809990823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:09:42,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51585399] [2025-04-13 17:09:42,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:09:42,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:09:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:09:42,104 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:09:42,105 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:09:42,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 12 equivalence classes. [2025-04-13 17:09:42,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 63 statements. [2025-04-13 17:09:42,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:09:42,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1793 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:09:42,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:09:42,434 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:09:42,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 74 treesize of output 59 [2025-04-13 17:09:42,789 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:42,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 81 [2025-04-13 17:09:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-04-13 17:09:42,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:09:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-04-13 17:09:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51585399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:09:43,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:09:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-04-13 17:09:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240509099] [2025-04-13 17:09:43,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:09:43,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:09:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:09:43,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:09:43,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:09:43,006 INFO L87 Difference]: Start difference. First operand 26641 states and 79727 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 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:09:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:09:43,523 INFO L93 Difference]: Finished difference Result 44424 states and 127174 transitions. [2025-04-13 17:09:43,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:09:43,524 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 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 63 [2025-04-13 17:09:43,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:09:43,633 INFO L225 Difference]: With dead ends: 44424 [2025-04-13 17:09:43,633 INFO L226 Difference]: Without dead ends: 44418 [2025-04-13 17:09:43,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:09:43,650 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:09:43,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:09:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44418 states. [2025-04-13 17:09:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44418 to 34191. [2025-04-13 17:09:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34191 states, 34187 states have (on average 2.969140316494574) internal successors, (101506), 34190 states have internal predecessors, (101506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34191 states to 34191 states and 101506 transitions. [2025-04-13 17:09:44,413 INFO L79 Accepts]: Start accepts. Automaton has 34191 states and 101506 transitions. Word has length 63 [2025-04-13 17:09:44,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:09:44,413 INFO L485 AbstractCegarLoop]: Abstraction has 34191 states and 101506 transitions. [2025-04-13 17:09:44,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 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:09:44,414 INFO L278 IsEmpty]: Start isEmpty. Operand 34191 states and 101506 transitions. [2025-04-13 17:09:44,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 17:09:44,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:09:44,418 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:09:44,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 17:09:44,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:09:44,619 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:09:44,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:09:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1193491688, now seen corresponding path program 4 times [2025-04-13 17:09:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:09:44,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621213039] [2025-04-13 17:09:44,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:09:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:09:44,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 17:09:44,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:09:44,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:09:44,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:09:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:09:45,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621213039] [2025-04-13 17:09:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621213039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:09:45,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363677204] [2025-04-13 17:09:45,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:09:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:09:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:09:45,895 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:09:45,896 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:09:46,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 17:09:46,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:09:46,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:09:46,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:46,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:09:46,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:09:46,242 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:09:46,258 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:09:46,273 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:09:46,290 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:09:46,307 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:09:46,323 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:09:46,339 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:09:46,357 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:09:46,373 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:09:46,393 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:09:46,416 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:09:46,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 31 [2025-04-13 17:09:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:09:46,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:09:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 67 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-04-13 17:09:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363677204] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:09:46,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:09:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 7] total 35 [2025-04-13 17:09:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36046300] [2025-04-13 17:09:46,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:09:46,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:09:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:09:46,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:09:46,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:09:46,891 INFO L87 Difference]: Start difference. First operand 34191 states and 101506 transitions. Second operand has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:09:48,636 INFO L93 Difference]: Finished difference Result 95714 states and 277324 transitions. [2025-04-13 17:09:48,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:09:48,636 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-04-13 17:09:48,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:09:48,915 INFO L225 Difference]: With dead ends: 95714 [2025-04-13 17:09:48,915 INFO L226 Difference]: Without dead ends: 95554 [2025-04-13 17:09:48,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=614, Invalid=1366, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:09:48,955 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 622 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3856 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:09:48,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 0 Invalid, 3915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3856 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:09:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95554 states. [2025-04-13 17:09:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95554 to 39925. [2025-04-13 17:09:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39925 states, 39921 states have (on average 2.9620750983191804) internal successors, (118249), 39924 states have internal predecessors, (118249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39925 states to 39925 states and 118249 transitions. [2025-04-13 17:09:50,653 INFO L79 Accepts]: Start accepts. Automaton has 39925 states and 118249 transitions. Word has length 67 [2025-04-13 17:09:50,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:09:50,653 INFO L485 AbstractCegarLoop]: Abstraction has 39925 states and 118249 transitions. [2025-04-13 17:09:50,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 36 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:09:50,654 INFO L278 IsEmpty]: Start isEmpty. Operand 39925 states and 118249 transitions. [2025-04-13 17:09:50,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 17:09:50,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:09:50,658 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:09:50,668 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:09:50,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 17:09:50,858 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:09:50,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:09:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2093947578, now seen corresponding path program 7 times [2025-04-13 17:09:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:09:50,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004677208] [2025-04-13 17:09:50,861 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:09:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:09:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 17:09:51,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:09:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:09:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:09:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:09:54,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004677208] [2025-04-13 17:09:54,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004677208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:09:54,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630985588] [2025-04-13 17:09:54,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:09:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:09:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:09:54,487 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:09:54,489 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:09:54,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 17:09:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 17:09:54,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:09:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:09:54,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 2030 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:09:54,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:09:54,902 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:09:54,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 80 treesize of output 64 [2025-04-13 17:09:54,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 90 [2025-04-13 17:09:54,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 28 [2025-04-13 17:09:55,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 159 treesize of output 131 [2025-04-13 17:09:55,134 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:55,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 135 [2025-04-13 17:09:55,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:55,213 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 99 [2025-04-13 17:09:55,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 317 treesize of output 265 [2025-04-13 17:09:55,508 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:55,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 205 [2025-04-13 17:09:55,646 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:55,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 201 [2025-04-13 17:09:56,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 633 treesize of output 533 [2025-04-13 17:09:56,374 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:56,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 533 treesize of output 325 [2025-04-13 17:09:56,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 405 [2025-04-13 17:09:58,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 1265 treesize of output 1069 [2025-04-13 17:09:58,556 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:09:58,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1069 treesize of output 545 [2025-04-13 17:09:58,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 1144 treesize of output 723 [2025-04-13 17:10:03,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 2529 treesize of output 2141 [2025-04-13 17:10:04,012 INFO L325 Elim1Store]: treesize reduction 372, result has 14.1 percent of original size [2025-04-13 17:10:04,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 2141 treesize of output 905 [2025-04-13 17:10:06,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 17:10:06,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 17:10:06,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2399 treesize of output 1909 [2025-04-13 17:10:17,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 5059 treesize of output 4287 [2025-04-13 17:10:17,138 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:10:17,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 4287 treesize of output 1789 [2025-04-13 17:10:19,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 4398 treesize of output 2840 [2025-04-13 17:14:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:14:20,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:14:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 14 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:14:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630985588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:14:23,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:14:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 42 [2025-04-13 17:14:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804637343] [2025-04-13 17:14:23,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:14:23,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:14:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:14:23,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:14:23,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:14:23,430 INFO L87 Difference]: Start difference. First operand 39925 states and 118249 transitions. Second operand has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:15:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:15:56,785 INFO L93 Difference]: Finished difference Result 106268 states and 290582 transitions. [2025-04-13 17:15:56,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2025-04-13 17:15:56,786 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-04-13 17:15:56,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:15:57,086 INFO L225 Difference]: With dead ends: 106268 [2025-04-13 17:15:57,086 INFO L226 Difference]: Without dead ends: 104213 [2025-04-13 17:15:57,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16238 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=9345, Invalid=35811, Unknown=0, NotChecked=0, Total=45156 [2025-04-13 17:15:57,139 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1750 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8155 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 8155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:15:57,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 0 Invalid, 8330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 8155 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-04-13 17:15:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104213 states. [2025-04-13 17:15:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104213 to 47815. [2025-04-13 17:15:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47815 states, 47811 states have (on average 2.990483361569513) internal successors, (142978), 47814 states have internal predecessors, (142978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:15:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47815 states to 47815 states and 142978 transitions. [2025-04-13 17:15:59,111 INFO L79 Accepts]: Start accepts. Automaton has 47815 states and 142978 transitions. Word has length 67 [2025-04-13 17:15:59,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:15:59,111 INFO L485 AbstractCegarLoop]: Abstraction has 47815 states and 142978 transitions. [2025-04-13 17:15:59,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.785714285714286) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:15:59,111 INFO L278 IsEmpty]: Start isEmpty. Operand 47815 states and 142978 transitions. [2025-04-13 17:15:59,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-13 17:15:59,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:15:59,118 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:15:59,128 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:15:59,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:15:59,318 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:15:59,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:15:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash 480058808, now seen corresponding path program 5 times [2025-04-13 17:15:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:15:59,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563223333] [2025-04-13 17:15:59,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:15:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:15:59,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 13 equivalence classes. [2025-04-13 17:15:59,397 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:15:59,397 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 17:15:59,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:16:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:16:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:16:01,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563223333] [2025-04-13 17:16:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563223333] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:16:01,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869939879] [2025-04-13 17:16:01,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:16:01,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:16:01,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:16:01,017 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:16:01,019 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:16:01,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 13 equivalence classes. [2025-04-13 17:16:02,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:16:02,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 17:16:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:16:02,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:16:02,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:16:02,280 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:16:02,296 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:16:02,314 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:16:02,333 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:16:02,351 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:16:02,369 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:16:02,386 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:16:02,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 8 treesize of output 1 [2025-04-13 17:16:02,426 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:16:02,448 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:16:02,467 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:16:02,489 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:16:02,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 41 [2025-04-13 17:16:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:16:02,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:16:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 105 proven. 38 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-04-13 17:16:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869939879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:16:03,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:16:03,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 9] total 39 [2025-04-13 17:16:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706309727] [2025-04-13 17:16:03,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:16:03,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:16:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:16:03,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:16:03,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:16:03,331 INFO L87 Difference]: Start difference. First operand 47815 states and 142978 transitions. Second operand has 40 states, 39 states have (on average 4.589743589743589) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:16:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:16:05,844 INFO L93 Difference]: Finished difference Result 123207 states and 360366 transitions. [2025-04-13 17:16:05,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:16:05,845 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 4.589743589743589) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-04-13 17:16:05,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:16:06,227 INFO L225 Difference]: With dead ends: 123207 [2025-04-13 17:16:06,227 INFO L226 Difference]: Without dead ends: 123026 [2025-04-13 17:16:06,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=872, Invalid=1884, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:16:06,279 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 957 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5338 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 5338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:16:06,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 0 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 5338 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 17:16:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123026 states. [2025-04-13 17:16:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123026 to 45653. [2025-04-13 17:16:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45653 states, 45649 states have (on average 2.982212096650529) internal successors, (136135), 45652 states have internal predecessors, (136135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:16:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45653 states to 45653 states and 136135 transitions. [2025-04-13 17:16:08,132 INFO L79 Accepts]: Start accepts. Automaton has 45653 states and 136135 transitions. Word has length 75 [2025-04-13 17:16:08,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:16:08,133 INFO L485 AbstractCegarLoop]: Abstraction has 45653 states and 136135 transitions. [2025-04-13 17:16:08,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.589743589743589) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:16:08,133 INFO L278 IsEmpty]: Start isEmpty. Operand 45653 states and 136135 transitions. [2025-04-13 17:16:08,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-13 17:16:08,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:16:08,138 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:16:08,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 17:16:08,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:16:08,339 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:16:08,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:16:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1209825932, now seen corresponding path program 8 times [2025-04-13 17:16:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:16:08,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920188110] [2025-04-13 17:16:08,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:16:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:16:08,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-04-13 17:16:08,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:16:08,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:16:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:16:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:16:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:16:12,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920188110] [2025-04-13 17:16:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920188110] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:16:12,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533805990] [2025-04-13 17:16:12,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:16:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:16:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:16:12,622 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:16:12,623 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:16:12,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-04-13 17:16:12,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-04-13 17:16:12,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:16:12,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:16:13,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 17:16:13,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:16:13,033 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:16:13,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-04-13 17:16:13,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-04-13 17:16:13,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2025-04-13 17:16:13,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 83 [2025-04-13 17:16:13,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-04-13 17:16:13,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2025-04-13 17:16:13,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 209 treesize of output 157 [2025-04-13 17:16:13,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2025-04-13 17:16:13,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 152 [2025-04-13 17:16:14,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 405 treesize of output 305 [2025-04-13 17:16:14,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 269 [2025-04-13 17:16:14,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 265 [2025-04-13 17:16:15,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 797 treesize of output 601 [2025-04-13 17:16:15,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 479 [2025-04-13 17:16:16,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 755 treesize of output 712 [2025-04-13 17:16:19,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 1581 treesize of output 1193 [2025-04-13 17:16:19,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 1193 treesize of output 889 [2025-04-13 17:16:20,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 1217 treesize of output 883 [2025-04-13 17:16:31,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 3149 treesize of output 2377 [2025-04-13 17:16:31,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 2377 treesize of output 1699 [2025-04-13 17:16:35,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 2471 treesize of output 1824 [2025-04-13 17:16:58,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 6285 treesize of output 4745 [2025-04-13 17:16:58,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 4745 treesize of output 3309 [2025-04-13 17:17:09,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 5591 treesize of output 4921 Received shutdown request... [2025-04-13 17:18:59,072 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:18:59,072 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:18:59,076 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:18:59,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 17:18:59,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:18:59,277 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-2-3-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-30-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-1 context. [2025-04-13 17:18:59,283 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 17:18:59,284 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 17:18:59,284 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:18:59,284 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:18:59,284 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:18:59,289 INFO L422 BasicCegarLoop]: Path program histogram: [8, 5, 3, 1, 1, 1, 1, 1] [2025-04-13 17:18:59,296 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:18:59,296 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:18:59,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:18:59 BasicIcfg [2025-04-13 17:18:59,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:18:59,311 INFO L158 Benchmark]: Toolchain (without parser) took 761681.22ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 106.0MB in the beginning and 262.8MB in the end (delta: -156.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 17:18:59,311 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:18:59,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.06ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 64.9MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 17:18:59,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.87ms. Allocated memory is still 155.2MB. Free memory was 64.9MB in the beginning and 55.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 17:18:59,312 INFO L158 Benchmark]: Boogie Preprocessor took 114.36ms. Allocated memory is still 155.2MB. Free memory was 55.7MB in the beginning and 47.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 17:18:59,312 INFO L158 Benchmark]: RCFGBuilder took 12259.74ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 47.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 17:18:59,313 INFO L158 Benchmark]: TraceAbstraction took 748716.72ms. Allocated memory was 3.8GB in the beginning and 1.4GB in the end (delta: -2.4GB). Free memory was 3.0GB in the beginning and 262.8MB in the end (delta: 2.7GB). Peak memory consumption was 472.5MB. Max. memory is 8.0GB. [2025-04-13 17:18:59,314 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.21ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.06ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 64.9MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.87ms. Allocated memory is still 155.2MB. Free memory was 64.9MB in the beginning and 55.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 114.36ms. Allocated memory is still 155.2MB. Free memory was 55.7MB in the beginning and 47.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 12259.74ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 47.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * TraceAbstraction took 748716.72ms. Allocated memory was 3.8GB in the beginning and 1.4GB in the end (delta: -2.4GB). Free memory was 3.0GB in the beginning and 262.8MB in the end (delta: 2.7GB). Peak memory consumption was 472.5MB. 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: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-2-3-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-30-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-1 context. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-2-3-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-30-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-1 context. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-2-3-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-30-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-1 context. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-2-3-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-30-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 46 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 748.6s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 129.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11157 SdHoareTripleChecker+Valid, 21.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11157 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32732 IncrementalHoareTripleChecker+Invalid, 34459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1727 mSolverCounterUnsat, 0 mSDtfsCounter, 32732 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1413 SyntacticMatches, 4 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27193 ImplicationChecksByTransitivity, 127.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47815occurred in iteration=19, InterpolantAutomatonStates: 651, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 254229 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 424.7s InterpolantComputationTime, 1412 NumberOfCodeBlocks, 1332 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 2037 ConstructedInterpolants, 48 QuantifiedInterpolants, 582186 SizeOfPredicates, 252 NumberOfNonLiveVariables, 32009 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 53 InterpolantComputations, 5 PerfectInterpolantSequences, 1377/5327 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown