/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:58:52,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:58:52,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:58:52,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:58:52,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:58:52,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:58:52,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:58:52,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:58:52,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:58:52,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:58:52,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:58:52,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:58:52,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:58:52,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:58:52,815 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:58:52,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:58:52,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:58:52,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:58:52,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:58:52,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:58:52,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:58:52,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:58:52,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:58:52,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:58:52,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:58:52,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:58:52,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:58:53,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:58:53,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:58:53,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:58:53,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:58:53,053 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:58:53,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-13 22:58:54,327 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2ca99b1/fd14043e66774d0da77f7163490aeb92/FLAGa0ce4271e [2025-04-13 22:58:54,502 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:58:54,502 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-13 22:58:54,508 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2ca99b1/fd14043e66774d0da77f7163490aeb92/FLAGa0ce4271e [2025-04-13 22:58:55,328 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2ca99b1/fd14043e66774d0da77f7163490aeb92 [2025-04-13 22:58:55,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:58:55,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:58:55,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:58:55,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:58:55,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:58:55,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be05004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55, skipping insertion in model container [2025-04-13 22:58:55,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:58:55,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-04-13 22:58:55,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:58:55,530 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:58:55,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-04-13 22:58:55,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:58:55,586 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:58:55,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55 WrapperNode [2025-04-13 22:58:55,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:58:55,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:58:55,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:58:55,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:58:55,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,619 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-04-13 22:58:55,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:58:55,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:58:55,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:58:55,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:58:55,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,653 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 22:58:55,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:58:55,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:58:55,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:58:55,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:58:55,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (1/1) ... [2025-04-13 22:58:55,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:58:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:55,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:58:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:58:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:58:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:58:55,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:58:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:58:55,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:58:55,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:58:55,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:58:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:58:55,723 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:58:55,808 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:58:55,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:58:56,016 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:58:56,016 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:58:56,017 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:58:56,181 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:58:56,183 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:58:56,184 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:58:56,187 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:58:56,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:58:56 BoogieIcfgContainer [2025-04-13 22:58:56,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:58:56,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:58:56,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:58:56,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:58:56,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:58:55" (1/3) ... [2025-04-13 22:58:56,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da540e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:58:56, skipping insertion in model container [2025-04-13 22:58:56,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:58:55" (2/3) ... [2025-04-13 22:58:56,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da540e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:58:56, skipping insertion in model container [2025-04-13 22:58:56,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:58:56" (3/3) ... [2025-04-13 22:58:56,193 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-04-13 22:58:56,203 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:58:56,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:58:56,204 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:58:56,245 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:58:56,265 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 22:58:56,309 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,329 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:58:56,339 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;@6e4afd23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:58:56,339 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:58:56,342 INFO L278 IsEmpty]: Start isEmpty. Operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:58:56,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:56,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:56,350 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:58:56,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash 149242308, now seen corresponding path program 1 times [2025-04-13 22:58:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:56,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058757392] [2025-04-13 22:58:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:56,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:58:56,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:58:56,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:56,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:56,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:56,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058757392] [2025-04-13 22:58:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058757392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:56,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:58:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830743330] [2025-04-13 22:58:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:56,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:58:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:56,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:58:56,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:58:56,614 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:56,675 INFO L93 Difference]: Finished difference Result 257 states and 928 transitions. [2025-04-13 22:58:56,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:58:56,677 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 22:58:56,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:56,687 INFO L225 Difference]: With dead ends: 257 [2025-04-13 22:58:56,687 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 22:58:56,691 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 22:58:56,695 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:56,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:58:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 22:58:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 22:58:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.6614583333333335) internal successors, (703), 192 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 703 transitions. [2025-04-13 22:58:56,741 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 703 transitions. Word has length 15 [2025-04-13 22:58:56,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:56,742 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 703 transitions. [2025-04-13 22:58:56,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,742 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 703 transitions. [2025-04-13 22:58:56,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:58:56,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:56,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:56,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:58:56,747 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:58:56,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash 28457807, now seen corresponding path program 1 times [2025-04-13 22:58:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:56,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251734824] [2025-04-13 22:58:56,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:56,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:58:56,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:58:56,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:56,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:56,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:56,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251734824] [2025-04-13 22:58:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251734824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:58:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843559074] [2025-04-13 22:58:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:56,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:58:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:56,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:58:56,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:58:56,856 INFO L87 Difference]: Start difference. First operand 193 states and 703 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:56,900 INFO L93 Difference]: Finished difference Result 232 states and 803 transitions. [2025-04-13 22:58:56,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:58:56,900 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:58:56,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:56,903 INFO L225 Difference]: With dead ends: 232 [2025-04-13 22:58:56,903 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 22:58:56,903 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 22:58:56,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:56,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:58:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 22:58:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 22:58:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.46875) internal successors, (666), 192 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 666 transitions. [2025-04-13 22:58:56,920 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 666 transitions. Word has length 17 [2025-04-13 22:58:56,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:56,920 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 666 transitions. [2025-04-13 22:58:56,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:56,921 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 666 transitions. [2025-04-13 22:58:56,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:58:56,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:56,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:56,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:58:56,922 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:58:56,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2101271198, now seen corresponding path program 1 times [2025-04-13 22:58:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:56,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470121716] [2025-04-13 22:58:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:56,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:58:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:58:56,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:56,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:57,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:57,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470121716] [2025-04-13 22:58:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470121716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:57,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:57,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:58:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959190443] [2025-04-13 22:58:57,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:57,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:58:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:57,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:58:57,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:58:57,045 INFO L87 Difference]: Start difference. First operand 193 states and 666 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:57,098 INFO L93 Difference]: Finished difference Result 385 states and 1331 transitions. [2025-04-13 22:58:57,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:58:57,099 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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 22:58:57,099 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:57,101 INFO L225 Difference]: With dead ends: 385 [2025-04-13 22:58:57,101 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 22:58:57,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:58:57,102 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:57,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:58:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 22:58:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-13 22:58:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 3.4559585492227978) internal successors, (667), 193 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 667 transitions. [2025-04-13 22:58:57,118 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 667 transitions. Word has length 19 [2025-04-13 22:58:57,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:57,118 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 667 transitions. [2025-04-13 22:58:57,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:57,118 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 667 transitions. [2025-04-13 22:58:57,119 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:58:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:57,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:57,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:58:57,119 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:58:57,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1885729036, now seen corresponding path program 1 times [2025-04-13 22:58:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:57,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148518508] [2025-04-13 22:58:57,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:57,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:58:57,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:58:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:57,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148518508] [2025-04-13 22:58:57,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148518508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:57,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23985346] [2025-04-13 22:58:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:57,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:58:57,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:58:57,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:58:58,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:58:58,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:58,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:58,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:58:58,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:58,079 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 22:58:58,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:58:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:58,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:59,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:58:59,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:58:59,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:58:59,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:58:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23985346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:58:59,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:58:59,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-13 22:58:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904116880] [2025-04-13 22:58:59,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:58:59,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:58:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:59,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:58:59,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:58:59,129 INFO L87 Difference]: Start difference. First operand 194 states and 667 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:00,361 INFO L93 Difference]: Finished difference Result 410 states and 1294 transitions. [2025-04-13 22:59:00,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:59:00,362 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:00,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:00,365 INFO L225 Difference]: With dead ends: 410 [2025-04-13 22:59:00,365 INFO L226 Difference]: Without dead ends: 404 [2025-04-13 22:59:00,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:59:00,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:00,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:59:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-13 22:59:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 228. [2025-04-13 22:59:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 3.3127753303964758) internal successors, (752), 227 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 752 transitions. [2025-04-13 22:59:00,388 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 752 transitions. Word has length 20 [2025-04-13 22:59:00,388 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:00,388 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 752 transitions. [2025-04-13 22:59:00,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:00,388 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 752 transitions. [2025-04-13 22:59:00,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:00,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:00,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:00,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:00,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:00,593 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:00,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 380437056, now seen corresponding path program 2 times [2025-04-13 22:59:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:00,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068046702] [2025-04-13 22:59:00,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:00,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:00,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:00,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:00,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:00,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068046702] [2025-04-13 22:59:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068046702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747508633] [2025-04-13 22:59:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:00,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:00,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:00,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:00,988 INFO L87 Difference]: Start difference. First operand 228 states and 752 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:01,211 INFO L93 Difference]: Finished difference Result 276 states and 887 transitions. [2025-04-13 22:59:01,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:01,212 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:01,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:01,213 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:59:01,213 INFO L226 Difference]: Without dead ends: 270 [2025-04-13 22:59:01,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:01,214 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:01,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-13 22:59:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2025-04-13 22:59:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.288065843621399) internal successors, (799), 243 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 799 transitions. [2025-04-13 22:59:01,224 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 799 transitions. Word has length 20 [2025-04-13 22:59:01,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:01,224 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 799 transitions. [2025-04-13 22:59:01,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,224 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 799 transitions. [2025-04-13 22:59:01,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:01,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:01,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:01,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:59:01,225 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:01,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash -387996232, now seen corresponding path program 3 times [2025-04-13 22:59:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:01,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361383875] [2025-04-13 22:59:01,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:01,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:01,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:01,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:01,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361383875] [2025-04-13 22:59:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361383875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029462417] [2025-04-13 22:59:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:01,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:01,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:01,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:01,563 INFO L87 Difference]: Start difference. First operand 244 states and 799 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:01,755 INFO L93 Difference]: Finished difference Result 282 states and 900 transitions. [2025-04-13 22:59:01,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:59:01,756 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:01,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:01,757 INFO L225 Difference]: With dead ends: 282 [2025-04-13 22:59:01,758 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 22:59:01,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:01,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:01,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 22:59:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 250. [2025-04-13 22:59:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.2690763052208833) internal successors, (814), 249 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 814 transitions. [2025-04-13 22:59:01,766 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 814 transitions. Word has length 20 [2025-04-13 22:59:01,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:01,766 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 814 transitions. [2025-04-13 22:59:01,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,766 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 814 transitions. [2025-04-13 22:59:01,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:01,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:01,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:01,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:59:01,768 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:01,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 111654966, now seen corresponding path program 4 times [2025-04-13 22:59:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:01,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964606795] [2025-04-13 22:59:01,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:01,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:01,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:01,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:02,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964606795] [2025-04-13 22:59:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964606795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976114823] [2025-04-13 22:59:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:02,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:02,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:02,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:02,115 INFO L87 Difference]: Start difference. First operand 250 states and 814 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:02,320 INFO L93 Difference]: Finished difference Result 290 states and 923 transitions. [2025-04-13 22:59:02,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:02,320 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:02,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:02,322 INFO L225 Difference]: With dead ends: 290 [2025-04-13 22:59:02,322 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 22:59:02,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:02,323 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:02,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 22:59:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2025-04-13 22:59:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 3.2591093117408905) internal successors, (805), 247 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 805 transitions. [2025-04-13 22:59:02,330 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 805 transitions. Word has length 20 [2025-04-13 22:59:02,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:02,330 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 805 transitions. [2025-04-13 22:59:02,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:02,330 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 805 transitions. [2025-04-13 22:59:02,331 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:02,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:02,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:02,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:59:02,331 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:02,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2104556000, now seen corresponding path program 5 times [2025-04-13 22:59:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:02,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096401446] [2025-04-13 22:59:02,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:02,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:02,358 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:02,358 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:02,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096401446] [2025-04-13 22:59:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096401446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:02,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18532810] [2025-04-13 22:59:02,794 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:02,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:02,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:02,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:59:02,832 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:02,846 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:02,846 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:02,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:02,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:02,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:02,865 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 22:59:03,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:03,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:03,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:03,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:03,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:03,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18532810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:03,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230263191] [2025-04-13 22:59:03,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:03,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:03,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:03,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:03,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:03,644 INFO L87 Difference]: Start difference. First operand 248 states and 805 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:04,908 INFO L93 Difference]: Finished difference Result 676 states and 2196 transitions. [2025-04-13 22:59:04,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:59:04,908 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:04,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:04,916 INFO L225 Difference]: With dead ends: 676 [2025-04-13 22:59:04,916 INFO L226 Difference]: Without dead ends: 603 [2025-04-13 22:59:04,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=412, Invalid=1658, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:59:04,917 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:04,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:59:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-04-13 22:59:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 286. [2025-04-13 22:59:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.2771929824561403) internal successors, (934), 285 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 934 transitions. [2025-04-13 22:59:04,933 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 934 transitions. Word has length 20 [2025-04-13 22:59:04,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:04,933 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 934 transitions. [2025-04-13 22:59:04,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:04,934 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 934 transitions. [2025-04-13 22:59:04,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:04,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:04,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:04,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:59:05,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 22:59:05,135 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:05,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2144292548, now seen corresponding path program 6 times [2025-04-13 22:59:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:05,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381961678] [2025-04-13 22:59:05,135 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:05,144 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:05,150 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:05,150 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:05,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:05,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381961678] [2025-04-13 22:59:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381961678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:05,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478243707] [2025-04-13 22:59:05,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:05,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:05,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:05,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:05,475 INFO L87 Difference]: Start difference. First operand 286 states and 934 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:05,755 INFO L93 Difference]: Finished difference Result 340 states and 1076 transitions. [2025-04-13 22:59:05,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:05,755 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:05,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:05,757 INFO L225 Difference]: With dead ends: 340 [2025-04-13 22:59:05,758 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:59:05,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:59:05,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:05,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:59:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 284. [2025-04-13 22:59:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.275618374558304) internal successors, (927), 283 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 927 transitions. [2025-04-13 22:59:05,768 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 927 transitions. Word has length 20 [2025-04-13 22:59:05,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:05,768 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 927 transitions. [2025-04-13 22:59:05,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:05,768 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 927 transitions. [2025-04-13 22:59:05,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:05,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:05,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:05,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:59:05,769 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:05,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2067687948, now seen corresponding path program 7 times [2025-04-13 22:59:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:05,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622975157] [2025-04-13 22:59:05,770 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:05,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:05,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:05,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:05,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:06,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622975157] [2025-04-13 22:59:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622975157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:06,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148576493] [2025-04-13 22:59:06,188 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:06,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:06,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:59:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:06,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:06,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:06,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:06,269 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 22:59:06,399 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:06,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:06,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:06,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:06,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:06,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148576493] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:06,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128766802] [2025-04-13 22:59:06,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:06,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:06,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:06,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:06,921 INFO L87 Difference]: Start difference. First operand 284 states and 927 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:08,794 INFO L93 Difference]: Finished difference Result 679 states and 2212 transitions. [2025-04-13 22:59:08,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:59:08,795 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:08,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:08,798 INFO L225 Difference]: With dead ends: 679 [2025-04-13 22:59:08,798 INFO L226 Difference]: Without dead ends: 673 [2025-04-13 22:59:08,799 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=578, Invalid=2614, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:59:08,799 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:08,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:59:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-04-13 22:59:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 289. [2025-04-13 22:59:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 3.295138888888889) internal successors, (949), 288 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 949 transitions. [2025-04-13 22:59:08,809 INFO L79 Accepts]: Start accepts. Automaton has 289 states and 949 transitions. Word has length 20 [2025-04-13 22:59:08,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:08,809 INFO L485 AbstractCegarLoop]: Abstraction has 289 states and 949 transitions. [2025-04-13 22:59:08,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:08,810 INFO L278 IsEmpty]: Start isEmpty. Operand 289 states and 949 transitions. [2025-04-13 22:59:08,810 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:08,810 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:08,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:08,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:09,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:09,011 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:09,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1690586476, now seen corresponding path program 8 times [2025-04-13 22:59:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:09,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613096413] [2025-04-13 22:59:09,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:09,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:09,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:09,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:09,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613096413] [2025-04-13 22:59:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613096413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:09,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572829082] [2025-04-13 22:59:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:09,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:09,259 INFO L87 Difference]: Start difference. First operand 289 states and 949 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:09,469 INFO L93 Difference]: Finished difference Result 373 states and 1154 transitions. [2025-04-13 22:59:09,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:59:09,469 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:09,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:09,471 INFO L225 Difference]: With dead ends: 373 [2025-04-13 22:59:09,472 INFO L226 Difference]: Without dead ends: 367 [2025-04-13 22:59:09,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:59:09,472 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:09,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-13 22:59:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 281. [2025-04-13 22:59:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.3107142857142855) internal successors, (927), 280 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 927 transitions. [2025-04-13 22:59:09,479 INFO L79 Accepts]: Start accepts. Automaton has 281 states and 927 transitions. Word has length 20 [2025-04-13 22:59:09,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:09,479 INFO L485 AbstractCegarLoop]: Abstraction has 281 states and 927 transitions. [2025-04-13 22:59:09,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:09,479 INFO L278 IsEmpty]: Start isEmpty. Operand 281 states and 927 transitions. [2025-04-13 22:59:09,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:09,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:09,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:09,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:59:09,480 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:09,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 127306350, now seen corresponding path program 9 times [2025-04-13 22:59:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:09,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249223894] [2025-04-13 22:59:09,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:09,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:09,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:09,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:09,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:09,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249223894] [2025-04-13 22:59:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249223894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76497870] [2025-04-13 22:59:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:09,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:09,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:09,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:09,773 INFO L87 Difference]: Start difference. First operand 281 states and 927 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:10,038 INFO L93 Difference]: Finished difference Result 373 states and 1194 transitions. [2025-04-13 22:59:10,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:59:10,038 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:10,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:10,040 INFO L225 Difference]: With dead ends: 373 [2025-04-13 22:59:10,040 INFO L226 Difference]: Without dead ends: 367 [2025-04-13 22:59:10,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:59:10,041 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:10,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-13 22:59:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2025-04-13 22:59:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 3.335664335664336) internal successors, (954), 286 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 954 transitions. [2025-04-13 22:59:10,048 INFO L79 Accepts]: Start accepts. Automaton has 287 states and 954 transitions. Word has length 20 [2025-04-13 22:59:10,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:10,048 INFO L485 AbstractCegarLoop]: Abstraction has 287 states and 954 transitions. [2025-04-13 22:59:10,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,048 INFO L278 IsEmpty]: Start isEmpty. Operand 287 states and 954 transitions. [2025-04-13 22:59:10,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:10,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:10,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:10,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:59:10,049 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:10,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 83720124, now seen corresponding path program 10 times [2025-04-13 22:59:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:10,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016787383] [2025-04-13 22:59:10,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:10,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:10,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:10,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:10,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:10,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016787383] [2025-04-13 22:59:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016787383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654846420] [2025-04-13 22:59:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:10,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:10,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:10,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:10,295 INFO L87 Difference]: Start difference. First operand 287 states and 954 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:10,480 INFO L93 Difference]: Finished difference Result 337 states and 1083 transitions. [2025-04-13 22:59:10,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:10,480 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:10,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:10,482 INFO L225 Difference]: With dead ends: 337 [2025-04-13 22:59:10,482 INFO L226 Difference]: Without dead ends: 331 [2025-04-13 22:59:10,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:10,483 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:10,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-04-13 22:59:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 293. [2025-04-13 22:59:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 3.3184931506849313) internal successors, (969), 292 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 969 transitions. [2025-04-13 22:59:10,492 INFO L79 Accepts]: Start accepts. Automaton has 293 states and 969 transitions. Word has length 20 [2025-04-13 22:59:10,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:10,492 INFO L485 AbstractCegarLoop]: Abstraction has 293 states and 969 transitions. [2025-04-13 22:59:10,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:10,492 INFO L278 IsEmpty]: Start isEmpty. Operand 293 states and 969 transitions. [2025-04-13 22:59:10,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:10,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:10,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:10,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:59:10,494 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:10,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash -966785238, now seen corresponding path program 11 times [2025-04-13 22:59:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:10,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636498074] [2025-04-13 22:59:10,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:10,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:10,506 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:10,506 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:10,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636498074] [2025-04-13 22:59:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636498074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:10,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976692458] [2025-04-13 22:59:10,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:10,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:10,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:10,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:10,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:59:10,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:10,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:10,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:10,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:10,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:10,876 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 22:59:11,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:11,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:11,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:11,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:11,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:11,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976692458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:11,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697839184] [2025-04-13 22:59:11,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:11,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:11,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:11,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:11,546 INFO L87 Difference]: Start difference. First operand 293 states and 969 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:13,588 INFO L93 Difference]: Finished difference Result 903 states and 2795 transitions. [2025-04-13 22:59:13,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 22:59:13,588 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:13,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:13,592 INFO L225 Difference]: With dead ends: 903 [2025-04-13 22:59:13,592 INFO L226 Difference]: Without dead ends: 807 [2025-04-13 22:59:13,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=978, Invalid=3852, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:59:13,595 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:13,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:59:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-04-13 22:59:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 345. [2025-04-13 22:59:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.2936046511627906) internal successors, (1133), 344 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1133 transitions. [2025-04-13 22:59:13,607 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 1133 transitions. Word has length 20 [2025-04-13 22:59:13,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:13,607 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 1133 transitions. [2025-04-13 22:59:13,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:13,607 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 1133 transitions. [2025-04-13 22:59:13,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:13,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:13,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:13,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:59:13,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:13,809 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:13,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 994328856, now seen corresponding path program 12 times [2025-04-13 22:59:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:13,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283322082] [2025-04-13 22:59:13,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:13,813 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:13,816 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:13,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:13,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:14,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283322082] [2025-04-13 22:59:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283322082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:14,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080849562] [2025-04-13 22:59:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:14,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:14,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:14,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:14,037 INFO L87 Difference]: Start difference. First operand 345 states and 1133 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:14,255 INFO L93 Difference]: Finished difference Result 389 states and 1247 transitions. [2025-04-13 22:59:14,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:59:14,255 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:14,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:14,257 INFO L225 Difference]: With dead ends: 389 [2025-04-13 22:59:14,257 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 22:59:14,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:59:14,258 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:14,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 22:59:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 349. [2025-04-13 22:59:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.2902298850574714) internal successors, (1145), 348 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1145 transitions. [2025-04-13 22:59:14,267 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1145 transitions. Word has length 20 [2025-04-13 22:59:14,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:14,267 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1145 transitions. [2025-04-13 22:59:14,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:14,267 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1145 transitions. [2025-04-13 22:59:14,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:14,268 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:14,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:14,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:59:14,268 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:14,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -722230912, now seen corresponding path program 13 times [2025-04-13 22:59:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:14,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265270446] [2025-04-13 22:59:14,268 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:14,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:14,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:14,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:14,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265270446] [2025-04-13 22:59:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265270446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:14,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997869162] [2025-04-13 22:59:14,579 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:14,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:14,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:14,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 22:59:14,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:14,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:14,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:14,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:14,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:14,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:14,650 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 22:59:14,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:14,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:15,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:15,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:15,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:15,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997869162] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:15,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-13 22:59:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431176610] [2025-04-13 22:59:15,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:15,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:59:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:15,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:59:15,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:59:15,234 INFO L87 Difference]: Start difference. First operand 349 states and 1145 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:16,054 INFO L93 Difference]: Finished difference Result 526 states and 1642 transitions. [2025-04-13 22:59:16,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:59:16,054 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:16,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:16,057 INFO L225 Difference]: With dead ends: 526 [2025-04-13 22:59:16,057 INFO L226 Difference]: Without dead ends: 520 [2025-04-13 22:59:16,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:59:16,058 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:16,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:59:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-04-13 22:59:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 347. [2025-04-13 22:59:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.2890173410404624) internal successors, (1138), 346 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1138 transitions. [2025-04-13 22:59:16,067 INFO L79 Accepts]: Start accepts. Automaton has 347 states and 1138 transitions. Word has length 20 [2025-04-13 22:59:16,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:16,067 INFO L485 AbstractCegarLoop]: Abstraction has 347 states and 1138 transitions. [2025-04-13 22:59:16,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,067 INFO L278 IsEmpty]: Start isEmpty. Operand 347 states and 1138 transitions. [2025-04-13 22:59:16,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:16,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:16,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:16,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:16,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:59:16,270 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:16,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1031858244, now seen corresponding path program 14 times [2025-04-13 22:59:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:16,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060343307] [2025-04-13 22:59:16,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:16,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:16,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:16,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:16,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:16,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060343307] [2025-04-13 22:59:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060343307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:16,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411232768] [2025-04-13 22:59:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:16,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:16,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:16,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:16,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:16,462 INFO L87 Difference]: Start difference. First operand 347 states and 1138 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:16,660 INFO L93 Difference]: Finished difference Result 407 states and 1303 transitions. [2025-04-13 22:59:16,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:16,660 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:16,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:16,662 INFO L225 Difference]: With dead ends: 407 [2025-04-13 22:59:16,662 INFO L226 Difference]: Without dead ends: 401 [2025-04-13 22:59:16,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:59:16,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:16,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-04-13 22:59:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 349. [2025-04-13 22:59:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.2902298850574714) internal successors, (1145), 348 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1145 transitions. [2025-04-13 22:59:16,671 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1145 transitions. Word has length 20 [2025-04-13 22:59:16,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:16,671 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1145 transitions. [2025-04-13 22:59:16,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:16,671 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1145 transitions. [2025-04-13 22:59:16,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:16,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:16,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:16,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:59:16,672 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:16,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 731997248, now seen corresponding path program 15 times [2025-04-13 22:59:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:16,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193067206] [2025-04-13 22:59:16,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:16,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:16,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:16,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:16,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:16,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193067206] [2025-04-13 22:59:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193067206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:16,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648978866] [2025-04-13 22:59:16,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:16,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:16,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:16,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:16,927 INFO L87 Difference]: Start difference. First operand 349 states and 1145 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:17,084 INFO L93 Difference]: Finished difference Result 403 states and 1287 transitions. [2025-04-13 22:59:17,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:59:17,084 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:17,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:17,086 INFO L225 Difference]: With dead ends: 403 [2025-04-13 22:59:17,086 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 22:59:17,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:17,087 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:17,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 22:59:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 349. [2025-04-13 22:59:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.2902298850574714) internal successors, (1145), 348 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1145 transitions. [2025-04-13 22:59:17,094 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1145 transitions. Word has length 20 [2025-04-13 22:59:17,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:17,094 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1145 transitions. [2025-04-13 22:59:17,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,094 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1145 transitions. [2025-04-13 22:59:17,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:17,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:17,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:17,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:59:17,095 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:17,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1837299106, now seen corresponding path program 16 times [2025-04-13 22:59:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:17,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135528817] [2025-04-13 22:59:17,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:17,101 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:17,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:17,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:17,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:17,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135528817] [2025-04-13 22:59:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135528817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136774514] [2025-04-13 22:59:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:17,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:17,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:17,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:17,332 INFO L87 Difference]: Start difference. First operand 349 states and 1145 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:17,476 INFO L93 Difference]: Finished difference Result 395 states and 1264 transitions. [2025-04-13 22:59:17,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:17,476 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:17,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:17,478 INFO L225 Difference]: With dead ends: 395 [2025-04-13 22:59:17,478 INFO L226 Difference]: Without dead ends: 389 [2025-04-13 22:59:17,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:17,479 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:17,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-04-13 22:59:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 355. [2025-04-13 22:59:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.2937853107344632) internal successors, (1166), 354 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1166 transitions. [2025-04-13 22:59:17,486 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 1166 transitions. Word has length 20 [2025-04-13 22:59:17,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:17,486 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 1166 transitions. [2025-04-13 22:59:17,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:17,486 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 1166 transitions. [2025-04-13 22:59:17,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:17,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:17,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:17,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:59:17,487 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:17,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash -926690374, now seen corresponding path program 17 times [2025-04-13 22:59:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:17,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567565878] [2025-04-13 22:59:17,488 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:17,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:17,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:17,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:17,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:17,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567565878] [2025-04-13 22:59:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567565878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:17,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991163743] [2025-04-13 22:59:17,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:17,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:17,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 22:59:17,875 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:17,888 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:17,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:17,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:17,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:17,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:17,907 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 22:59:18,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:18,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:18,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:18,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:18,506 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:18,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991163743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:18,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66004137] [2025-04-13 22:59:18,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:18,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:18,512 INFO L87 Difference]: Start difference. First operand 355 states and 1166 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:19,865 INFO L93 Difference]: Finished difference Result 963 states and 3134 transitions. [2025-04-13 22:59:19,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:59:19,865 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:19,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:19,869 INFO L225 Difference]: With dead ends: 963 [2025-04-13 22:59:19,869 INFO L226 Difference]: Without dead ends: 872 [2025-04-13 22:59:19,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:59:19,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:19,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:59:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-04-13 22:59:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 365. [2025-04-13 22:59:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.3104395604395602) internal successors, (1205), 364 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1205 transitions. [2025-04-13 22:59:19,885 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1205 transitions. Word has length 20 [2025-04-13 22:59:19,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:19,885 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1205 transitions. [2025-04-13 22:59:19,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:19,885 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1205 transitions. [2025-04-13 22:59:19,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:19,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:19,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:19,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:20,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:20,090 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:20,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1342089822, now seen corresponding path program 18 times [2025-04-13 22:59:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:20,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518530592] [2025-04-13 22:59:20,090 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:20,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:20,100 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:20,100 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:20,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:20,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518530592] [2025-04-13 22:59:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518530592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:20,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:20,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238325432] [2025-04-13 22:59:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:20,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:20,271 INFO L87 Difference]: Start difference. First operand 365 states and 1205 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:20,447 INFO L93 Difference]: Finished difference Result 417 states and 1342 transitions. [2025-04-13 22:59:20,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:20,448 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:20,448 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:20,450 INFO L225 Difference]: With dead ends: 417 [2025-04-13 22:59:20,450 INFO L226 Difference]: Without dead ends: 411 [2025-04-13 22:59:20,450 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:59:20,450 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:20,451 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-13 22:59:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 363. [2025-04-13 22:59:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 3.314917127071823) internal successors, (1200), 362 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1200 transitions. [2025-04-13 22:59:20,458 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 1200 transitions. Word has length 20 [2025-04-13 22:59:20,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:20,458 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 1200 transitions. [2025-04-13 22:59:20,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:20,458 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 1200 transitions. [2025-04-13 22:59:20,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:20,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:20,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:20,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:59:20,459 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:20,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1189021982, now seen corresponding path program 19 times [2025-04-13 22:59:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:20,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145728629] [2025-04-13 22:59:20,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:20,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:20,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:20,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:20,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:20,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145728629] [2025-04-13 22:59:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145728629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:20,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901850092] [2025-04-13 22:59:20,745 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:20,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:20,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:59:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:20,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:20,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:20,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:20,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:20,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:20,808 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 22:59:20,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 22:59:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:21,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:21,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:21,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:21,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:21,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901850092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:21,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67966337] [2025-04-13 22:59:21,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:21,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:21,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:21,462 INFO L87 Difference]: Start difference. First operand 363 states and 1200 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:22,547 INFO L93 Difference]: Finished difference Result 711 states and 2316 transitions. [2025-04-13 22:59:22,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:59:22,547 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:22,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:22,551 INFO L225 Difference]: With dead ends: 711 [2025-04-13 22:59:22,551 INFO L226 Difference]: Without dead ends: 705 [2025-04-13 22:59:22,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=1662, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:59:22,552 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:22,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:59:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-04-13 22:59:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 359. [2025-04-13 22:59:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.3184357541899443) internal successors, (1188), 358 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1188 transitions. [2025-04-13 22:59:22,562 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 1188 transitions. Word has length 20 [2025-04-13 22:59:22,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:22,562 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 1188 transitions. [2025-04-13 22:59:22,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:22,562 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 1188 transitions. [2025-04-13 22:59:22,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:59:22,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:22,563 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:22,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:59:22,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:22,764 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:22,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1649268904, now seen corresponding path program 20 times [2025-04-13 22:59:22,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:22,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107196917] [2025-04-13 22:59:22,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:22,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:59:22,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 22:59:22,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:23,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:23,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107196917] [2025-04-13 22:59:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107196917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:23,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294126620] [2025-04-13 22:59:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:23,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:23,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:23,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:23,009 INFO L87 Difference]: Start difference. First operand 359 states and 1188 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:23,161 INFO L93 Difference]: Finished difference Result 417 states and 1330 transitions. [2025-04-13 22:59:23,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:23,162 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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 22:59:23,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:23,164 INFO L225 Difference]: With dead ends: 417 [2025-04-13 22:59:23,164 INFO L226 Difference]: Without dead ends: 411 [2025-04-13 22:59:23,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:23,164 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:23,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-13 22:59:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 351. [2025-04-13 22:59:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.342857142857143) internal successors, (1170), 350 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1170 transitions. [2025-04-13 22:59:23,171 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 1170 transitions. Word has length 21 [2025-04-13 22:59:23,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:23,171 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 1170 transitions. [2025-04-13 22:59:23,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,171 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 1170 transitions. [2025-04-13 22:59:23,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:59:23,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:23,172 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:23,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:59:23,172 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:23,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1284110836, now seen corresponding path program 21 times [2025-04-13 22:59:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:23,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533000939] [2025-04-13 22:59:23,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:23,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:59:23,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 22:59:23,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:23,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:23,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533000939] [2025-04-13 22:59:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533000939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006736856] [2025-04-13 22:59:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:23,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:23,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:23,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:23,389 INFO L87 Difference]: Start difference. First operand 351 states and 1170 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:23,596 INFO L93 Difference]: Finished difference Result 437 states and 1416 transitions. [2025-04-13 22:59:23,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:23,597 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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 22:59:23,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:23,599 INFO L225 Difference]: With dead ends: 437 [2025-04-13 22:59:23,599 INFO L226 Difference]: Without dead ends: 431 [2025-04-13 22:59:23,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:23,599 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:23,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-04-13 22:59:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 344. [2025-04-13 22:59:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.3556851311953353) internal successors, (1151), 343 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1151 transitions. [2025-04-13 22:59:23,607 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 1151 transitions. Word has length 21 [2025-04-13 22:59:23,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:23,607 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 1151 transitions. [2025-04-13 22:59:23,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,607 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 1151 transitions. [2025-04-13 22:59:23,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:59:23,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:23,608 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:23,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:59:23,608 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:23,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -497953476, now seen corresponding path program 22 times [2025-04-13 22:59:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:23,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450520490] [2025-04-13 22:59:23,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:23,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:59:23,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:59:23,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:23,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:23,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450520490] [2025-04-13 22:59:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450520490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:23,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148128547] [2025-04-13 22:59:23,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:23,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:59:23,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:59:23,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:59:23,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:23,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:23,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:59:23,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:23,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148128547] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:59:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 22:59:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204673256] [2025-04-13 22:59:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:23,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:23,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:23,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:23,784 INFO L87 Difference]: Start difference. First operand 344 states and 1151 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:23,879 INFO L93 Difference]: Finished difference Result 717 states and 2389 transitions. [2025-04-13 22:59:23,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:59:23,879 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:59:23,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:23,884 INFO L225 Difference]: With dead ends: 717 [2025-04-13 22:59:23,885 INFO L226 Difference]: Without dead ends: 630 [2025-04-13 22:59:23,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:23,886 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:23,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-04-13 22:59:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 438. [2025-04-13 22:59:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.416475972540046) internal successors, (1493), 437 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1493 transitions. [2025-04-13 22:59:23,901 INFO L79 Accepts]: Start accepts. Automaton has 438 states and 1493 transitions. Word has length 21 [2025-04-13 22:59:23,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:23,901 INFO L485 AbstractCegarLoop]: Abstraction has 438 states and 1493 transitions. [2025-04-13 22:59:23,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,905 INFO L278 IsEmpty]: Start isEmpty. Operand 438 states and 1493 transitions. [2025-04-13 22:59:23,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:59:23,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:23,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:23,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:59:24,110 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,SelfDestructingSolverStorable24 [2025-04-13 22:59:24,110 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:24,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1065618037, now seen corresponding path program 1 times [2025-04-13 22:59:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:24,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232302059] [2025-04-13 22:59:24,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:24,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232302059] [2025-04-13 22:59:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232302059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:24,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094347067] [2025-04-13 22:59:24,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:24,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:24,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:59:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:24,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:24,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:59:24,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094347067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:24,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 22:59:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507174969] [2025-04-13 22:59:24,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:24,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:24,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:24,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:24,247 INFO L87 Difference]: Start difference. First operand 438 states and 1493 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:24,320 INFO L93 Difference]: Finished difference Result 708 states and 2281 transitions. [2025-04-13 22:59:24,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:59:24,320 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:59:24,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:24,322 INFO L225 Difference]: With dead ends: 708 [2025-04-13 22:59:24,322 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 22:59:24,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:24,323 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:24,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 22:59:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 419. [2025-04-13 22:59:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 3.3014354066985647) internal successors, (1380), 418 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1380 transitions. [2025-04-13 22:59:24,345 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 1380 transitions. Word has length 22 [2025-04-13 22:59:24,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:24,345 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 1380 transitions. [2025-04-13 22:59:24,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,345 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 1380 transitions. [2025-04-13 22:59:24,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:59:24,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:24,346 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:24,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:59:24,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 22:59:24,547 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:24,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1338974847, now seen corresponding path program 1 times [2025-04-13 22:59:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:24,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967227623] [2025-04-13 22:59:24,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:24,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:24,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:24,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:24,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:24,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967227623] [2025-04-13 22:59:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967227623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:24,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115593914] [2025-04-13 22:59:24,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:24,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 22:59:24,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:24,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:24,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:24,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:24,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:59:24,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115593914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:24,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:24,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:59:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387826222] [2025-04-13 22:59:24,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:24,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:59:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:24,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:59:24,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:24,707 INFO L87 Difference]: Start difference. First operand 419 states and 1380 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:24,776 INFO L93 Difference]: Finished difference Result 512 states and 1610 transitions. [2025-04-13 22:59:24,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:59:24,776 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:59:24,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:24,778 INFO L225 Difference]: With dead ends: 512 [2025-04-13 22:59:24,778 INFO L226 Difference]: Without dead ends: 420 [2025-04-13 22:59:24,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:24,779 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:24,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-04-13 22:59:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 406. [2025-04-13 22:59:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.2222222222222223) internal successors, (1305), 405 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1305 transitions. [2025-04-13 22:59:24,786 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1305 transitions. Word has length 22 [2025-04-13 22:59:24,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:24,786 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1305 transitions. [2025-04-13 22:59:24,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:24,786 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1305 transitions. [2025-04-13 22:59:24,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:59:24,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:24,787 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:24,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:59:24,987 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,SelfDestructingSolverStorable26 [2025-04-13 22:59:24,988 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:24,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 289438485, now seen corresponding path program 1 times [2025-04-13 22:59:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:24,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598988790] [2025-04-13 22:59:24,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:24,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:24,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:24,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:25,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598988790] [2025-04-13 22:59:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598988790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:25,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776499246] [2025-04-13 22:59:25,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:25,034 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:25,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 22:59:25,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:59:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:59:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:25,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:59:25,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:25,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776499246] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:25,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:59:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495848161] [2025-04-13 22:59:25,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:25,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:59:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:25,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:59:25,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:25,187 INFO L87 Difference]: Start difference. First operand 406 states and 1305 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:25,263 INFO L93 Difference]: Finished difference Result 420 states and 1328 transitions. [2025-04-13 22:59:25,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:59:25,263 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:59:25,263 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:25,264 INFO L225 Difference]: With dead ends: 420 [2025-04-13 22:59:25,264 INFO L226 Difference]: Without dead ends: 279 [2025-04-13 22:59:25,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:25,265 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:25,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-13 22:59:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-04-13 22:59:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.4820143884892087) internal successors, (968), 278 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 968 transitions. [2025-04-13 22:59:25,270 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 968 transitions. Word has length 22 [2025-04-13 22:59:25,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:25,270 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 968 transitions. [2025-04-13 22:59:25,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,270 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 968 transitions. [2025-04-13 22:59:25,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:25,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:25,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:25,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:25,471 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,SelfDestructingSolverStorable27 [2025-04-13 22:59:25,471 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:25,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 698695581, now seen corresponding path program 2 times [2025-04-13 22:59:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:25,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707027510] [2025-04-13 22:59:25,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:25,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:25,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:25,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:25,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:25,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707027510] [2025-04-13 22:59:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707027510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:25,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086077965] [2025-04-13 22:59:25,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:25,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:25,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 22:59:25,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:25,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:25,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:25,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:25,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:59:25,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:59:25,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:59:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086077965] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:59:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 22:59:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282171318] [2025-04-13 22:59:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:25,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:59:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:25,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:59:25,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:25,671 INFO L87 Difference]: Start difference. First operand 279 states and 968 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:25,729 INFO L93 Difference]: Finished difference Result 393 states and 1234 transitions. [2025-04-13 22:59:25,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:25,730 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:25,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:25,732 INFO L225 Difference]: With dead ends: 393 [2025-04-13 22:59:25,732 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 22:59:25,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:59:25,732 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:25,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:59:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 22:59:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 333. [2025-04-13 22:59:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.2951807228915664) internal successors, (1094), 332 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1094 transitions. [2025-04-13 22:59:25,739 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 1094 transitions. Word has length 23 [2025-04-13 22:59:25,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:25,739 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 1094 transitions. [2025-04-13 22:59:25,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:25,739 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 1094 transitions. [2025-04-13 22:59:25,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:25,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:25,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:25,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:25,944 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,SelfDestructingSolverStorable28 [2025-04-13 22:59:25,944 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:25,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -159997227, now seen corresponding path program 3 times [2025-04-13 22:59:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:25,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175596674] [2025-04-13 22:59:25,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:25,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:25,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:25,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:59:25,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:25,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175596674] [2025-04-13 22:59:25,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175596674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:25,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989469965] [2025-04-13 22:59:25,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:25,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:25,982 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:25,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:59:26,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:26,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:26,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:59:26,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:26,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:59:26,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:59:26,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:59:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989469965] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:59:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 22:59:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006552127] [2025-04-13 22:59:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:26,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:59:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:26,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:59:26,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:26,120 INFO L87 Difference]: Start difference. First operand 333 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:26,176 INFO L93 Difference]: Finished difference Result 594 states and 1944 transitions. [2025-04-13 22:59:26,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:26,176 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:26,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:26,179 INFO L225 Difference]: With dead ends: 594 [2025-04-13 22:59:26,179 INFO L226 Difference]: Without dead ends: 578 [2025-04-13 22:59:26,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:59:26,180 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:26,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:59:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-04-13 22:59:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 359. [2025-04-13 22:59:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.416201117318436) internal successors, (1223), 358 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1223 transitions. [2025-04-13 22:59:26,187 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 1223 transitions. Word has length 23 [2025-04-13 22:59:26,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:26,187 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 1223 transitions. [2025-04-13 22:59:26,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,187 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 1223 transitions. [2025-04-13 22:59:26,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:26,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:26,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:26,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:59:26,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:26,388 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:26,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1086489291, now seen corresponding path program 4 times [2025-04-13 22:59:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:26,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947554190] [2025-04-13 22:59:26,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:26,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:26,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 22:59:26,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:59:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:26,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947554190] [2025-04-13 22:59:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947554190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:26,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916063521] [2025-04-13 22:59:26,414 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:26,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:26,416 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:26,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:59:26,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:26,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 22:59:26,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:59:26,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:26,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 22:59:26,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:26,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916063521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:26,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 22:59:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676076779] [2025-04-13 22:59:26,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:26,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:59:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:26,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:59:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:59:26,506 INFO L87 Difference]: Start difference. First operand 359 states and 1223 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:26,713 INFO L93 Difference]: Finished difference Result 664 states and 2288 transitions. [2025-04-13 22:59:26,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:59:26,713 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:26,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:26,716 INFO L225 Difference]: With dead ends: 664 [2025-04-13 22:59:26,716 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 22:59:26,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:59:26,717 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:26,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 22:59:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 380. [2025-04-13 22:59:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.453825857519789) internal successors, (1309), 379 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2025-04-13 22:59:26,725 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 23 [2025-04-13 22:59:26,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:26,725 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2025-04-13 22:59:26,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,725 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2025-04-13 22:59:26,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:26,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:26,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:26,732 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 22:59:26,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:26,926 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:26,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1099095, now seen corresponding path program 5 times [2025-04-13 22:59:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:26,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976959224] [2025-04-13 22:59:26,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:26,930 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:26,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:26,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:26,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:26,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976959224] [2025-04-13 22:59:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976959224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:59:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433596954] [2025-04-13 22:59:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:26,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:26,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:26,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:26,963 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:27,059 INFO L93 Difference]: Finished difference Result 510 states and 1764 transitions. [2025-04-13 22:59:27,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:59:27,059 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:27,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:27,062 INFO L225 Difference]: With dead ends: 510 [2025-04-13 22:59:27,062 INFO L226 Difference]: Without dead ends: 496 [2025-04-13 22:59:27,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:59:27,062 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:27,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-04-13 22:59:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 408. [2025-04-13 22:59:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 3.501228501228501) internal successors, (1425), 407 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1425 transitions. [2025-04-13 22:59:27,073 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1425 transitions. Word has length 23 [2025-04-13 22:59:27,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:27,074 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1425 transitions. [2025-04-13 22:59:27,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,074 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1425 transitions. [2025-04-13 22:59:27,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:27,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:27,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:27,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:59:27,075 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:27,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1432402545, now seen corresponding path program 6 times [2025-04-13 22:59:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:27,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956305370] [2025-04-13 22:59:27,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:27,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 22:59:27,080 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-13 22:59:27,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:27,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:27,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956305370] [2025-04-13 22:59:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956305370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:59:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719744627] [2025-04-13 22:59:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:27,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:27,109 INFO L87 Difference]: Start difference. First operand 408 states and 1425 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:27,230 INFO L93 Difference]: Finished difference Result 513 states and 1710 transitions. [2025-04-13 22:59:27,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:59:27,230 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:27,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:27,233 INFO L225 Difference]: With dead ends: 513 [2025-04-13 22:59:27,233 INFO L226 Difference]: Without dead ends: 503 [2025-04-13 22:59:27,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:59:27,234 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:27,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-04-13 22:59:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 408. [2025-04-13 22:59:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 3.501228501228501) internal successors, (1425), 407 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1425 transitions. [2025-04-13 22:59:27,243 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1425 transitions. Word has length 23 [2025-04-13 22:59:27,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:27,243 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1425 transitions. [2025-04-13 22:59:27,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,243 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1425 transitions. [2025-04-13 22:59:27,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:59:27,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:27,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:27,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:59:27,245 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:27,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2126155353, now seen corresponding path program 7 times [2025-04-13 22:59:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:27,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150773451] [2025-04-13 22:59:27,245 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:27,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 22:59:27,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:27,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:27,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:27,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150773451] [2025-04-13 22:59:27,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150773451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:27,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112392576] [2025-04-13 22:59:27,284 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:27,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:27,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:27,286 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:27,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:59:27,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 22:59:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:59:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:27,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:27,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:59:27,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:27,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112392576] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:59:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 22:59:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135622305] [2025-04-13 22:59:27,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:27,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:59:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:27,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:59:27,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:27,412 INFO L87 Difference]: Start difference. First operand 408 states and 1425 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:27,463 INFO L93 Difference]: Finished difference Result 481 states and 1596 transitions. [2025-04-13 22:59:27,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:27,463 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:59:27,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:27,465 INFO L225 Difference]: With dead ends: 481 [2025-04-13 22:59:27,465 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:59:27,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:59:27,466 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:27,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:59:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:59:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 372. [2025-04-13 22:59:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 3.3827493261455523) internal successors, (1255), 371 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1255 transitions. [2025-04-13 22:59:27,472 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 1255 transitions. Word has length 23 [2025-04-13 22:59:27,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:27,472 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 1255 transitions. [2025-04-13 22:59:27,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:27,472 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 1255 transitions. [2025-04-13 22:59:27,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:59:27,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:27,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:27,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:27,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:27,673 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:27,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -297338948, now seen corresponding path program 1 times [2025-04-13 22:59:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:27,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017205200] [2025-04-13 22:59:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:27,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:59:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:28,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017205200] [2025-04-13 22:59:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017205200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:28,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464930570] [2025-04-13 22:59:28,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:28,155 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:59:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:59:28,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:28,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:28,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:28,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:59:28,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:28,602 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:28,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 22:59:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:28,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:29,365 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:29,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 22:59:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464930570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:30,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 22:59:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73412308] [2025-04-13 22:59:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:30,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:59:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:30,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:59:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:59:30,298 INFO L87 Difference]: Start difference. First operand 372 states and 1255 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:33,739 INFO L93 Difference]: Finished difference Result 676 states and 2181 transitions. [2025-04-13 22:59:33,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 22:59:33,739 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:59:33,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:33,742 INFO L225 Difference]: With dead ends: 676 [2025-04-13 22:59:33,742 INFO L226 Difference]: Without dead ends: 660 [2025-04-13 22:59:33,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=648, Invalid=4754, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:59:33,743 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:33,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 0 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2928 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:59:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-13 22:59:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 453. [2025-04-13 22:59:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.398230088495575) internal successors, (1536), 452 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1536 transitions. [2025-04-13 22:59:33,750 INFO L79 Accepts]: Start accepts. Automaton has 453 states and 1536 transitions. Word has length 25 [2025-04-13 22:59:33,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:33,751 INFO L485 AbstractCegarLoop]: Abstraction has 453 states and 1536 transitions. [2025-04-13 22:59:33,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:33,751 INFO L278 IsEmpty]: Start isEmpty. Operand 453 states and 1536 transitions. [2025-04-13 22:59:33,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:59:33,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:33,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:33,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:59:33,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 22:59:33,952 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:33,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -196980906, now seen corresponding path program 2 times [2025-04-13 22:59:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:33,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545627876] [2025-04-13 22:59:33,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:33,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:33,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:33,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:34,437 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 22:59:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:34,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545627876] [2025-04-13 22:59:34,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545627876] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:34,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91974233] [2025-04-13 22:59:34,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:34,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:34,439 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:34,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:59:34,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:34,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:34,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:34,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:59:34,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:34,939 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:34,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 22:59:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:35,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:35,695 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:35,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 22:59:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91974233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:36,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:36,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 34 [2025-04-13 22:59:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636148416] [2025-04-13 22:59:36,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:36,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:59:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:36,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:59:36,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:59:36,023 INFO L87 Difference]: Start difference. First operand 453 states and 1536 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:40,499 INFO L93 Difference]: Finished difference Result 896 states and 2990 transitions. [2025-04-13 22:59:40,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 22:59:40,499 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:59:40,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:40,502 INFO L225 Difference]: With dead ends: 896 [2025-04-13 22:59:40,502 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 22:59:40,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1280, Invalid=7462, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 22:59:40,504 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:40,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:59:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 22:59:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 517. [2025-04-13 22:59:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.358527131782946) internal successors, (1733), 516 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1733 transitions. [2025-04-13 22:59:40,516 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1733 transitions. Word has length 25 [2025-04-13 22:59:40,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:40,516 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1733 transitions. [2025-04-13 22:59:40,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:40,517 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1733 transitions. [2025-04-13 22:59:40,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:59:40,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:40,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:40,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 22:59:40,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:40,720 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:40,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1601387322, now seen corresponding path program 3 times [2025-04-13 22:59:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:40,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036656292] [2025-04-13 22:59:40,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:40,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:40,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:40,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:59:40,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:41,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036656292] [2025-04-13 22:59:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036656292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:41,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429491134] [2025-04-13 22:59:41,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:41,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:41,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:59:41,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:41,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:41,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:59:41,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:41,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:59:41,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:41,816 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:41,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 22:59:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:42,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:42,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:42,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 267 treesize of output 127 [2025-04-13 22:59:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429491134] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:42,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 22:59:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252233797] [2025-04-13 22:59:42,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:42,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:59:42,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:42,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:59:42,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:59:42,968 INFO L87 Difference]: Start difference. First operand 517 states and 1733 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:47,781 INFO L93 Difference]: Finished difference Result 971 states and 3170 transitions. [2025-04-13 22:59:47,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 22:59:47,783 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:59:47,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:47,790 INFO L225 Difference]: With dead ends: 971 [2025-04-13 22:59:47,790 INFO L226 Difference]: Without dead ends: 950 [2025-04-13 22:59:47,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1553, Invalid=8547, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 22:59:47,792 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:47,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:59:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-04-13 22:59:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 489. [2025-04-13 22:59:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.3913934426229506) internal successors, (1655), 488 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1655 transitions. [2025-04-13 22:59:47,802 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1655 transitions. Word has length 25 [2025-04-13 22:59:47,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:47,802 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1655 transitions. [2025-04-13 22:59:47,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:47,802 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1655 transitions. [2025-04-13 22:59:47,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:59:47,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:47,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:47,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:48,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:48,004 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:48,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2112644532, now seen corresponding path program 4 times [2025-04-13 22:59:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:48,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521764366] [2025-04-13 22:59:48,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:48,009 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:48,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:48,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:48,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:48,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521764366] [2025-04-13 22:59:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521764366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:48,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189094458] [2025-04-13 22:59:48,366 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:48,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:48,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:48,368 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:48,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 22:59:48,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:48,422 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:48,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:48,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:48,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:59:48,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:48,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:48,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 22:59:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:48,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:49,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:49,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 22:59:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189094458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:50,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2025-04-13 22:59:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087971139] [2025-04-13 22:59:50,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:50,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:59:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:50,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:59:50,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:59:50,536 INFO L87 Difference]: Start difference. First operand 489 states and 1655 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:53,412 INFO L93 Difference]: Finished difference Result 788 states and 2611 transitions. [2025-04-13 22:59:53,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 22:59:53,412 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:59:53,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:53,414 INFO L225 Difference]: With dead ends: 788 [2025-04-13 22:59:53,415 INFO L226 Difference]: Without dead ends: 777 [2025-04-13 22:59:53,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=797, Invalid=5845, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 22:59:53,416 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:53,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:59:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-04-13 22:59:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 574. [2025-04-13 22:59:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.3891797556719023) internal successors, (1942), 573 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1942 transitions. [2025-04-13 22:59:53,427 INFO L79 Accepts]: Start accepts. Automaton has 574 states and 1942 transitions. Word has length 25 [2025-04-13 22:59:53,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:53,427 INFO L485 AbstractCegarLoop]: Abstraction has 574 states and 1942 transitions. [2025-04-13 22:59:53,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,427 INFO L278 IsEmpty]: Start isEmpty. Operand 574 states and 1942 transitions. [2025-04-13 22:59:53,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:59:53,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:53,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:53,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 22:59:53,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:53,629 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:53,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 708238116, now seen corresponding path program 5 times [2025-04-13 22:59:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:53,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236371209] [2025-04-13 22:59:53,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:53,636 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:53,643 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:53,643 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:54,256 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 22:59:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:54,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236371209] [2025-04-13 22:59:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236371209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:54,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284757077] [2025-04-13 22:59:54,256 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:54,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:54,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:54,258 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 22:59:54,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:59:54,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:59:54,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:54,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:59:54,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:54,730 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:54,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 22:59:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:54,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:55,558 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:59:55,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 22:59:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284757077] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:56,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 22:59:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346706145] [2025-04-13 22:59:56,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:56,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:59:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:59:56,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:59:56,471 INFO L87 Difference]: Start difference. First operand 574 states and 1942 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:00,565 INFO L93 Difference]: Finished difference Result 1046 states and 3400 transitions. [2025-04-13 23:00:00,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:00:00,565 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:00,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:00,568 INFO L225 Difference]: With dead ends: 1046 [2025-04-13 23:00:00,568 INFO L226 Difference]: Without dead ends: 1035 [2025-04-13 23:00:00,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=852, Invalid=6630, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 23:00:00,569 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:00,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:00:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-04-13 23:00:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 598. [2025-04-13 23:00:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 3.370184254606365) internal successors, (2012), 597 states have internal predecessors, (2012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 2012 transitions. [2025-04-13 23:00:00,581 INFO L79 Accepts]: Start accepts. Automaton has 598 states and 2012 transitions. Word has length 25 [2025-04-13 23:00:00,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:00,581 INFO L485 AbstractCegarLoop]: Abstraction has 598 states and 2012 transitions. [2025-04-13 23:00:00,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,581 INFO L278 IsEmpty]: Start isEmpty. Operand 598 states and 2012 transitions. [2025-04-13 23:00:00,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:00,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:00,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:00,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 23:00:00,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 23:00:00,783 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:00,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1876672622, now seen corresponding path program 6 times [2025-04-13 23:00:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:00,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112308696] [2025-04-13 23:00:00,783 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:00,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:00,793 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:00,794 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:01,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112308696] [2025-04-13 23:00:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112308696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:01,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58213159] [2025-04-13 23:00:01,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:01,217 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:01,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 23:00:01,260 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:01,275 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:01,275 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:01,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:00:01,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:01,648 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:01,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:00:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:01,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:02,556 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:02,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:00:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58213159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:02,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:00:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435986076] [2025-04-13 23:00:02,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:02,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:02,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:02,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:02,916 INFO L87 Difference]: Start difference. First operand 598 states and 2012 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:07,519 INFO L93 Difference]: Finished difference Result 1103 states and 3695 transitions. [2025-04-13 23:00:07,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:00:07,519 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:07,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:07,522 INFO L225 Difference]: With dead ends: 1103 [2025-04-13 23:00:07,522 INFO L226 Difference]: Without dead ends: 1092 [2025-04-13 23:00:07,523 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1380, Invalid=8126, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:00:07,523 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:07,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:00:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-04-13 23:00:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 632. [2025-04-13 23:00:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 3.345483359746434) internal successors, (2111), 631 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 2111 transitions. [2025-04-13 23:00:07,533 INFO L79 Accepts]: Start accepts. Automaton has 632 states and 2111 transitions. Word has length 25 [2025-04-13 23:00:07,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:07,534 INFO L485 AbstractCegarLoop]: Abstraction has 632 states and 2111 transitions. [2025-04-13 23:00:07,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:07,534 INFO L278 IsEmpty]: Start isEmpty. Operand 632 states and 2111 transitions. [2025-04-13 23:00:07,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:07,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:07,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:07,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 23:00:07,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 23:00:07,735 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:07,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1013888258, now seen corresponding path program 7 times [2025-04-13 23:00:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:07,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180024865] [2025-04-13 23:00:07,736 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:07,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:08,294 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 23:00:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:08,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180024865] [2025-04-13 23:00:08,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180024865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:08,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725039785] [2025-04-13 23:00:08,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:08,296 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:08,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 23:00:08,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:08,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:00:08,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:08,708 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:08,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:00:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:08,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:09,489 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:09,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:00:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725039785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:10,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:00:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032221540] [2025-04-13 23:00:10,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:10,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:10,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:10,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:10,423 INFO L87 Difference]: Start difference. First operand 632 states and 2111 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:15,950 INFO L93 Difference]: Finished difference Result 1067 states and 3373 transitions. [2025-04-13 23:00:15,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 23:00:15,951 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:15,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:15,955 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 23:00:15,955 INFO L226 Difference]: Without dead ends: 1051 [2025-04-13 23:00:15,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1214, Invalid=9706, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 23:00:15,956 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 325 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:15,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 0 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:00:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-04-13 23:00:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 648. [2025-04-13 23:00:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 3.3338485316846986) internal successors, (2157), 647 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 2157 transitions. [2025-04-13 23:00:15,968 INFO L79 Accepts]: Start accepts. Automaton has 648 states and 2157 transitions. Word has length 25 [2025-04-13 23:00:15,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:15,968 INFO L485 AbstractCegarLoop]: Abstraction has 648 states and 2157 transitions. [2025-04-13 23:00:15,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:15,968 INFO L278 IsEmpty]: Start isEmpty. Operand 648 states and 2157 transitions. [2025-04-13 23:00:15,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:15,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:15,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:15,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 23:00:16,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:16,170 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:16,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 281832962, now seen corresponding path program 8 times [2025-04-13 23:00:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:16,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864832234] [2025-04-13 23:00:16,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:16,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:16,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:16,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:16,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:16,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:16,653 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 23:00:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:16,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864832234] [2025-04-13 23:00:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864832234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:16,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195399600] [2025-04-13 23:00:16,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:16,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:16,656 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:16,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 23:00:16,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:16,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:16,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:16,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:16,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:17,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:17,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:00:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:17,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:18,033 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:18,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:00:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195399600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:18,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 23:00:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985204591] [2025-04-13 23:00:18,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:18,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:00:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:18,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:00:18,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:00:18,341 INFO L87 Difference]: Start difference. First operand 648 states and 2157 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:22,422 INFO L93 Difference]: Finished difference Result 1067 states and 3423 transitions. [2025-04-13 23:00:22,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:00:22,423 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:22,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:22,426 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 23:00:22,426 INFO L226 Difference]: Without dead ends: 1056 [2025-04-13 23:00:22,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1195, Invalid=8311, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:00:22,427 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 330 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:22,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 0 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:00:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-04-13 23:00:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 676. [2025-04-13 23:00:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.3733333333333335) internal successors, (2277), 675 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2277 transitions. [2025-04-13 23:00:22,438 INFO L79 Accepts]: Start accepts. Automaton has 676 states and 2277 transitions. Word has length 25 [2025-04-13 23:00:22,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:22,438 INFO L485 AbstractCegarLoop]: Abstraction has 676 states and 2277 transitions. [2025-04-13 23:00:22,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:22,439 INFO L278 IsEmpty]: Start isEmpty. Operand 676 states and 2277 transitions. [2025-04-13 23:00:22,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:22,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:22,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:22,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 23:00:22,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:22,640 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:22,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1122573454, now seen corresponding path program 9 times [2025-04-13 23:00:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:22,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471452007] [2025-04-13 23:00:22,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:22,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:22,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:22,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:22,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:23,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471452007] [2025-04-13 23:00:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471452007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:23,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558197990] [2025-04-13 23:00:23,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:23,053 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:23,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 23:00:23,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:23,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:23,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:23,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:23,492 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:23,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:00:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:23,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:24,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:24,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 267 treesize of output 127 [2025-04-13 23:00:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558197990] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:24,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:00:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222607795] [2025-04-13 23:00:24,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:24,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:24,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:24,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:24,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:24,661 INFO L87 Difference]: Start difference. First operand 676 states and 2277 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:29,386 INFO L93 Difference]: Finished difference Result 1127 states and 3624 transitions. [2025-04-13 23:00:29,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:00:29,386 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:29,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:29,390 INFO L225 Difference]: With dead ends: 1127 [2025-04-13 23:00:29,390 INFO L226 Difference]: Without dead ends: 1116 [2025-04-13 23:00:29,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1243, Invalid=8459, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:00:29,391 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:29,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:00:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-04-13 23:00:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 682. [2025-04-13 23:00:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 3.356828193832599) internal successors, (2286), 681 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2286 transitions. [2025-04-13 23:00:29,403 INFO L79 Accepts]: Start accepts. Automaton has 682 states and 2286 transitions. Word has length 25 [2025-04-13 23:00:29,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:29,404 INFO L485 AbstractCegarLoop]: Abstraction has 682 states and 2286 transitions. [2025-04-13 23:00:29,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,404 INFO L278 IsEmpty]: Start isEmpty. Operand 682 states and 2286 transitions. [2025-04-13 23:00:29,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:29,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:29,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:29,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:29,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:29,606 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:29,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2088654172, now seen corresponding path program 10 times [2025-04-13 23:00:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:29,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874174264] [2025-04-13 23:00:29,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:29,610 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:29,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:29,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:29,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874174264] [2025-04-13 23:00:29,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874174264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:29,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104436813] [2025-04-13 23:00:29,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:29,901 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:29,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 23:00:29,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:29,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:29,960 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:29,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:29,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:30,286 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:30,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:00:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:30,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:30,901 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:30,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:00:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104436813] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:31,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2025-04-13 23:00:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240705219] [2025-04-13 23:00:31,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:31,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:00:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:31,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:00:31,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:00:31,758 INFO L87 Difference]: Start difference. First operand 682 states and 2286 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:34,383 INFO L93 Difference]: Finished difference Result 911 states and 3028 transitions. [2025-04-13 23:00:34,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:00:34,383 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:34,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:34,386 INFO L225 Difference]: With dead ends: 911 [2025-04-13 23:00:34,386 INFO L226 Difference]: Without dead ends: 900 [2025-04-13 23:00:34,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=667, Invalid=4735, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:00:34,387 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:34,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:00:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-04-13 23:00:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 722. [2025-04-13 23:00:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 3.36754507628294) internal successors, (2428), 721 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2428 transitions. [2025-04-13 23:00:34,397 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 2428 transitions. Word has length 25 [2025-04-13 23:00:34,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:34,398 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 2428 transitions. [2025-04-13 23:00:34,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:34,398 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 2428 transitions. [2025-04-13 23:00:34,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:34,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:34,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:34,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 23:00:34,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 23:00:34,599 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:34,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1070688798, now seen corresponding path program 11 times [2025-04-13 23:00:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:34,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809056699] [2025-04-13 23:00:34,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:34,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:34,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:34,609 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:35,086 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 23:00:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:35,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809056699] [2025-04-13 23:00:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809056699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:35,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468972338] [2025-04-13 23:00:35,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:35,089 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 23:00:35,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:35,145 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:35,145 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:35,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:00:35,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:35,497 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:35,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:00:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:35,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:36,280 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:36,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:00:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468972338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:37,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 32 [2025-04-13 23:00:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998171972] [2025-04-13 23:00:37,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:37,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:00:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:00:37,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:00:37,051 INFO L87 Difference]: Start difference. First operand 722 states and 2428 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:40,838 INFO L93 Difference]: Finished difference Result 1106 states and 3639 transitions. [2025-04-13 23:00:40,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:00:40,838 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:40,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:40,842 INFO L225 Difference]: With dead ends: 1106 [2025-04-13 23:00:40,842 INFO L226 Difference]: Without dead ends: 1082 [2025-04-13 23:00:40,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=753, Invalid=5727, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 23:00:40,842 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:40,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:00:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-04-13 23:00:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 767. [2025-04-13 23:00:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 3.370757180156658) internal successors, (2582), 766 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2582 transitions. [2025-04-13 23:00:40,856 INFO L79 Accepts]: Start accepts. Automaton has 767 states and 2582 transitions. Word has length 25 [2025-04-13 23:00:40,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:40,856 INFO L485 AbstractCegarLoop]: Abstraction has 767 states and 2582 transitions. [2025-04-13 23:00:40,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:40,856 INFO L278 IsEmpty]: Start isEmpty. Operand 767 states and 2582 transitions. [2025-04-13 23:00:40,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:40,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:40,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:40,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 23:00:41,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 23:00:41,058 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:41,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -269390856, now seen corresponding path program 12 times [2025-04-13 23:00:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:41,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657291614] [2025-04-13 23:00:41,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:41,063 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:41,074 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:41,074 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:41,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:41,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657291614] [2025-04-13 23:00:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657291614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:41,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573746105] [2025-04-13 23:00:41,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:41,491 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:41,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 23:00:41,534 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:41,548 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:41,548 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:41,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:00:41,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:42,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:42,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:00:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:42,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:42,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:42,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:00:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573746105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:43,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:00:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467156435] [2025-04-13 23:00:43,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:43,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:43,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:43,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:43,155 INFO L87 Difference]: Start difference. First operand 767 states and 2582 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:45,308 INFO L93 Difference]: Finished difference Result 946 states and 3129 transitions. [2025-04-13 23:00:45,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:00:45,308 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:45,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:45,311 INFO L225 Difference]: With dead ends: 946 [2025-04-13 23:00:45,311 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 23:00:45,311 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:00:45,311 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:45,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:00:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 23:00:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 787. [2025-04-13 23:00:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.3638676844783717) internal successors, (2644), 786 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2644 transitions. [2025-04-13 23:00:45,322 INFO L79 Accepts]: Start accepts. Automaton has 787 states and 2644 transitions. Word has length 25 [2025-04-13 23:00:45,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:45,322 INFO L485 AbstractCegarLoop]: Abstraction has 787 states and 2644 transitions. [2025-04-13 23:00:45,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,322 INFO L278 IsEmpty]: Start isEmpty. Operand 787 states and 2644 transitions. [2025-04-13 23:00:45,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:45,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:45,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:45,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 23:00:45,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 23:00:45,523 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:45,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1673797272, now seen corresponding path program 13 times [2025-04-13 23:00:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:45,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646953602] [2025-04-13 23:00:45,524 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:45,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:45,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:45,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:46,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646953602] [2025-04-13 23:00:46,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646953602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:46,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054352200] [2025-04-13 23:00:46,201 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:46,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:46,204 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:46,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 23:00:46,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:46,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:46,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:00:46,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:46,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:46,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:00:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:46,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:47,583 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:47,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:00:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054352200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:48,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:00:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465871326] [2025-04-13 23:00:48,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:48,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:48,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:48,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:48,440 INFO L87 Difference]: Start difference. First operand 787 states and 2644 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:51,582 INFO L93 Difference]: Finished difference Result 1027 states and 3324 transitions. [2025-04-13 23:00:51,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:00:51,583 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:51,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:51,585 INFO L225 Difference]: With dead ends: 1027 [2025-04-13 23:00:51,585 INFO L226 Difference]: Without dead ends: 1011 [2025-04-13 23:00:51,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=484, Invalid=4208, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 23:00:51,585 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:51,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:00:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-04-13 23:00:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 795. [2025-04-13 23:00:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 3.36272040302267) internal successors, (2670), 794 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2670 transitions. [2025-04-13 23:00:51,596 INFO L79 Accepts]: Start accepts. Automaton has 795 states and 2670 transitions. Word has length 25 [2025-04-13 23:00:51,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:51,596 INFO L485 AbstractCegarLoop]: Abstraction has 795 states and 2670 transitions. [2025-04-13 23:00:51,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:51,597 INFO L278 IsEmpty]: Start isEmpty. Operand 795 states and 2670 transitions. [2025-04-13 23:00:51,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:51,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:51,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:51,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 23:00:51,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:51,798 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:51,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash -615886240, now seen corresponding path program 14 times [2025-04-13 23:00:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:51,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204380760] [2025-04-13 23:00:51,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:51,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:51,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:51,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:51,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:52,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204380760] [2025-04-13 23:00:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204380760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:52,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518311144] [2025-04-13 23:00:52,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:52,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:52,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:52,146 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:52,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 23:00:52,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:52,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:52,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:52,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:52,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:52,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:52,634 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:52,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:00:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:52,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:53,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:53,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:00:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518311144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:53,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:00:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663249910] [2025-04-13 23:00:53,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:53,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:00:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:00:53,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:00:53,724 INFO L87 Difference]: Start difference. First operand 795 states and 2670 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:56,732 INFO L93 Difference]: Finished difference Result 1004 states and 3275 transitions. [2025-04-13 23:00:56,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:00:56,732 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:56,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:56,734 INFO L225 Difference]: With dead ends: 1004 [2025-04-13 23:00:56,734 INFO L226 Difference]: Without dead ends: 983 [2025-04-13 23:00:56,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=601, Invalid=4091, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 23:00:56,735 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:56,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:00:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-04-13 23:00:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 809. [2025-04-13 23:00:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 3.3774752475247523) internal successors, (2729), 808 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 2729 transitions. [2025-04-13 23:00:56,747 INFO L79 Accepts]: Start accepts. Automaton has 809 states and 2729 transitions. Word has length 25 [2025-04-13 23:00:56,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:56,747 INFO L485 AbstractCegarLoop]: Abstraction has 809 states and 2729 transitions. [2025-04-13 23:00:56,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,748 INFO L278 IsEmpty]: Start isEmpty. Operand 809 states and 2729 transitions. [2025-04-13 23:00:56,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:56,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:56,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:56,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 23:00:56,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 23:00:56,949 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:56,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1560351260, now seen corresponding path program 15 times [2025-04-13 23:00:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:56,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355073839] [2025-04-13 23:00:56,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:56,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:56,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:56,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:56,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:57,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355073839] [2025-04-13 23:00:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355073839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:57,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787720472] [2025-04-13 23:00:57,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:57,430 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:57,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 23:00:57,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:57,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:57,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:57,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:57,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:57,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:57,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:57,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:00:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:58,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:58,835 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:58,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 263 treesize of output 127 [2025-04-13 23:00:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787720472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:59,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:59,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2025-04-13 23:00:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296602307] [2025-04-13 23:00:59,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:59,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:00:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:59,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:00:59,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:00:59,115 INFO L87 Difference]: Start difference. First operand 809 states and 2729 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:04,767 INFO L93 Difference]: Finished difference Result 1185 states and 3999 transitions. [2025-04-13 23:01:04,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:01:04,767 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:04,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:04,770 INFO L225 Difference]: With dead ends: 1185 [2025-04-13 23:01:04,770 INFO L226 Difference]: Without dead ends: 1174 [2025-04-13 23:01:04,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2541 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1089, Invalid=7283, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 23:01:04,771 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:04,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 3351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:01:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-04-13 23:01:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 821. [2025-04-13 23:01:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.376829268292683) internal successors, (2769), 820 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2769 transitions. [2025-04-13 23:01:04,782 INFO L79 Accepts]: Start accepts. Automaton has 821 states and 2769 transitions. Word has length 25 [2025-04-13 23:01:04,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:04,783 INFO L485 AbstractCegarLoop]: Abstraction has 821 states and 2769 transitions. [2025-04-13 23:01:04,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:04,783 INFO L278 IsEmpty]: Start isEmpty. Operand 821 states and 2769 transitions. [2025-04-13 23:01:04,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:04,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:04,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 23:01:04,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 23:01:04,984 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:04,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 454573364, now seen corresponding path program 16 times [2025-04-13 23:01:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:04,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731400995] [2025-04-13 23:01:04,985 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:04,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:04,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:04,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:04,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:05,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731400995] [2025-04-13 23:01:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731400995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:05,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991433230] [2025-04-13 23:01:05,396 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:05,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:05,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:05,398 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:05,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 23:01:05,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:05,456 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:05,456 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:05,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:05,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:01:05,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:05,824 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:05,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:01:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:05,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:06,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:06,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:01:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991433230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:07,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:01:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325071678] [2025-04-13 23:01:07,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:07,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:01:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:07,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:01:07,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:01:07,385 INFO L87 Difference]: Start difference. First operand 821 states and 2769 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:01:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:10,618 INFO L93 Difference]: Finished difference Result 1093 states and 3530 transitions. [2025-04-13 23:01:10,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:01:10,619 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 25 [2025-04-13 23:01:10,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:10,621 INFO L225 Difference]: With dead ends: 1093 [2025-04-13 23:01:10,621 INFO L226 Difference]: Without dead ends: 1077 [2025-04-13 23:01:10,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=705, Invalid=5937, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:01:10,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3217 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:10,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:01:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-04-13 23:01:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 849. [2025-04-13 23:01:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 3.38561320754717) internal successors, (2871), 848 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2871 transitions. [2025-04-13 23:01:10,634 INFO L79 Accepts]: Start accepts. Automaton has 849 states and 2871 transitions. Word has length 25 [2025-04-13 23:01:10,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:10,634 INFO L485 AbstractCegarLoop]: Abstraction has 849 states and 2871 transitions. [2025-04-13 23:01:10,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:01:10,634 INFO L278 IsEmpty]: Start isEmpty. Operand 849 states and 2871 transitions. [2025-04-13 23:01:10,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:10,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:10,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:10,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 23:01:10,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 23:01:10,836 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:10,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1829133350, now seen corresponding path program 17 times [2025-04-13 23:01:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:10,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765064397] [2025-04-13 23:01:10,836 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:10,841 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:10,849 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:10,849 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:11,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765064397] [2025-04-13 23:01:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765064397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:11,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139344478] [2025-04-13 23:01:11,425 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:11,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:11,427 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:11,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 23:01:11,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:11,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:11,485 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:11,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:01:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:11,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:11,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:01:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:11,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:12,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:12,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:01:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139344478] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:13,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2025-04-13 23:01:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470253957] [2025-04-13 23:01:13,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:13,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:01:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:01:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:13,608 INFO L87 Difference]: Start difference. First operand 849 states and 2871 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:17,816 INFO L93 Difference]: Finished difference Result 1147 states and 3787 transitions. [2025-04-13 23:01:17,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:01:17,817 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:17,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:17,819 INFO L225 Difference]: With dead ends: 1147 [2025-04-13 23:01:17,819 INFO L226 Difference]: Without dead ends: 1136 [2025-04-13 23:01:17,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=560, Invalid=4696, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 23:01:17,820 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:17,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:01:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-04-13 23:01:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 855. [2025-04-13 23:01:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 3.388758782201405) internal successors, (2894), 854 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2894 transitions. [2025-04-13 23:01:17,839 INFO L79 Accepts]: Start accepts. Automaton has 855 states and 2894 transitions. Word has length 25 [2025-04-13 23:01:17,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:17,839 INFO L485 AbstractCegarLoop]: Abstraction has 855 states and 2894 transitions. [2025-04-13 23:01:17,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:17,839 INFO L278 IsEmpty]: Start isEmpty. Operand 855 states and 2894 transitions. [2025-04-13 23:01:17,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:17,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:17,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:17,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 23:01:18,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:18,041 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:18,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1607910648, now seen corresponding path program 18 times [2025-04-13 23:01:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:18,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817380845] [2025-04-13 23:01:18,041 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:18,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:18,052 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:18,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:18,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:18,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817380845] [2025-04-13 23:01:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817380845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:18,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200567473] [2025-04-13 23:01:18,493 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:18,495 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:18,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 23:01:18,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:18,568 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:18,568 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:18,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:18,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:01:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:19,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:01:19,060 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:19,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 23:01:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:19,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:19,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:19,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:01:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200567473] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:20,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:20,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:01:20,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102198398] [2025-04-13 23:01:20,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:20,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:01:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:20,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:01:20,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:01:20,201 INFO L87 Difference]: Start difference. First operand 855 states and 2894 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:25,032 INFO L93 Difference]: Finished difference Result 1197 states and 4114 transitions. [2025-04-13 23:01:25,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 23:01:25,032 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:25,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:25,035 INFO L225 Difference]: With dead ends: 1197 [2025-04-13 23:01:25,035 INFO L226 Difference]: Without dead ends: 1186 [2025-04-13 23:01:25,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2598 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1059, Invalid=7313, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 23:01:25,036 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:25,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:01:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-04-13 23:01:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 855. [2025-04-13 23:01:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 3.388758782201405) internal successors, (2894), 854 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2894 transitions. [2025-04-13 23:01:25,050 INFO L79 Accepts]: Start accepts. Automaton has 855 states and 2894 transitions. Word has length 25 [2025-04-13 23:01:25,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:25,050 INFO L485 AbstractCegarLoop]: Abstraction has 855 states and 2894 transitions. [2025-04-13 23:01:25,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:25,050 INFO L278 IsEmpty]: Start isEmpty. Operand 855 states and 2894 transitions. [2025-04-13 23:01:25,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:25,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:25,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:25,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 23:01:25,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-13 23:01:25,252 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:25,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash 4076890, now seen corresponding path program 19 times [2025-04-13 23:01:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:25,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226343597] [2025-04-13 23:01:25,252 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:25,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:25,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:25,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:25,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:25,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226343597] [2025-04-13 23:01:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226343597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:25,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942027294] [2025-04-13 23:01:25,854 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:25,855 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 23:01:25,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:25,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:25,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:25,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:25,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:01:25,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:26,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:26,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:01:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:26,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:27,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:27,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:01:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942027294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:27,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:01:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641846630] [2025-04-13 23:01:27,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:27,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:01:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:27,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:01:27,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:27,999 INFO L87 Difference]: Start difference. First operand 855 states and 2894 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:32,277 INFO L93 Difference]: Finished difference Result 1120 states and 3650 transitions. [2025-04-13 23:01:32,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:01:32,277 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:32,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:32,279 INFO L225 Difference]: With dead ends: 1120 [2025-04-13 23:01:32,280 INFO L226 Difference]: Without dead ends: 1109 [2025-04-13 23:01:32,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=638, Invalid=6502, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:01:32,280 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:32,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 3627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:01:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-04-13 23:01:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 871. [2025-04-13 23:01:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 3.3885057471264366) internal successors, (2948), 870 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2948 transitions. [2025-04-13 23:01:32,294 INFO L79 Accepts]: Start accepts. Automaton has 871 states and 2948 transitions. Word has length 25 [2025-04-13 23:01:32,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:32,294 INFO L485 AbstractCegarLoop]: Abstraction has 871 states and 2948 transitions. [2025-04-13 23:01:32,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:32,294 INFO L278 IsEmpty]: Start isEmpty. Operand 871 states and 2948 transitions. [2025-04-13 23:01:32,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:32,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:32,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:32,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 23:01:32,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:32,496 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:32,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1010888116, now seen corresponding path program 20 times [2025-04-13 23:01:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:32,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986408785] [2025-04-13 23:01:32,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:32,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:32,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:32,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:32,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986408785] [2025-04-13 23:01:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986408785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:32,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320417741] [2025-04-13 23:01:32,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:32,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:32,894 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:32,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 23:01:32,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:32,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:32,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:32,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:32,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:01:32,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:33,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:01:33,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:33,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 23:01:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:33,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:34,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:34,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:01:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320417741] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:34,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:01:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687969263] [2025-04-13 23:01:34,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:34,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:01:34,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:34,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:01:34,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:01:34,428 INFO L87 Difference]: Start difference. First operand 871 states and 2948 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:37,263 INFO L93 Difference]: Finished difference Result 1233 states and 3973 transitions. [2025-04-13 23:01:37,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:01:37,264 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:37,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:37,266 INFO L225 Difference]: With dead ends: 1233 [2025-04-13 23:01:37,266 INFO L226 Difference]: Without dead ends: 1222 [2025-04-13 23:01:37,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=699, Invalid=4271, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 23:01:37,267 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:37,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:01:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-04-13 23:01:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 900. [2025-04-13 23:01:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 3.389321468298109) internal successors, (3047), 899 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 3047 transitions. [2025-04-13 23:01:37,282 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 3047 transitions. Word has length 25 [2025-04-13 23:01:37,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:37,282 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 3047 transitions. [2025-04-13 23:01:37,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:37,282 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 3047 transitions. [2025-04-13 23:01:37,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:37,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:37,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:37,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 23:01:37,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-13 23:01:37,484 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:37,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 951125022, now seen corresponding path program 21 times [2025-04-13 23:01:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:37,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636527994] [2025-04-13 23:01:37,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:01:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:37,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:37,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:37,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:01:37,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:37,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636527994] [2025-04-13 23:01:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636527994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:37,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374504725] [2025-04-13 23:01:37,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:01:37,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:37,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:37,994 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 23:01:38,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:38,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:38,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:01:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:38,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:01:38,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:38,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:38,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:01:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:38,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:39,431 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:39,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 243 treesize of output 119 [2025-04-13 23:01:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374504725] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:39,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:39,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:01:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944437586] [2025-04-13 23:01:39,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:39,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:01:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:39,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:01:39,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:01:39,710 INFO L87 Difference]: Start difference. First operand 900 states and 3047 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:43,038 INFO L93 Difference]: Finished difference Result 1105 states and 3686 transitions. [2025-04-13 23:01:43,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:01:43,038 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:43,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:43,041 INFO L225 Difference]: With dead ends: 1105 [2025-04-13 23:01:43,041 INFO L226 Difference]: Without dead ends: 1094 [2025-04-13 23:01:43,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=632, Invalid=4624, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 23:01:43,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:43,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:01:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-04-13 23:01:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 908. [2025-04-13 23:01:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 3.3880926130099227) internal successors, (3073), 907 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 3073 transitions. [2025-04-13 23:01:43,053 INFO L79 Accepts]: Start accepts. Automaton has 908 states and 3073 transitions. Word has length 25 [2025-04-13 23:01:43,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:43,053 INFO L485 AbstractCegarLoop]: Abstraction has 908 states and 3073 transitions. [2025-04-13 23:01:43,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:43,053 INFO L278 IsEmpty]: Start isEmpty. Operand 908 states and 3073 transitions. [2025-04-13 23:01:43,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:43,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:43,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:43,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 23:01:43,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:43,255 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:43,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1522110972, now seen corresponding path program 22 times [2025-04-13 23:01:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:43,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983158490] [2025-04-13 23:01:43,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:43,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:43,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:43,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:43,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:43,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983158490] [2025-04-13 23:01:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983158490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:43,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967239906] [2025-04-13 23:01:43,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:43,613 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:43,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 23:01:43,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:43,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:43,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:43,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:43,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:01:43,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:44,113 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:44,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:01:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:44,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:44,639 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:44,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:01:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967239906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:45,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:01:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673785505] [2025-04-13 23:01:45,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:45,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:01:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:45,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:01:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:01:45,488 INFO L87 Difference]: Start difference. First operand 908 states and 3073 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:47,836 INFO L93 Difference]: Finished difference Result 1139 states and 3791 transitions. [2025-04-13 23:01:47,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:01:47,836 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:47,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:47,839 INFO L225 Difference]: With dead ends: 1139 [2025-04-13 23:01:47,839 INFO L226 Difference]: Without dead ends: 1128 [2025-04-13 23:01:47,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=3599, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:01:47,839 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:47,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2767 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:01:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-04-13 23:01:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 924. [2025-04-13 23:01:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 3.3954496208017333) internal successors, (3134), 923 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 3134 transitions. [2025-04-13 23:01:47,850 INFO L79 Accepts]: Start accepts. Automaton has 924 states and 3134 transitions. Word has length 25 [2025-04-13 23:01:47,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:47,850 INFO L485 AbstractCegarLoop]: Abstraction has 924 states and 3134 transitions. [2025-04-13 23:01:47,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:47,851 INFO L278 IsEmpty]: Start isEmpty. Operand 924 states and 3134 transitions. [2025-04-13 23:01:47,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:47,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:47,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:47,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 23:01:48,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-13 23:01:48,052 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:48,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 604629638, now seen corresponding path program 23 times [2025-04-13 23:01:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:48,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335283151] [2025-04-13 23:01:48,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:48,058 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:48,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:48,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:48,707 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 23:01:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:48,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335283151] [2025-04-13 23:01:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335283151] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:48,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464052271] [2025-04-13 23:01:48,707 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:48,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:48,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:48,709 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:48,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 23:01:48,758 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:48,771 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:48,771 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:48,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:48,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:01:48,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:49,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:49,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:01:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:49,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:50,015 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:50,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:01:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464052271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:50,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 32 [2025-04-13 23:01:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807257043] [2025-04-13 23:01:50,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:50,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:01:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:50,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:01:50,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:01:50,823 INFO L87 Difference]: Start difference. First operand 924 states and 3134 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:55,944 INFO L93 Difference]: Finished difference Result 1258 states and 4141 transitions. [2025-04-13 23:01:55,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 23:01:55,945 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:55,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:55,948 INFO L225 Difference]: With dead ends: 1258 [2025-04-13 23:01:55,948 INFO L226 Difference]: Without dead ends: 1242 [2025-04-13 23:01:55,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=761, Invalid=6895, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:01:55,949 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:55,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:01:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-04-13 23:01:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 930. [2025-04-13 23:01:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.402583423035522) internal successors, (3161), 929 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 3161 transitions. [2025-04-13 23:01:55,963 INFO L79 Accepts]: Start accepts. Automaton has 930 states and 3161 transitions. Word has length 25 [2025-04-13 23:01:55,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:55,963 INFO L485 AbstractCegarLoop]: Abstraction has 930 states and 3161 transitions. [2025-04-13 23:01:55,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,963 INFO L278 IsEmpty]: Start isEmpty. Operand 930 states and 3161 transitions. [2025-04-13 23:01:55,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:55,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:55,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:55,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-13 23:01:56,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 23:01:56,165 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:56,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 543645228, now seen corresponding path program 24 times [2025-04-13 23:01:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:56,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355336299] [2025-04-13 23:01:56,166 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:56,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:56,174 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:01:56,174 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:01:56,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:56,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355336299] [2025-04-13 23:01:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355336299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:01:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:01:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:01:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454629809] [2025-04-13 23:01:56,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:01:56,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:01:56,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:56,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:01:56,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:01:56,509 INFO L87 Difference]: Start difference. First operand 930 states and 3161 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:56,905 INFO L93 Difference]: Finished difference Result 1012 states and 3422 transitions. [2025-04-13 23:01:56,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:01:56,905 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:56,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:56,907 INFO L225 Difference]: With dead ends: 1012 [2025-04-13 23:01:56,907 INFO L226 Difference]: Without dead ends: 1006 [2025-04-13 23:01:56,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:01:56,908 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:56,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:01:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-04-13 23:01:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 930. [2025-04-13 23:01:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.402583423035522) internal successors, (3161), 929 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 3161 transitions. [2025-04-13 23:01:56,919 INFO L79 Accepts]: Start accepts. Automaton has 930 states and 3161 transitions. Word has length 25 [2025-04-13 23:01:56,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:56,919 INFO L485 AbstractCegarLoop]: Abstraction has 930 states and 3161 transitions. [2025-04-13 23:01:56,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:56,919 INFO L278 IsEmpty]: Start isEmpty. Operand 930 states and 3161 transitions. [2025-04-13 23:01:56,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:56,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:56,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:56,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 23:01:56,920 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:56,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1550704546, now seen corresponding path program 25 times [2025-04-13 23:01:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:56,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256193144] [2025-04-13 23:01:56,921 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:56,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:56,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:56,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:56,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:57,489 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 23:01:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:57,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256193144] [2025-04-13 23:01:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256193144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:57,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458679101] [2025-04-13 23:01:57,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:57,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:57,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:57,491 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 23:01:57,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:57,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:57,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:57,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:01:57,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:57,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:57,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:01:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:57,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:58,777 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:58,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:01:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458679101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:59,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:01:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700037170] [2025-04-13 23:01:59,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:59,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:01:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:01:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:59,725 INFO L87 Difference]: Start difference. First operand 930 states and 3161 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:04,359 INFO L93 Difference]: Finished difference Result 1185 states and 3920 transitions. [2025-04-13 23:02:04,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:02:04,360 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:04,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:04,362 INFO L225 Difference]: With dead ends: 1185 [2025-04-13 23:02:04,363 INFO L226 Difference]: Without dead ends: 1174 [2025-04-13 23:02:04,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=704, Invalid=6268, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:02:04,363 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:04,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:02:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-04-13 23:02:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 940. [2025-04-13 23:02:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 3.407880724174654) internal successors, (3200), 939 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 3200 transitions. [2025-04-13 23:02:04,377 INFO L79 Accepts]: Start accepts. Automaton has 940 states and 3200 transitions. Word has length 25 [2025-04-13 23:02:04,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:04,377 INFO L485 AbstractCegarLoop]: Abstraction has 940 states and 3200 transitions. [2025-04-13 23:02:04,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:04,377 INFO L278 IsEmpty]: Start isEmpty. Operand 940 states and 3200 transitions. [2025-04-13 23:02:04,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:04,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:04,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:04,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 23:02:04,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 23:02:04,579 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:04,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1441696630, now seen corresponding path program 26 times [2025-04-13 23:02:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:04,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383572544] [2025-04-13 23:02:04,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:04,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:04,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:02:04,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:02:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:04,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383572544] [2025-04-13 23:02:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383572544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:02:04,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:02:04,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:02:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459702902] [2025-04-13 23:02:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:04,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:02:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:04,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:02:04,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:02:04,892 INFO L87 Difference]: Start difference. First operand 940 states and 3200 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:05,230 INFO L93 Difference]: Finished difference Result 1008 states and 3421 transitions. [2025-04-13 23:02:05,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:02:05,230 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:05,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:05,233 INFO L225 Difference]: With dead ends: 1008 [2025-04-13 23:02:05,233 INFO L226 Difference]: Without dead ends: 1002 [2025-04-13 23:02:05,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:02:05,233 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:05,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:02:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-04-13 23:02:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 936. [2025-04-13 23:02:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 3.407486631016043) internal successors, (3186), 935 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 3186 transitions. [2025-04-13 23:02:05,247 INFO L79 Accepts]: Start accepts. Automaton has 936 states and 3186 transitions. Word has length 25 [2025-04-13 23:02:05,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:05,247 INFO L485 AbstractCegarLoop]: Abstraction has 936 states and 3186 transitions. [2025-04-13 23:02:05,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:05,247 INFO L278 IsEmpty]: Start isEmpty. Operand 936 states and 3186 transitions. [2025-04-13 23:02:05,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:05,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:05,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:05,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 23:02:05,248 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:05,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1064571034, now seen corresponding path program 27 times [2025-04-13 23:02:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:05,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325845602] [2025-04-13 23:02:05,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:05,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:05,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:05,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:05,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:05,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325845602] [2025-04-13 23:02:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325845602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:05,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004738512] [2025-04-13 23:02:05,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:05,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:05,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:05,673 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:05,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 23:02:05,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:05,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:05,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:05,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:05,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:02:05,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:06,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:06,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:02:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:06,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:07,211 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:07,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 263 treesize of output 127 [2025-04-13 23:02:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004738512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:07,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:02:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394563803] [2025-04-13 23:02:07,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:07,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:02:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:07,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:02:07,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:02:07,494 INFO L87 Difference]: Start difference. First operand 936 states and 3186 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:12,390 INFO L93 Difference]: Finished difference Result 1246 states and 4247 transitions. [2025-04-13 23:02:12,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:02:12,390 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:12,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:12,393 INFO L225 Difference]: With dead ends: 1246 [2025-04-13 23:02:12,393 INFO L226 Difference]: Without dead ends: 1235 [2025-04-13 23:02:12,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=907, Invalid=6065, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:02:12,393 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:12,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:02:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-04-13 23:02:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 954. [2025-04-13 23:02:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 3.411332633788038) internal successors, (3251), 953 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 3251 transitions. [2025-04-13 23:02:12,406 INFO L79 Accepts]: Start accepts. Automaton has 954 states and 3251 transitions. Word has length 25 [2025-04-13 23:02:12,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:12,406 INFO L485 AbstractCegarLoop]: Abstraction has 954 states and 3251 transitions. [2025-04-13 23:02:12,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:12,406 INFO L278 IsEmpty]: Start isEmpty. Operand 954 states and 3251 transitions. [2025-04-13 23:02:12,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:12,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:12,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:12,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 23:02:12,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-04-13 23:02:12,608 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:12,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1136046488, now seen corresponding path program 28 times [2025-04-13 23:02:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:12,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159610180] [2025-04-13 23:02:12,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:12,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:12,616 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:12,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:12,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159610180] [2025-04-13 23:02:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159610180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:12,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28704165] [2025-04-13 23:02:12,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:12,966 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:12,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 23:02:13,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:13,031 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:13,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:13,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:13,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:02:13,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:13,367 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:13,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:02:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:13,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:13,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:02:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28704165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:14,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2025-04-13 23:02:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517896524] [2025-04-13 23:02:14,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:14,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:02:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:14,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:02:14,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:02:14,734 INFO L87 Difference]: Start difference. First operand 954 states and 3251 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:17,133 INFO L93 Difference]: Finished difference Result 1149 states and 3859 transitions. [2025-04-13 23:02:17,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:02:17,134 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:17,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:17,137 INFO L225 Difference]: With dead ends: 1149 [2025-04-13 23:02:17,137 INFO L226 Difference]: Without dead ends: 1138 [2025-04-13 23:02:17,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=737, Invalid=4375, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:02:17,137 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:17,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:02:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-04-13 23:02:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 976. [2025-04-13 23:02:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.4133333333333336) internal successors, (3328), 975 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3328 transitions. [2025-04-13 23:02:17,151 INFO L79 Accepts]: Start accepts. Automaton has 976 states and 3328 transitions. Word has length 25 [2025-04-13 23:02:17,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:17,151 INFO L485 AbstractCegarLoop]: Abstraction has 976 states and 3328 transitions. [2025-04-13 23:02:17,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,152 INFO L278 IsEmpty]: Start isEmpty. Operand 976 states and 3328 transitions. [2025-04-13 23:02:17,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:17,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:17,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:17,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 23:02:17,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:17,355 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:17,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 795788944, now seen corresponding path program 29 times [2025-04-13 23:02:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:17,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345388125] [2025-04-13 23:02:17,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:17,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:17,365 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:17,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:17,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:17,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345388125] [2025-04-13 23:02:17,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345388125] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:17,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401083048] [2025-04-13 23:02:17,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:17,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:17,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:17,974 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:17,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 23:02:18,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:18,039 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:18,039 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:18,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:18,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 23:02:18,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:18,057 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 23:02:18,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 23:02:18,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:18,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:02:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:18,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:20,211 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2025-04-13 23:02:20,214 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,214 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 181 [2025-04-13 23:02:20,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2025-04-13 23:02:20,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1229 treesize of output 1 [2025-04-13 23:02:20,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2025-04-13 23:02:20,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 717 treesize of output 657 [2025-04-13 23:02:20,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2025-04-13 23:02:20,328 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 285 [2025-04-13 23:02:20,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2025-04-13 23:02:20,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 783 treesize of output 1 [2025-04-13 23:02:20,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2025-04-13 23:02:20,373 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 1 [2025-04-13 23:02:20,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2025-04-13 23:02:20,381 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:20,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 1 [2025-04-13 23:02:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:20,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401083048] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:20,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:20,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2025-04-13 23:02:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746630050] [2025-04-13 23:02:20,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:20,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 23:02:20,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:20,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 23:02:20,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:02:20,383 INFO L87 Difference]: Start difference. First operand 976 states and 3328 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:26,370 INFO L93 Difference]: Finished difference Result 1260 states and 4178 transitions. [2025-04-13 23:02:26,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:02:26,371 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:26,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:26,374 INFO L225 Difference]: With dead ends: 1260 [2025-04-13 23:02:26,374 INFO L226 Difference]: Without dead ends: 1249 [2025-04-13 23:02:26,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=809, Invalid=6163, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:02:26,374 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3281 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:26,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 3340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3281 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:02:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-04-13 23:02:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 980. [2025-04-13 23:02:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.411644535240041) internal successors, (3340), 979 states have internal predecessors, (3340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3340 transitions. [2025-04-13 23:02:26,387 INFO L79 Accepts]: Start accepts. Automaton has 980 states and 3340 transitions. Word has length 25 [2025-04-13 23:02:26,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:26,387 INFO L485 AbstractCegarLoop]: Abstraction has 980 states and 3340 transitions. [2025-04-13 23:02:26,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:26,387 INFO L278 IsEmpty]: Start isEmpty. Operand 980 states and 3340 transitions. [2025-04-13 23:02:26,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:26,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:26,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:26,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 23:02:26,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:26,589 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:26,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1794695614, now seen corresponding path program 30 times [2025-04-13 23:02:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:26,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244476276] [2025-04-13 23:02:26,590 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:02:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:26,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:26,599 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:26,599 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:02:26,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:26,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:26,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244476276] [2025-04-13 23:02:26,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244476276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:26,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59250753] [2025-04-13 23:02:26,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:02:26,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:26,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:26,957 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:26,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 23:02:27,009 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:27,022 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:27,022 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:02:27,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:27,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:02:27,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:27,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:02:27,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:27,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 85 [2025-04-13 23:02:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:27,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:28,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:28,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:02:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59250753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:28,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:28,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:02:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644463614] [2025-04-13 23:02:28,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:28,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:02:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:28,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:02:28,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:02:28,634 INFO L87 Difference]: Start difference. First operand 980 states and 3340 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:31,973 INFO L93 Difference]: Finished difference Result 1486 states and 4905 transitions. [2025-04-13 23:02:31,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:02:31,973 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:31,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:31,976 INFO L225 Difference]: With dead ends: 1486 [2025-04-13 23:02:31,976 INFO L226 Difference]: Without dead ends: 1475 [2025-04-13 23:02:31,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=964, Invalid=5356, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 23:02:31,977 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:31,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:02:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-04-13 23:02:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1006. [2025-04-13 23:02:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.398009950248756) internal successors, (3415), 1005 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3415 transitions. [2025-04-13 23:02:31,991 INFO L79 Accepts]: Start accepts. Automaton has 1006 states and 3415 transitions. Word has length 25 [2025-04-13 23:02:31,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:31,991 INFO L485 AbstractCegarLoop]: Abstraction has 1006 states and 3415 transitions. [2025-04-13 23:02:31,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:31,991 INFO L278 IsEmpty]: Start isEmpty. Operand 1006 states and 3415 transitions. [2025-04-13 23:02:31,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:31,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:31,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:31,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 23:02:32,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-04-13 23:02:32,193 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:32,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash 911471650, now seen corresponding path program 31 times [2025-04-13 23:02:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:32,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894723184] [2025-04-13 23:02:32,194 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:32,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:32,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:32,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:32,844 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 23:02:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:32,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894723184] [2025-04-13 23:02:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894723184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:32,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173406322] [2025-04-13 23:02:32,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:32,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:32,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:32,847 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:32,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 23:02:32,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:32,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:32,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:32,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:32,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:02:32,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:33,309 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:33,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:02:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:33,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:33,976 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:33,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:02:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173406322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:34,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:02:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055455746] [2025-04-13 23:02:34,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:34,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:02:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:34,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:02:34,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:34,798 INFO L87 Difference]: Start difference. First operand 1006 states and 3415 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:38,415 INFO L93 Difference]: Finished difference Result 1353 states and 4442 transitions. [2025-04-13 23:02:38,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:02:38,416 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:38,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:38,419 INFO L225 Difference]: With dead ends: 1353 [2025-04-13 23:02:38,419 INFO L226 Difference]: Without dead ends: 1342 [2025-04-13 23:02:38,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=598, Invalid=4514, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:02:38,420 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:38,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:02:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-04-13 23:02:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1020. [2025-04-13 23:02:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.4062806673209027) internal successors, (3471), 1019 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3471 transitions. [2025-04-13 23:02:38,433 INFO L79 Accepts]: Start accepts. Automaton has 1020 states and 3471 transitions. Word has length 25 [2025-04-13 23:02:38,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:38,433 INFO L485 AbstractCegarLoop]: Abstraction has 1020 states and 3471 transitions. [2025-04-13 23:02:38,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:38,433 INFO L278 IsEmpty]: Start isEmpty. Operand 1020 states and 3471 transitions. [2025-04-13 23:02:38,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:38,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:38,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:38,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 23:02:38,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:38,635 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:38,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1073285238, now seen corresponding path program 32 times [2025-04-13 23:02:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:38,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774105534] [2025-04-13 23:02:38,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:38,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:38,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:38,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:38,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:39,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774105534] [2025-04-13 23:02:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774105534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:39,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146962384] [2025-04-13 23:02:39,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:39,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:39,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:39,009 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:39,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 23:02:39,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:39,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:39,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:39,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:39,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:02:39,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:39,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:39,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:02:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:39,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:40,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:40,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:02:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146962384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:40,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:40,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:02:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892587508] [2025-04-13 23:02:40,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:40,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:02:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:40,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:02:40,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:40,589 INFO L87 Difference]: Start difference. First operand 1020 states and 3471 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:44,851 INFO L93 Difference]: Finished difference Result 1581 states and 5319 transitions. [2025-04-13 23:02:44,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:02:44,851 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:44,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:44,854 INFO L225 Difference]: With dead ends: 1581 [2025-04-13 23:02:44,854 INFO L226 Difference]: Without dead ends: 1570 [2025-04-13 23:02:44,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1411, Invalid=6961, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 23:02:44,855 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:44,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:02:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-04-13 23:02:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1024. [2025-04-13 23:02:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 3.4066471163245358) internal successors, (3485), 1023 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3485 transitions. [2025-04-13 23:02:44,869 INFO L79 Accepts]: Start accepts. Automaton has 1024 states and 3485 transitions. Word has length 25 [2025-04-13 23:02:44,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:44,870 INFO L485 AbstractCegarLoop]: Abstraction has 1024 states and 3485 transitions. [2025-04-13 23:02:44,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:44,870 INFO L278 IsEmpty]: Start isEmpty. Operand 1024 states and 3485 transitions. [2025-04-13 23:02:44,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:44,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:44,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:44,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:45,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-13 23:02:45,072 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:45,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1136167602, now seen corresponding path program 33 times [2025-04-13 23:02:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:45,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778914855] [2025-04-13 23:02:45,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:45,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:45,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:45,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:45,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:45,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:45,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778914855] [2025-04-13 23:02:45,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778914855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:45,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346522103] [2025-04-13 23:02:45,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:45,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:45,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:45,357 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 23:02:45,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:45,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:45,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:45,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:45,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:02:45,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:45,902 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:45,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:02:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:46,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:46,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:46,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 267 treesize of output 127 [2025-04-13 23:02:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346522103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:46,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:46,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:02:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736600657] [2025-04-13 23:02:46,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:46,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:02:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:46,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:02:46,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:46,984 INFO L87 Difference]: Start difference. First operand 1024 states and 3485 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:51,524 INFO L93 Difference]: Finished difference Result 1526 states and 4858 transitions. [2025-04-13 23:02:51,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:02:51,524 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:51,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:51,527 INFO L225 Difference]: With dead ends: 1526 [2025-04-13 23:02:51,528 INFO L226 Difference]: Without dead ends: 1510 [2025-04-13 23:02:51,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1083, Invalid=6573, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:02:51,528 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3496 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:51,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:02:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-04-13 23:02:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1034. [2025-04-13 23:02:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.398838334946757) internal successors, (3511), 1033 states have internal predecessors, (3511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3511 transitions. [2025-04-13 23:02:51,544 INFO L79 Accepts]: Start accepts. Automaton has 1034 states and 3511 transitions. Word has length 25 [2025-04-13 23:02:51,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:51,544 INFO L485 AbstractCegarLoop]: Abstraction has 1034 states and 3511 transitions. [2025-04-13 23:02:51,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:51,544 INFO L278 IsEmpty]: Start isEmpty. Operand 1034 states and 3511 transitions. [2025-04-13 23:02:51,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:51,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:51,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:51,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:51,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:51,746 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:51,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1217023344, now seen corresponding path program 34 times [2025-04-13 23:02:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:51,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551742015] [2025-04-13 23:02:51,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:51,750 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:51,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:51,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:52,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551742015] [2025-04-13 23:02:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551742015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:52,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269057229] [2025-04-13 23:02:52,138 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:52,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:52,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:52,140 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 23:02:52,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:52,209 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:52,210 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:52,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:52,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:02:52,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:52,656 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:52,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:02:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:52,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:53,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:53,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:02:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269057229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:54,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2025-04-13 23:02:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844131560] [2025-04-13 23:02:54,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:54,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:02:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:02:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:02:54,167 INFO L87 Difference]: Start difference. First operand 1034 states and 3511 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:57,728 INFO L93 Difference]: Finished difference Result 1413 states and 4796 transitions. [2025-04-13 23:02:57,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:02:57,728 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:57,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:57,731 INFO L225 Difference]: With dead ends: 1413 [2025-04-13 23:02:57,731 INFO L226 Difference]: Without dead ends: 1402 [2025-04-13 23:02:57,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=773, Invalid=6367, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:02:57,732 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:57,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2906 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:02:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-04-13 23:02:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1064. [2025-04-13 23:02:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 3.4129821260583255) internal successors, (3628), 1063 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 3628 transitions. [2025-04-13 23:02:57,746 INFO L79 Accepts]: Start accepts. Automaton has 1064 states and 3628 transitions. Word has length 25 [2025-04-13 23:02:57,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:57,746 INFO L485 AbstractCegarLoop]: Abstraction has 1064 states and 3628 transitions. [2025-04-13 23:02:57,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:57,746 INFO L278 IsEmpty]: Start isEmpty. Operand 1064 states and 3628 transitions. [2025-04-13 23:02:57,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:57,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:57,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:57,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 23:02:57,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:57,948 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:57,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -66994094, now seen corresponding path program 35 times [2025-04-13 23:02:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:57,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062596189] [2025-04-13 23:02:57,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:57,952 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:57,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:57,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:57,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:58,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:58,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062596189] [2025-04-13 23:02:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062596189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:58,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322250751] [2025-04-13 23:02:58,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:58,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:58,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:58,541 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:58,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 23:02:58,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:58,607 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:58,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:58,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:58,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:02:58,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:59,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:59,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:02:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:59,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:59,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:59,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:03:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322250751] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:03:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:03:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231353684] [2025-04-13 23:03:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:00,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:03:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:00,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:03:00,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:03:00,766 INFO L87 Difference]: Start difference. First operand 1064 states and 3628 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:01,781 INFO L93 Difference]: Finished difference Result 1136 states and 3818 transitions. [2025-04-13 23:03:01,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:03:01,782 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:01,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:01,784 INFO L225 Difference]: With dead ends: 1136 [2025-04-13 23:03:01,785 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 23:03:01,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:03:01,785 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:01,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:03:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 23:03:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1066. [2025-04-13 23:03:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 3.4112676056338027) internal successors, (3633), 1065 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3633 transitions. [2025-04-13 23:03:01,798 INFO L79 Accepts]: Start accepts. Automaton has 1066 states and 3633 transitions. Word has length 25 [2025-04-13 23:03:01,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:01,798 INFO L485 AbstractCegarLoop]: Abstraction has 1066 states and 3633 transitions. [2025-04-13 23:03:01,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:01,798 INFO L278 IsEmpty]: Start isEmpty. Operand 1066 states and 3633 transitions. [2025-04-13 23:03:01,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:01,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:01,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:01,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 23:03:02,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 23:03:02,000 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:02,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 229691506, now seen corresponding path program 36 times [2025-04-13 23:03:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:02,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126459533] [2025-04-13 23:03:02,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:02,004 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:02,008 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:03:02,008 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:03:02,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:02,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126459533] [2025-04-13 23:03:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126459533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:03:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278019693] [2025-04-13 23:03:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:02,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:03:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:03:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:03:02,448 INFO L87 Difference]: Start difference. First operand 1066 states and 3633 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:02,827 INFO L93 Difference]: Finished difference Result 1158 states and 3939 transitions. [2025-04-13 23:03:02,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:03:02,827 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:02,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:02,830 INFO L225 Difference]: With dead ends: 1158 [2025-04-13 23:03:02,830 INFO L226 Difference]: Without dead ends: 1152 [2025-04-13 23:03:02,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:03:02,831 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:02,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:03:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-04-13 23:03:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1074. [2025-04-13 23:03:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 3.419384902143523) internal successors, (3669), 1073 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 3669 transitions. [2025-04-13 23:03:02,848 INFO L79 Accepts]: Start accepts. Automaton has 1074 states and 3669 transitions. Word has length 25 [2025-04-13 23:03:02,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:02,848 INFO L485 AbstractCegarLoop]: Abstraction has 1074 states and 3669 transitions. [2025-04-13 23:03:02,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:02,848 INFO L278 IsEmpty]: Start isEmpty. Operand 1074 states and 3669 transitions. [2025-04-13 23:03:02,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:02,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:02,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:02,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 23:03:02,850 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:02,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1184056292, now seen corresponding path program 37 times [2025-04-13 23:03:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:02,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916633783] [2025-04-13 23:03:02,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:02,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:03,384 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 23:03:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:03,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916633783] [2025-04-13 23:03:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916633783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:03,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571764046] [2025-04-13 23:03:03,385 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:03,386 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:03,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 23:03:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:03,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:03,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:03,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:03,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:03:03,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:03,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:03,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:03:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:04,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:04,641 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:04,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:03:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571764046] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:05,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:03:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456677271] [2025-04-13 23:03:05,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:05,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:03:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:03:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:03:05,541 INFO L87 Difference]: Start difference. First operand 1074 states and 3669 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:10,381 INFO L93 Difference]: Finished difference Result 1432 states and 4728 transitions. [2025-04-13 23:03:10,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:03:10,381 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:10,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:10,384 INFO L225 Difference]: With dead ends: 1432 [2025-04-13 23:03:10,384 INFO L226 Difference]: Without dead ends: 1421 [2025-04-13 23:03:10,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=739, Invalid=6571, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 23:03:10,385 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 307 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:10,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 0 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3272 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:03:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-04-13 23:03:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1078. [2025-04-13 23:03:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 3.4196843082636956) internal successors, (3683), 1077 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3683 transitions. [2025-04-13 23:03:10,400 INFO L79 Accepts]: Start accepts. Automaton has 1078 states and 3683 transitions. Word has length 25 [2025-04-13 23:03:10,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:10,400 INFO L485 AbstractCegarLoop]: Abstraction has 1078 states and 3683 transitions. [2025-04-13 23:03:10,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:10,400 INFO L278 IsEmpty]: Start isEmpty. Operand 1078 states and 3683 transitions. [2025-04-13 23:03:10,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:10,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:10,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:10,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 23:03:10,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:10,602 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:10,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1486868262, now seen corresponding path program 38 times [2025-04-13 23:03:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:10,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33783752] [2025-04-13 23:03:10,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:10,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:10,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:10,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:10,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:11,136 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 23:03:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:11,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33783752] [2025-04-13 23:03:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33783752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:11,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365667253] [2025-04-13 23:03:11,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:11,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:11,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:11,139 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:11,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 23:03:11,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:11,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:11,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:11,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:03:11,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:11,657 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:11,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:03:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:11,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:12,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:12,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:03:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365667253] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:12,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 23:03:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327692843] [2025-04-13 23:03:12,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:12,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 23:03:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:12,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 23:03:12,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:03:12,803 INFO L87 Difference]: Start difference. First operand 1078 states and 3683 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:17,796 INFO L93 Difference]: Finished difference Result 1646 states and 5487 transitions. [2025-04-13 23:03:17,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 23:03:17,796 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:17,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:17,800 INFO L225 Difference]: With dead ends: 1646 [2025-04-13 23:03:17,800 INFO L226 Difference]: Without dead ends: 1635 [2025-04-13 23:03:17,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3490 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1393, Invalid=10597, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 23:03:17,800 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:17,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 0 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:03:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-04-13 23:03:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1088. [2025-04-13 23:03:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 3.4259429622815087) internal successors, (3724), 1087 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3724 transitions. [2025-04-13 23:03:17,815 INFO L79 Accepts]: Start accepts. Automaton has 1088 states and 3724 transitions. Word has length 25 [2025-04-13 23:03:17,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:17,815 INFO L485 AbstractCegarLoop]: Abstraction has 1088 states and 3724 transitions. [2025-04-13 23:03:17,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,815 INFO L278 IsEmpty]: Start isEmpty. Operand 1088 states and 3724 transitions. [2025-04-13 23:03:17,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:17,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:17,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:17,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 23:03:18,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2025-04-13 23:03:18,017 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:18,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 462645916, now seen corresponding path program 39 times [2025-04-13 23:03:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:18,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601788943] [2025-04-13 23:03:18,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:18,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:18,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:18,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:18,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:18,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601788943] [2025-04-13 23:03:18,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601788943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:18,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393215668] [2025-04-13 23:03:18,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:18,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:18,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:18,386 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:18,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 23:03:18,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:18,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:18,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:18,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:03:18,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:18,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:18,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:03:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:19,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:19,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:19,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 263 treesize of output 127 [2025-04-13 23:03:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393215668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:20,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:03:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657644560] [2025-04-13 23:03:20,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:20,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:03:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:03:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:03:20,011 INFO L87 Difference]: Start difference. First operand 1088 states and 3724 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:25,599 INFO L93 Difference]: Finished difference Result 1739 states and 5826 transitions. [2025-04-13 23:03:25,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 23:03:25,599 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:25,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:25,603 INFO L225 Difference]: With dead ends: 1739 [2025-04-13 23:03:25,603 INFO L226 Difference]: Without dead ends: 1728 [2025-04-13 23:03:25,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1429, Invalid=7501, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 23:03:25,604 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 331 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:25,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 0 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:03:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-04-13 23:03:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1104. [2025-04-13 23:03:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 3.4252039891205803) internal successors, (3778), 1103 states have internal predecessors, (3778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 3778 transitions. [2025-04-13 23:03:25,620 INFO L79 Accepts]: Start accepts. Automaton has 1104 states and 3778 transitions. Word has length 25 [2025-04-13 23:03:25,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:25,620 INFO L485 AbstractCegarLoop]: Abstraction has 1104 states and 3778 transitions. [2025-04-13 23:03:25,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,620 INFO L278 IsEmpty]: Start isEmpty. Operand 1104 states and 3778 transitions. [2025-04-13 23:03:25,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:25,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:25,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:25,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 23:03:25,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:25,822 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:25,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -696818802, now seen corresponding path program 40 times [2025-04-13 23:03:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:25,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188775039] [2025-04-13 23:03:25,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:25,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:25,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:25,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:25,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:26,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188775039] [2025-04-13 23:03:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188775039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:26,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371159222] [2025-04-13 23:03:26,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:26,205 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 23:03:26,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:26,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:26,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:26,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:26,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:03:26,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:26,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:26,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:03:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:26,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:27,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:27,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:03:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371159222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:28,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:28,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:03:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735439109] [2025-04-13 23:03:28,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:28,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:03:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:28,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:03:28,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:03:28,252 INFO L87 Difference]: Start difference. First operand 1104 states and 3778 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:03:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:34,165 INFO L93 Difference]: Finished difference Result 1447 states and 4801 transitions. [2025-04-13 23:03:34,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:03:34,165 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 25 [2025-04-13 23:03:34,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:34,168 INFO L225 Difference]: With dead ends: 1447 [2025-04-13 23:03:34,168 INFO L226 Difference]: Without dead ends: 1436 [2025-04-13 23:03:34,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1178, Invalid=9124, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 23:03:34,169 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:34,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:03:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-04-13 23:03:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1118. [2025-04-13 23:03:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 3.431512981199642) internal successors, (3833), 1117 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3833 transitions. [2025-04-13 23:03:34,183 INFO L79 Accepts]: Start accepts. Automaton has 1118 states and 3833 transitions. Word has length 25 [2025-04-13 23:03:34,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:34,183 INFO L485 AbstractCegarLoop]: Abstraction has 1118 states and 3833 transitions. [2025-04-13 23:03:34,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:03:34,184 INFO L278 IsEmpty]: Start isEmpty. Operand 1118 states and 3833 transitions. [2025-04-13 23:03:34,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:34,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:34,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:34,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-04-13 23:03:34,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2025-04-13 23:03:34,386 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:34,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1799683798, now seen corresponding path program 41 times [2025-04-13 23:03:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:34,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098417747] [2025-04-13 23:03:34,386 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:34,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:34,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:34,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:34,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:34,921 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 23:03:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:34,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098417747] [2025-04-13 23:03:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098417747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:34,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070331587] [2025-04-13 23:03:34,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:34,924 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:34,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 23:03:34,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:34,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:34,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:34,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:34,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:03:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:35,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:35,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:03:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:35,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:36,263 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:36,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 161 [2025-04-13 23:03:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070331587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:37,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 33 [2025-04-13 23:03:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164550921] [2025-04-13 23:03:37,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:37,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:03:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:37,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:03:37,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:03:37,075 INFO L87 Difference]: Start difference. First operand 1118 states and 3833 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:42,943 INFO L93 Difference]: Finished difference Result 1656 states and 5505 transitions. [2025-04-13 23:03:42,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 23:03:42,943 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:42,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:42,947 INFO L225 Difference]: With dead ends: 1656 [2025-04-13 23:03:42,947 INFO L226 Difference]: Without dead ends: 1645 [2025-04-13 23:03:42,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=957, Invalid=8745, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:03:42,948 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:42,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3012 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:03:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-04-13 23:03:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1112. [2025-04-13 23:03:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 3.432943294329433) internal successors, (3814), 1111 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 3814 transitions. [2025-04-13 23:03:42,962 INFO L79 Accepts]: Start accepts. Automaton has 1112 states and 3814 transitions. Word has length 25 [2025-04-13 23:03:42,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:42,962 INFO L485 AbstractCegarLoop]: Abstraction has 1112 states and 3814 transitions. [2025-04-13 23:03:42,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:42,962 INFO L278 IsEmpty]: Start isEmpty. Operand 1112 states and 3814 transitions. [2025-04-13 23:03:42,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:42,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:42,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:42,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 23:03:43,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:43,164 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:43,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash 581561196, now seen corresponding path program 42 times [2025-04-13 23:03:43,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:43,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863750432] [2025-04-13 23:03:43,165 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:43,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:43,174 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:43,174 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:43,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:43,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:43,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863750432] [2025-04-13 23:03:43,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863750432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:43,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031004432] [2025-04-13 23:03:43,526 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:43,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:43,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:43,528 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:43,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 23:03:43,584 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:43,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:43,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:43,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:43,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:03:43,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:43,946 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:43,947 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:03:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:44,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:44,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:44,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:03:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031004432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:45,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:03:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155366099] [2025-04-13 23:03:45,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:45,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:03:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:45,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:03:45,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:03:45,214 INFO L87 Difference]: Start difference. First operand 1112 states and 3814 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:51,396 INFO L93 Difference]: Finished difference Result 1553 states and 5360 transitions. [2025-04-13 23:03:51,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 23:03:51,396 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:51,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:51,399 INFO L225 Difference]: With dead ends: 1553 [2025-04-13 23:03:51,400 INFO L226 Difference]: Without dead ends: 1542 [2025-04-13 23:03:51,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3513 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1668, Invalid=9044, Unknown=0, NotChecked=0, Total=10712 [2025-04-13 23:03:51,401 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:51,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:03:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-04-13 23:03:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1098. [2025-04-13 23:03:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1097 states have (on average 3.428441203281677) internal successors, (3761), 1097 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 3761 transitions. [2025-04-13 23:03:51,418 INFO L79 Accepts]: Start accepts. Automaton has 1098 states and 3761 transitions. Word has length 25 [2025-04-13 23:03:51,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:51,418 INFO L485 AbstractCegarLoop]: Abstraction has 1098 states and 3761 transitions. [2025-04-13 23:03:51,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:51,418 INFO L278 IsEmpty]: Start isEmpty. Operand 1098 states and 3761 transitions. [2025-04-13 23:03:51,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:51,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:51,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:51,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 23:03:51,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:51,621 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:51,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1046807906, now seen corresponding path program 43 times [2025-04-13 23:03:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:51,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847417308] [2025-04-13 23:03:51,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:51,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:51,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:51,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:52,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847417308] [2025-04-13 23:03:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847417308] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:52,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187369891] [2025-04-13 23:03:52,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:52,249 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:52,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 23:03:52,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:52,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:52,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:52,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:52,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:03:52,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:52,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:52,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:03:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:52,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:53,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:53,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:03:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187369891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:54,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:03:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525027106] [2025-04-13 23:03:54,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:54,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:03:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:54,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:03:54,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:03:54,380 INFO L87 Difference]: Start difference. First operand 1098 states and 3761 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:58,366 INFO L93 Difference]: Finished difference Result 1368 states and 4511 transitions. [2025-04-13 23:03:58,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:03:58,366 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:58,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:58,369 INFO L225 Difference]: With dead ends: 1368 [2025-04-13 23:03:58,369 INFO L226 Difference]: Without dead ends: 1357 [2025-04-13 23:03:58,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=618, Invalid=5544, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:03:58,370 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:58,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:03:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-04-13 23:03:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1121. [2025-04-13 23:03:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 3.4080357142857145) internal successors, (3817), 1120 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 3817 transitions. [2025-04-13 23:03:58,387 INFO L79 Accepts]: Start accepts. Automaton has 1121 states and 3817 transitions. Word has length 25 [2025-04-13 23:03:58,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:58,387 INFO L485 AbstractCegarLoop]: Abstraction has 1121 states and 3817 transitions. [2025-04-13 23:03:58,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:58,387 INFO L278 IsEmpty]: Start isEmpty. Operand 1121 states and 3817 transitions. [2025-04-13 23:03:58,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:58,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:58,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:58,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 23:03:58,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:58,589 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:58,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1037110150, now seen corresponding path program 44 times [2025-04-13 23:03:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:58,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717386942] [2025-04-13 23:03:58,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:58,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:58,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:58,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:58,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:59,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717386942] [2025-04-13 23:03:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717386942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:59,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431872326] [2025-04-13 23:03:59,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:59,042 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:59,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 23:03:59,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:59,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:59,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:59,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:59,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:03:59,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:59,640 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:59,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:03:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:59,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:00,523 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:00,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:04:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431872326] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:00,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:04:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174604368] [2025-04-13 23:04:00,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:00,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:04:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:00,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:04:00,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:04:00,836 INFO L87 Difference]: Start difference. First operand 1121 states and 3817 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:08,224 INFO L93 Difference]: Finished difference Result 1588 states and 5222 transitions. [2025-04-13 23:04:08,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-13 23:04:08,225 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:08,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:08,228 INFO L225 Difference]: With dead ends: 1588 [2025-04-13 23:04:08,228 INFO L226 Difference]: Without dead ends: 1572 [2025-04-13 23:04:08,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1421, Invalid=9499, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 23:04:08,229 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:08,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:04:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-04-13 23:04:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1127. [2025-04-13 23:04:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 3.419182948490231) internal successors, (3850), 1126 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3850 transitions. [2025-04-13 23:04:08,244 INFO L79 Accepts]: Start accepts. Automaton has 1127 states and 3850 transitions. Word has length 25 [2025-04-13 23:04:08,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:08,244 INFO L485 AbstractCegarLoop]: Abstraction has 1127 states and 3850 transitions. [2025-04-13 23:04:08,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:08,244 INFO L278 IsEmpty]: Start isEmpty. Operand 1127 states and 3850 transitions. [2025-04-13 23:04:08,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:08,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:08,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:08,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 23:04:08,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:08,446 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:08,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash -380947816, now seen corresponding path program 45 times [2025-04-13 23:04:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:08,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532442788] [2025-04-13 23:04:08,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:08,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:08,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:08,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:04:08,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:08,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532442788] [2025-04-13 23:04:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532442788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:08,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955071866] [2025-04-13 23:04:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:08,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:08,810 INFO L87 Difference]: Start difference. First operand 1127 states and 3850 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:09,197 INFO L93 Difference]: Finished difference Result 1247 states and 4214 transitions. [2025-04-13 23:04:09,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:04:09,197 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:09,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:09,200 INFO L225 Difference]: With dead ends: 1247 [2025-04-13 23:04:09,200 INFO L226 Difference]: Without dead ends: 1241 [2025-04-13 23:04:09,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:04:09,200 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:09,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-04-13 23:04:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1129. [2025-04-13 23:04:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 3.4193262411347516) internal successors, (3857), 1128 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 3857 transitions. [2025-04-13 23:04:09,213 INFO L79 Accepts]: Start accepts. Automaton has 1129 states and 3857 transitions. Word has length 25 [2025-04-13 23:04:09,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:09,213 INFO L485 AbstractCegarLoop]: Abstraction has 1129 states and 3857 transitions. [2025-04-13 23:04:09,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,213 INFO L278 IsEmpty]: Start isEmpty. Operand 1129 states and 3857 transitions. [2025-04-13 23:04:09,215 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:09,215 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:09,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:09,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 23:04:09,215 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:09,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 768328060, now seen corresponding path program 46 times [2025-04-13 23:04:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:09,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283228391] [2025-04-13 23:04:09,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:09,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:09,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:09,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:09,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:09,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283228391] [2025-04-13 23:04:09,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283228391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:09,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756842192] [2025-04-13 23:04:09,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:09,613 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:09,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 23:04:09,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:09,687 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:09,687 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:09,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:09,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:09,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:10,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:10,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:04:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:10,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:10,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:10,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:04:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756842192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:11,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:04:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397840900] [2025-04-13 23:04:11,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:11,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:04:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:11,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:04:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:04:11,814 INFO L87 Difference]: Start difference. First operand 1129 states and 3857 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:16,060 INFO L93 Difference]: Finished difference Result 1376 states and 4612 transitions. [2025-04-13 23:04:16,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:04:16,060 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:16,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:16,064 INFO L225 Difference]: With dead ends: 1376 [2025-04-13 23:04:16,064 INFO L226 Difference]: Without dead ends: 1365 [2025-04-13 23:04:16,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=774, Invalid=5868, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:04:16,065 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:16,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:04:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-04-13 23:04:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1139. [2025-04-13 23:04:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 3.4253075571177503) internal successors, (3898), 1138 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 3898 transitions. [2025-04-13 23:04:16,078 INFO L79 Accepts]: Start accepts. Automaton has 1139 states and 3898 transitions. Word has length 25 [2025-04-13 23:04:16,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:16,078 INFO L485 AbstractCegarLoop]: Abstraction has 1139 states and 3898 transitions. [2025-04-13 23:04:16,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,079 INFO L278 IsEmpty]: Start isEmpty. Operand 1139 states and 3898 transitions. [2025-04-13 23:04:16,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:16,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:16,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:16,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 23:04:16,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 23:04:16,281 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:16,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2097507584, now seen corresponding path program 47 times [2025-04-13 23:04:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:16,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401427216] [2025-04-13 23:04:16,281 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:16,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:16,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:16,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:16,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:17,083 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 23:04:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:17,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401427216] [2025-04-13 23:04:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401427216] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:17,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305611477] [2025-04-13 23:04:17,084 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:17,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:17,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:17,086 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:17,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 23:04:17,145 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:17,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:17,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:17,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:17,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:17,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:17,633 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:17,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:04:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:17,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:18,383 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:18,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:04:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305611477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:19,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 33 [2025-04-13 23:04:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454399605] [2025-04-13 23:04:19,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:19,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:19,229 INFO L87 Difference]: Start difference. First operand 1139 states and 3898 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:24,917 INFO L93 Difference]: Finished difference Result 1518 states and 5076 transitions. [2025-04-13 23:04:24,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:04:24,917 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:24,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:24,920 INFO L225 Difference]: With dead ends: 1518 [2025-04-13 23:04:24,920 INFO L226 Difference]: Without dead ends: 1507 [2025-04-13 23:04:24,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=946, Invalid=7244, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:04:24,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:24,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 0 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:04:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-04-13 23:04:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1127. [2025-04-13 23:04:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 3.413854351687389) internal successors, (3844), 1126 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3844 transitions. [2025-04-13 23:04:24,934 INFO L79 Accepts]: Start accepts. Automaton has 1127 states and 3844 transitions. Word has length 25 [2025-04-13 23:04:24,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:24,935 INFO L485 AbstractCegarLoop]: Abstraction has 1127 states and 3844 transitions. [2025-04-13 23:04:24,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,935 INFO L278 IsEmpty]: Start isEmpty. Operand 1127 states and 3844 transitions. [2025-04-13 23:04:24,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:24,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:24,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:24,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 23:04:25,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable80 [2025-04-13 23:04:25,137 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:25,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1404931582, now seen corresponding path program 48 times [2025-04-13 23:04:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:25,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446775080] [2025-04-13 23:04:25,137 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:25,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:25,146 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:25,146 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:25,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:25,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446775080] [2025-04-13 23:04:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446775080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:25,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103278682] [2025-04-13 23:04:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:25,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:25,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:25,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:25,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:25,783 INFO L87 Difference]: Start difference. First operand 1127 states and 3844 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:26,227 INFO L93 Difference]: Finished difference Result 1217 states and 4143 transitions. [2025-04-13 23:04:26,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:04:26,227 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:26,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:26,230 INFO L225 Difference]: With dead ends: 1217 [2025-04-13 23:04:26,230 INFO L226 Difference]: Without dead ends: 1211 [2025-04-13 23:04:26,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:04:26,230 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:26,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-04-13 23:04:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1135. [2025-04-13 23:04:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 3.421516754850088) internal successors, (3880), 1134 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 3880 transitions. [2025-04-13 23:04:26,243 INFO L79 Accepts]: Start accepts. Automaton has 1135 states and 3880 transitions. Word has length 25 [2025-04-13 23:04:26,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:26,243 INFO L485 AbstractCegarLoop]: Abstraction has 1135 states and 3880 transitions. [2025-04-13 23:04:26,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:26,243 INFO L278 IsEmpty]: Start isEmpty. Operand 1135 states and 3880 transitions. [2025-04-13 23:04:26,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:26,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:26,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:26,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 23:04:26,245 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:26,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1506664294, now seen corresponding path program 49 times [2025-04-13 23:04:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:26,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929516978] [2025-04-13 23:04:26,245 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:26,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:26,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:26,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:26,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:26,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929516978] [2025-04-13 23:04:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929516978] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:26,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336755009] [2025-04-13 23:04:26,809 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:26,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:26,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:26,811 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:26,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 23:04:26,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:26,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:26,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:26,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:26,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:27,278 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:27,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:04:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:27,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:04:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336755009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:04:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:04:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189144650] [2025-04-13 23:04:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:27,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:04:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:27,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:04:27,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:27,337 INFO L87 Difference]: Start difference. First operand 1135 states and 3880 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:27,546 INFO L93 Difference]: Finished difference Result 1205 states and 4069 transitions. [2025-04-13 23:04:27,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:27,546 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:27,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:27,549 INFO L225 Difference]: With dead ends: 1205 [2025-04-13 23:04:27,549 INFO L226 Difference]: Without dead ends: 1199 [2025-04-13 23:04:27,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:27,550 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:27,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:04:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-04-13 23:04:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1133. [2025-04-13 23:04:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 3.4231448763250882) internal successors, (3875), 1132 states have internal predecessors, (3875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3875 transitions. [2025-04-13 23:04:27,562 INFO L79 Accepts]: Start accepts. Automaton has 1133 states and 3875 transitions. Word has length 25 [2025-04-13 23:04:27,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:27,562 INFO L485 AbstractCegarLoop]: Abstraction has 1133 states and 3875 transitions. [2025-04-13 23:04:27,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:27,563 INFO L278 IsEmpty]: Start isEmpty. Operand 1133 states and 3875 transitions. [2025-04-13 23:04:27,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:27,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:27,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:27,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 23:04:27,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:27,765 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:27,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -580410276, now seen corresponding path program 50 times [2025-04-13 23:04:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:27,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950675806] [2025-04-13 23:04:27,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:27,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:27,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:27,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:04:27,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:28,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950675806] [2025-04-13 23:04:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950675806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:28,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:28,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:28,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120159194] [2025-04-13 23:04:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:28,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:28,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:28,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:28,159 INFO L87 Difference]: Start difference. First operand 1133 states and 3875 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:28,511 INFO L93 Difference]: Finished difference Result 1193 states and 4074 transitions. [2025-04-13 23:04:28,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:04:28,511 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:28,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:28,514 INFO L225 Difference]: With dead ends: 1193 [2025-04-13 23:04:28,514 INFO L226 Difference]: Without dead ends: 1187 [2025-04-13 23:04:28,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:04:28,515 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:28,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-04-13 23:04:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1133. [2025-04-13 23:04:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 3.4231448763250882) internal successors, (3875), 1132 states have internal predecessors, (3875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3875 transitions. [2025-04-13 23:04:28,527 INFO L79 Accepts]: Start accepts. Automaton has 1133 states and 3875 transitions. Word has length 25 [2025-04-13 23:04:28,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:28,527 INFO L485 AbstractCegarLoop]: Abstraction has 1133 states and 3875 transitions. [2025-04-13 23:04:28,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:28,527 INFO L278 IsEmpty]: Start isEmpty. Operand 1133 states and 3875 transitions. [2025-04-13 23:04:28,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:28,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:28,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:28,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 23:04:28,529 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:28,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1199448502, now seen corresponding path program 51 times [2025-04-13 23:04:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:28,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145516196] [2025-04-13 23:04:28,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:28,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:28,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:28,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:04:28,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:28,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145516196] [2025-04-13 23:04:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145516196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423058864] [2025-04-13 23:04:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:28,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:28,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:28,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:28,908 INFO L87 Difference]: Start difference. First operand 1133 states and 3875 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:29,492 INFO L93 Difference]: Finished difference Result 1251 states and 4238 transitions. [2025-04-13 23:04:29,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:04:29,492 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:29,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:29,496 INFO L225 Difference]: With dead ends: 1251 [2025-04-13 23:04:29,496 INFO L226 Difference]: Without dead ends: 1245 [2025-04-13 23:04:29,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:04:29,496 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:29,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:04:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-04-13 23:04:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1135. [2025-04-13 23:04:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 3.421516754850088) internal successors, (3880), 1134 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 3880 transitions. [2025-04-13 23:04:29,509 INFO L79 Accepts]: Start accepts. Automaton has 1135 states and 3880 transitions. Word has length 25 [2025-04-13 23:04:29,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:29,509 INFO L485 AbstractCegarLoop]: Abstraction has 1135 states and 3880 transitions. [2025-04-13 23:04:29,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:29,509 INFO L278 IsEmpty]: Start isEmpty. Operand 1135 states and 3880 transitions. [2025-04-13 23:04:29,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:29,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:29,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:29,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 23:04:29,511 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:29,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1297082286, now seen corresponding path program 52 times [2025-04-13 23:04:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:29,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712593278] [2025-04-13 23:04:29,511 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:29,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:29,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:29,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:29,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:29,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712593278] [2025-04-13 23:04:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712593278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:29,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383896583] [2025-04-13 23:04:29,894 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:29,896 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:29,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 23:04:29,957 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:29,971 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:29,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:29,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:29,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:29,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:30,474 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:30,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:04:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:30,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:30,941 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:30,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:04:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383896583] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:31,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:04:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388746954] [2025-04-13 23:04:31,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:31,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:04:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:31,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:04:31,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:04:31,740 INFO L87 Difference]: Start difference. First operand 1135 states and 3880 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:33,470 INFO L93 Difference]: Finished difference Result 1346 states and 4463 transitions. [2025-04-13 23:04:33,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:04:33,470 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:33,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:33,473 INFO L225 Difference]: With dead ends: 1346 [2025-04-13 23:04:33,473 INFO L226 Difference]: Without dead ends: 1335 [2025-04-13 23:04:33,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=395, Invalid=2911, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 23:04:33,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:33,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:04:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-04-13 23:04:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1175. [2025-04-13 23:04:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 3.425894378194208) internal successors, (4022), 1174 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 4022 transitions. [2025-04-13 23:04:33,492 INFO L79 Accepts]: Start accepts. Automaton has 1175 states and 4022 transitions. Word has length 25 [2025-04-13 23:04:33,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:33,492 INFO L485 AbstractCegarLoop]: Abstraction has 1175 states and 4022 transitions. [2025-04-13 23:04:33,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:33,492 INFO L278 IsEmpty]: Start isEmpty. Operand 1175 states and 4022 transitions. [2025-04-13 23:04:33,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:33,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:33,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:33,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 23:04:33,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:33,694 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:33,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -785893356, now seen corresponding path program 53 times [2025-04-13 23:04:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:33,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128645007] [2025-04-13 23:04:33,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:33,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:33,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:33,704 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:33,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:34,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128645007] [2025-04-13 23:04:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128645007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:34,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680324896] [2025-04-13 23:04:34,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:34,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:34,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:34,309 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:34,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 23:04:34,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:34,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:34,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:34,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:34,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:34,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:34,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:34,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:04:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:34,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:35,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:35,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:04:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680324896] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:36,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:04:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 33 [2025-04-13 23:04:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050932377] [2025-04-13 23:04:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:36,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:36,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:36,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:36,381 INFO L87 Difference]: Start difference. First operand 1175 states and 4022 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:37,386 INFO L93 Difference]: Finished difference Result 1285 states and 4393 transitions. [2025-04-13 23:04:37,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:04:37,386 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:37,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:37,389 INFO L225 Difference]: With dead ends: 1285 [2025-04-13 23:04:37,389 INFO L226 Difference]: Without dead ends: 1279 [2025-04-13 23:04:37,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1657, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 23:04:37,389 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:37,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:04:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-04-13 23:04:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1173. [2025-04-13 23:04:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 3.4274744027303754) internal successors, (4017), 1172 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 4017 transitions. [2025-04-13 23:04:37,402 INFO L79 Accepts]: Start accepts. Automaton has 1173 states and 4017 transitions. Word has length 25 [2025-04-13 23:04:37,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:37,403 INFO L485 AbstractCegarLoop]: Abstraction has 1173 states and 4017 transitions. [2025-04-13 23:04:37,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:37,403 INFO L278 IsEmpty]: Start isEmpty. Operand 1173 states and 4017 transitions. [2025-04-13 23:04:37,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:37,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:37,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:37,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 23:04:37,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:37,605 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:37,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash 200650518, now seen corresponding path program 54 times [2025-04-13 23:04:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:37,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713945757] [2025-04-13 23:04:37,605 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:37,609 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:37,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:37,613 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:37,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:37,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713945757] [2025-04-13 23:04:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713945757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051310239] [2025-04-13 23:04:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:37,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:37,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:37,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:37,941 INFO L87 Difference]: Start difference. First operand 1173 states and 4017 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:38,452 INFO L93 Difference]: Finished difference Result 1305 states and 4450 transitions. [2025-04-13 23:04:38,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:04:38,452 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:38,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:38,455 INFO L225 Difference]: With dead ends: 1305 [2025-04-13 23:04:38,456 INFO L226 Difference]: Without dead ends: 1299 [2025-04-13 23:04:38,456 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:38,456 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:38,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-04-13 23:04:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1177. [2025-04-13 23:04:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 3.423469387755102) internal successors, (4026), 1176 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 4026 transitions. [2025-04-13 23:04:38,470 INFO L79 Accepts]: Start accepts. Automaton has 1177 states and 4026 transitions. Word has length 25 [2025-04-13 23:04:38,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:38,470 INFO L485 AbstractCegarLoop]: Abstraction has 1177 states and 4026 transitions. [2025-04-13 23:04:38,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,470 INFO L278 IsEmpty]: Start isEmpty. Operand 1177 states and 4026 transitions. [2025-04-13 23:04:38,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:38,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:38,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:38,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 23:04:38,472 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:38,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1448214138, now seen corresponding path program 55 times [2025-04-13 23:04:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:38,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916095393] [2025-04-13 23:04:38,472 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:38,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:38,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:38,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:38,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:39,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916095393] [2025-04-13 23:04:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916095393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:39,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624441891] [2025-04-13 23:04:39,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:39,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:39,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:39,085 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:39,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 23:04:39,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:39,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:39,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:39,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:39,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:39,564 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:39,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:04:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:39,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:04:39,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624441891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:39,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:04:39,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:04:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870022072] [2025-04-13 23:04:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:39,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:04:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:39,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:04:39,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:39,633 INFO L87 Difference]: Start difference. First operand 1177 states and 4026 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:39,871 INFO L93 Difference]: Finished difference Result 1249 states and 4230 transitions. [2025-04-13 23:04:39,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:39,871 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:39,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:39,874 INFO L225 Difference]: With dead ends: 1249 [2025-04-13 23:04:39,874 INFO L226 Difference]: Without dead ends: 1243 [2025-04-13 23:04:39,874 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:39,874 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:39,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:04:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-04-13 23:04:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1179. [2025-04-13 23:04:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 3.4269949066213923) internal successors, (4037), 1178 states have internal predecessors, (4037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 4037 transitions. [2025-04-13 23:04:39,888 INFO L79 Accepts]: Start accepts. Automaton has 1179 states and 4037 transitions. Word has length 25 [2025-04-13 23:04:39,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:39,888 INFO L485 AbstractCegarLoop]: Abstraction has 1179 states and 4037 transitions. [2025-04-13 23:04:39,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:39,888 INFO L278 IsEmpty]: Start isEmpty. Operand 1179 states and 4037 transitions. [2025-04-13 23:04:39,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:39,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:39,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:39,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 23:04:40,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 23:04:40,090 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:40,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1784691340, now seen corresponding path program 56 times [2025-04-13 23:04:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:40,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717201275] [2025-04-13 23:04:40,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:40,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:40,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:40,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:04:40,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:40,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:40,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717201275] [2025-04-13 23:04:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717201275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494713329] [2025-04-13 23:04:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:40,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:40,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:40,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:40,414 INFO L87 Difference]: Start difference. First operand 1179 states and 4037 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:40,761 INFO L93 Difference]: Finished difference Result 1271 states and 4366 transitions. [2025-04-13 23:04:40,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:04:40,762 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:40,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:40,765 INFO L225 Difference]: With dead ends: 1271 [2025-04-13 23:04:40,765 INFO L226 Difference]: Without dead ends: 1265 [2025-04-13 23:04:40,765 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:04:40,765 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:40,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-04-13 23:04:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1183. [2025-04-13 23:04:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 3.4272419627749575) internal successors, (4051), 1182 states have internal predecessors, (4051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 4051 transitions. [2025-04-13 23:04:40,779 INFO L79 Accepts]: Start accepts. Automaton has 1183 states and 4051 transitions. Word has length 25 [2025-04-13 23:04:40,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:40,779 INFO L485 AbstractCegarLoop]: Abstraction has 1183 states and 4051 transitions. [2025-04-13 23:04:40,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:40,779 INFO L278 IsEmpty]: Start isEmpty. Operand 1183 states and 4051 transitions. [2025-04-13 23:04:40,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:40,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:40,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:40,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 23:04:40,781 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:40,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash -243965144, now seen corresponding path program 57 times [2025-04-13 23:04:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:40,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292940397] [2025-04-13 23:04:40,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:40,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:40,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:40,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:04:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:41,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292940397] [2025-04-13 23:04:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292940397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616149999] [2025-04-13 23:04:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:41,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:41,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:41,215 INFO L87 Difference]: Start difference. First operand 1183 states and 4051 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:41,506 INFO L93 Difference]: Finished difference Result 1247 states and 4252 transitions. [2025-04-13 23:04:41,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:04:41,506 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:41,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:41,509 INFO L225 Difference]: With dead ends: 1247 [2025-04-13 23:04:41,509 INFO L226 Difference]: Without dead ends: 1241 [2025-04-13 23:04:41,509 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:04:41,510 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:41,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:04:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-04-13 23:04:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1181. [2025-04-13 23:04:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1180 states have (on average 3.4237288135593222) internal successors, (4040), 1180 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 4040 transitions. [2025-04-13 23:04:41,523 INFO L79 Accepts]: Start accepts. Automaton has 1181 states and 4040 transitions. Word has length 25 [2025-04-13 23:04:41,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:41,523 INFO L485 AbstractCegarLoop]: Abstraction has 1181 states and 4040 transitions. [2025-04-13 23:04:41,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:41,523 INFO L278 IsEmpty]: Start isEmpty. Operand 1181 states and 4040 transitions. [2025-04-13 23:04:41,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:41,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:41,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:41,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 23:04:41,525 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:41,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1479041198, now seen corresponding path program 58 times [2025-04-13 23:04:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:41,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531898245] [2025-04-13 23:04:41,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:41,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:41,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:41,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:41,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531898245] [2025-04-13 23:04:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531898245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:41,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:41,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:41,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488580487] [2025-04-13 23:04:41,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:41,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:41,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:41,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:41,833 INFO L87 Difference]: Start difference. First operand 1181 states and 4040 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:42,257 INFO L93 Difference]: Finished difference Result 1275 states and 4359 transitions. [2025-04-13 23:04:42,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:04:42,257 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:42,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:42,260 INFO L225 Difference]: With dead ends: 1275 [2025-04-13 23:04:42,260 INFO L226 Difference]: Without dead ends: 1269 [2025-04-13 23:04:42,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:04:42,261 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:42,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-04-13 23:04:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1183. [2025-04-13 23:04:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 3.4238578680203045) internal successors, (4047), 1182 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 4047 transitions. [2025-04-13 23:04:42,275 INFO L79 Accepts]: Start accepts. Automaton has 1183 states and 4047 transitions. Word has length 25 [2025-04-13 23:04:42,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:42,275 INFO L485 AbstractCegarLoop]: Abstraction has 1183 states and 4047 transitions. [2025-04-13 23:04:42,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:42,275 INFO L278 IsEmpty]: Start isEmpty. Operand 1183 states and 4047 transitions. [2025-04-13 23:04:42,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:42,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:42,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:42,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 23:04:42,277 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:42,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -489019522, now seen corresponding path program 59 times [2025-04-13 23:04:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:42,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860088255] [2025-04-13 23:04:42,277 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:42,282 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:42,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:42,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:42,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:42,906 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 23:04:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:42,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860088255] [2025-04-13 23:04:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860088255] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:42,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118424513] [2025-04-13 23:04:42,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:42,908 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:42,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 23:04:42,971 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:42,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:42,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:42,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:42,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:42,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:43,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:43,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:04:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:43,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:44,312 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:44,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:04:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118424513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:45,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 32 [2025-04-13 23:04:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290029179] [2025-04-13 23:04:45,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:45,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:04:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:04:45,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:04:45,180 INFO L87 Difference]: Start difference. First operand 1183 states and 4047 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:52,201 INFO L93 Difference]: Finished difference Result 1608 states and 5339 transitions. [2025-04-13 23:04:52,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:04:52,201 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:52,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:52,205 INFO L225 Difference]: With dead ends: 1608 [2025-04-13 23:04:52,205 INFO L226 Difference]: Without dead ends: 1592 [2025-04-13 23:04:52,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=864, Invalid=6968, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 23:04:52,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:52,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 23:04:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-04-13 23:04:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1179. [2025-04-13 23:04:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 3.4202037351443124) internal successors, (4029), 1178 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 4029 transitions. [2025-04-13 23:04:52,220 INFO L79 Accepts]: Start accepts. Automaton has 1179 states and 4029 transitions. Word has length 25 [2025-04-13 23:04:52,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:52,220 INFO L485 AbstractCegarLoop]: Abstraction has 1179 states and 4029 transitions. [2025-04-13 23:04:52,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,220 INFO L278 IsEmpty]: Start isEmpty. Operand 1179 states and 4029 transitions. [2025-04-13 23:04:52,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:52,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:52,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:52,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 23:04:52,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:52,422 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:52,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1747823288, now seen corresponding path program 60 times [2025-04-13 23:04:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:52,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578133815] [2025-04-13 23:04:52,422 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:52,426 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:52,429 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:52,430 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:52,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578133815] [2025-04-13 23:04:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578133815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:52,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741736838] [2025-04-13 23:04:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:52,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:52,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:52,750 INFO L87 Difference]: Start difference. First operand 1179 states and 4029 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:53,160 INFO L93 Difference]: Finished difference Result 1267 states and 4336 transitions. [2025-04-13 23:04:53,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:04:53,161 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:53,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:53,164 INFO L225 Difference]: With dead ends: 1267 [2025-04-13 23:04:53,164 INFO L226 Difference]: Without dead ends: 1261 [2025-04-13 23:04:53,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:04:53,165 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:53,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-04-13 23:04:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1179. [2025-04-13 23:04:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 3.4202037351443124) internal successors, (4029), 1178 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 4029 transitions. [2025-04-13 23:04:53,181 INFO L79 Accepts]: Start accepts. Automaton has 1179 states and 4029 transitions. Word has length 25 [2025-04-13 23:04:53,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:53,181 INFO L485 AbstractCegarLoop]: Abstraction has 1179 states and 4029 transitions. [2025-04-13 23:04:53,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:53,181 INFO L278 IsEmpty]: Start isEmpty. Operand 1179 states and 4029 transitions. [2025-04-13 23:04:53,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:53,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:53,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:53,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 23:04:53,183 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:53,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash -334728268, now seen corresponding path program 61 times [2025-04-13 23:04:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:53,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6939329] [2025-04-13 23:04:53,183 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:53,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:53,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:53,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:53,860 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 23:04:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:53,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6939329] [2025-04-13 23:04:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6939329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:53,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104744826] [2025-04-13 23:04:53,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:53,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:53,862 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:53,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 23:04:53,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:53,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:53,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:54,268 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:54,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:04:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:54,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:55,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:55,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:04:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104744826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:56,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:04:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445846236] [2025-04-13 23:04:56,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:56,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:56,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:56,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:56,126 INFO L87 Difference]: Start difference. First operand 1179 states and 4029 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:03,045 INFO L93 Difference]: Finished difference Result 1520 states and 5058 transitions. [2025-04-13 23:05:03,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:05:03,046 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:03,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:03,049 INFO L225 Difference]: With dead ends: 1520 [2025-04-13 23:05:03,049 INFO L226 Difference]: Without dead ends: 1509 [2025-04-13 23:05:03,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1024, Invalid=7718, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:05:03,050 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:03,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 0 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:05:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-04-13 23:05:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1173. [2025-04-13 23:05:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 3.4215017064846416) internal successors, (4010), 1172 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 4010 transitions. [2025-04-13 23:05:03,068 INFO L79 Accepts]: Start accepts. Automaton has 1173 states and 4010 transitions. Word has length 25 [2025-04-13 23:05:03,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:03,068 INFO L485 AbstractCegarLoop]: Abstraction has 1173 states and 4010 transitions. [2025-04-13 23:05:03,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:03,068 INFO L278 IsEmpty]: Start isEmpty. Operand 1173 states and 4010 transitions. [2025-04-13 23:05:03,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:03,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:03,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:03,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 23:05:03,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:03,270 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:03,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash 284814294, now seen corresponding path program 62 times [2025-04-13 23:05:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:03,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170575737] [2025-04-13 23:05:03,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:03,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:03,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:05:03,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:05:03,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:03,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170575737] [2025-04-13 23:05:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170575737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:03,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:05:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101288719] [2025-04-13 23:05:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:03,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:05:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:05:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:05:03,576 INFO L87 Difference]: Start difference. First operand 1173 states and 4010 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:04,030 INFO L93 Difference]: Finished difference Result 1289 states and 4409 transitions. [2025-04-13 23:05:04,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:05:04,030 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:04,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:04,033 INFO L225 Difference]: With dead ends: 1289 [2025-04-13 23:05:04,033 INFO L226 Difference]: Without dead ends: 1283 [2025-04-13 23:05:04,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:05:04,033 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:04,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:05:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-04-13 23:05:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1175. [2025-04-13 23:05:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 3.4233390119250426) internal successors, (4019), 1174 states have internal predecessors, (4019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 4019 transitions. [2025-04-13 23:05:04,046 INFO L79 Accepts]: Start accepts. Automaton has 1175 states and 4019 transitions. Word has length 25 [2025-04-13 23:05:04,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:04,047 INFO L485 AbstractCegarLoop]: Abstraction has 1175 states and 4019 transitions. [2025-04-13 23:05:04,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:04,047 INFO L278 IsEmpty]: Start isEmpty. Operand 1175 states and 4019 transitions. [2025-04-13 23:05:04,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:04,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:04,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:04,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 23:05:04,048 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:04,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1785978554, now seen corresponding path program 63 times [2025-04-13 23:05:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:04,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732244666] [2025-04-13 23:05:04,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:04,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:04,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:04,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:04,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:04,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732244666] [2025-04-13 23:05:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732244666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:04,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42987748] [2025-04-13 23:05:04,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:04,492 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:04,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 23:05:04,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:04,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:04,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:04,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:05:04,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:05,098 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:05,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:05:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:05,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:06,055 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:06,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 267 treesize of output 127 [2025-04-13 23:05:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42987748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:06,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:05:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168358604] [2025-04-13 23:05:06,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:06,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:05:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:06,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:05:06,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:05:06,346 INFO L87 Difference]: Start difference. First operand 1175 states and 4019 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:15,126 INFO L93 Difference]: Finished difference Result 1771 states and 5784 transitions. [2025-04-13 23:05:15,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-13 23:05:15,127 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:15,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:15,130 INFO L225 Difference]: With dead ends: 1771 [2025-04-13 23:05:15,130 INFO L226 Difference]: Without dead ends: 1740 [2025-04-13 23:05:15,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1493, Invalid=11163, Unknown=0, NotChecked=0, Total=12656 [2025-04-13 23:05:15,131 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:15,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:05:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2025-04-13 23:05:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1185. [2025-04-13 23:05:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 3.4408783783783785) internal successors, (4074), 1184 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 4074 transitions. [2025-04-13 23:05:15,148 INFO L79 Accepts]: Start accepts. Automaton has 1185 states and 4074 transitions. Word has length 25 [2025-04-13 23:05:15,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:15,148 INFO L485 AbstractCegarLoop]: Abstraction has 1185 states and 4074 transitions. [2025-04-13 23:05:15,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,148 INFO L278 IsEmpty]: Start isEmpty. Operand 1185 states and 4074 transitions. [2025-04-13 23:05:15,149 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:15,149 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:15,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:15,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:15,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2025-04-13 23:05:15,350 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:15,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash -811722450, now seen corresponding path program 64 times [2025-04-13 23:05:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:15,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311818344] [2025-04-13 23:05:15,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:15,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:15,358 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:15,358 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:15,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:15,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311818344] [2025-04-13 23:05:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311818344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:15,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943970323] [2025-04-13 23:05:15,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:15,716 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:15,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 23:05:15,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:15,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:15,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:15,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:15,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:15,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:16,248 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:16,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:05:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:16,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:16,750 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:16,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:05:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943970323] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:17,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:05:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249458791] [2025-04-13 23:05:17,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:17,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:05:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:17,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:05:17,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:05:17,983 INFO L87 Difference]: Start difference. First operand 1185 states and 4074 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:05:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:19,455 INFO L93 Difference]: Finished difference Result 1354 states and 4570 transitions. [2025-04-13 23:05:19,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:05:19,455 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 25 [2025-04-13 23:05:19,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:19,458 INFO L225 Difference]: With dead ends: 1354 [2025-04-13 23:05:19,458 INFO L226 Difference]: Without dead ends: 1343 [2025-04-13 23:05:19,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=391, Invalid=2159, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:05:19,459 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:19,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:05:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-04-13 23:05:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1189. [2025-04-13 23:05:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 3.441077441077441) internal successors, (4088), 1188 states have internal predecessors, (4088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 4088 transitions. [2025-04-13 23:05:19,480 INFO L79 Accepts]: Start accepts. Automaton has 1189 states and 4088 transitions. Word has length 25 [2025-04-13 23:05:19,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:19,481 INFO L485 AbstractCegarLoop]: Abstraction has 1189 states and 4088 transitions. [2025-04-13 23:05:19,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:05:19,481 INFO L278 IsEmpty]: Start isEmpty. Operand 1189 states and 4088 transitions. [2025-04-13 23:05:19,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:19,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:19,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:19,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 23:05:19,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2025-04-13 23:05:19,683 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:19,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash 313590718, now seen corresponding path program 65 times [2025-04-13 23:05:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:19,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191820898] [2025-04-13 23:05:19,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:19,687 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:19,695 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:19,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:20,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:20,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191820898] [2025-04-13 23:05:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191820898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:20,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968974318] [2025-04-13 23:05:20,372 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:20,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:20,374 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:20,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 23:05:20,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:20,455 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:20,455 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:20,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:20,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:05:20,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:20,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:20,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:05:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:20,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:21,782 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:21,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:05:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968974318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:22,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:05:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359064014] [2025-04-13 23:05:22,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:22,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:05:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:22,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:05:22,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:05:22,712 INFO L87 Difference]: Start difference. First operand 1189 states and 4088 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:32,084 INFO L93 Difference]: Finished difference Result 1971 states and 6524 transitions. [2025-04-13 23:05:32,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-04-13 23:05:32,085 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:32,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:32,089 INFO L225 Difference]: With dead ends: 1971 [2025-04-13 23:05:32,089 INFO L226 Difference]: Without dead ends: 1955 [2025-04-13 23:05:32,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4333 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1330, Invalid=13432, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 23:05:32,090 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 474 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4421 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:32,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 0 Invalid, 4560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4421 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:05:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2025-04-13 23:05:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1203. [2025-04-13 23:05:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1202 states have (on average 3.445091514143095) internal successors, (4141), 1202 states have internal predecessors, (4141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 4141 transitions. [2025-04-13 23:05:32,107 INFO L79 Accepts]: Start accepts. Automaton has 1203 states and 4141 transitions. Word has length 25 [2025-04-13 23:05:32,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:32,107 INFO L485 AbstractCegarLoop]: Abstraction has 1203 states and 4141 transitions. [2025-04-13 23:05:32,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,107 INFO L278 IsEmpty]: Start isEmpty. Operand 1203 states and 4141 transitions. [2025-04-13 23:05:32,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:32,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:32,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:32,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:32,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 23:05:32,309 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:32,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 257451058, now seen corresponding path program 66 times [2025-04-13 23:05:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:32,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497771077] [2025-04-13 23:05:32,309 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:32,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:32,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:05:32,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:05:32,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:32,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:32,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497771077] [2025-04-13 23:05:32,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497771077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:32,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:32,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:05:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248677562] [2025-04-13 23:05:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:32,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:05:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:32,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:05:32,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:05:32,694 INFO L87 Difference]: Start difference. First operand 1203 states and 4141 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:33,171 INFO L93 Difference]: Finished difference Result 1297 states and 4444 transitions. [2025-04-13 23:05:33,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:05:33,171 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:33,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:33,174 INFO L225 Difference]: With dead ends: 1297 [2025-04-13 23:05:33,174 INFO L226 Difference]: Without dead ends: 1291 [2025-04-13 23:05:33,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:05:33,174 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:33,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:05:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-04-13 23:05:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1205. [2025-04-13 23:05:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 3.4435215946843853) internal successors, (4146), 1204 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 4146 transitions. [2025-04-13 23:05:33,187 INFO L79 Accepts]: Start accepts. Automaton has 1205 states and 4146 transitions. Word has length 25 [2025-04-13 23:05:33,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:33,187 INFO L485 AbstractCegarLoop]: Abstraction has 1205 states and 4146 transitions. [2025-04-13 23:05:33,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,187 INFO L278 IsEmpty]: Start isEmpty. Operand 1205 states and 4146 transitions. [2025-04-13 23:05:33,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:33,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:33,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:33,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 23:05:33,189 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:33,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1232027294, now seen corresponding path program 67 times [2025-04-13 23:05:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:33,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780914057] [2025-04-13 23:05:33,189 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:33,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:33,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:33,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:33,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:33,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:33,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780914057] [2025-04-13 23:05:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780914057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:33,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183114852] [2025-04-13 23:05:33,761 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:33,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:33,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:33,763 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:33,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 23:05:33,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:33,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:33,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:33,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:05:33,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:34,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:34,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:05:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:34,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:35,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:35,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:05:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183114852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:36,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:05:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823043512] [2025-04-13 23:05:36,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:36,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:05:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:36,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:05:36,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:05:36,158 INFO L87 Difference]: Start difference. First operand 1205 states and 4146 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:43,081 INFO L93 Difference]: Finished difference Result 1458 states and 4905 transitions. [2025-04-13 23:05:43,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:05:43,081 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:43,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:43,085 INFO L225 Difference]: With dead ends: 1458 [2025-04-13 23:05:43,085 INFO L226 Difference]: Without dead ends: 1447 [2025-04-13 23:05:43,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=857, Invalid=6799, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:05:43,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:43,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 23:05:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-04-13 23:05:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1209. [2025-04-13 23:05:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 3.4403973509933774) internal successors, (4156), 1208 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 4156 transitions. [2025-04-13 23:05:43,109 INFO L79 Accepts]: Start accepts. Automaton has 1209 states and 4156 transitions. Word has length 25 [2025-04-13 23:05:43,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:43,110 INFO L485 AbstractCegarLoop]: Abstraction has 1209 states and 4156 transitions. [2025-04-13 23:05:43,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:43,110 INFO L278 IsEmpty]: Start isEmpty. Operand 1209 states and 4156 transitions. [2025-04-13 23:05:43,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:43,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:43,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:43,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 23:05:43,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 23:05:43,312 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:43,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1727890800, now seen corresponding path program 68 times [2025-04-13 23:05:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:43,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487683613] [2025-04-13 23:05:43,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:43,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:43,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:05:43,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:05:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:43,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487683613] [2025-04-13 23:05:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487683613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:43,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:05:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566450240] [2025-04-13 23:05:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:43,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:05:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:43,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:05:43,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:05:43,686 INFO L87 Difference]: Start difference. First operand 1209 states and 4156 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:44,109 INFO L93 Difference]: Finished difference Result 1283 states and 4404 transitions. [2025-04-13 23:05:44,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:05:44,109 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:44,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:44,113 INFO L225 Difference]: With dead ends: 1283 [2025-04-13 23:05:44,113 INFO L226 Difference]: Without dead ends: 1277 [2025-04-13 23:05:44,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:05:44,113 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:44,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:05:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-04-13 23:05:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1213. [2025-04-13 23:05:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 3.4405940594059405) internal successors, (4170), 1212 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4170 transitions. [2025-04-13 23:05:44,127 INFO L79 Accepts]: Start accepts. Automaton has 1213 states and 4170 transitions. Word has length 25 [2025-04-13 23:05:44,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:44,127 INFO L485 AbstractCegarLoop]: Abstraction has 1213 states and 4170 transitions. [2025-04-13 23:05:44,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,128 INFO L278 IsEmpty]: Start isEmpty. Operand 1213 states and 4170 transitions. [2025-04-13 23:05:44,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:44,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:44,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:44,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 23:05:44,129 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:44,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1879413554, now seen corresponding path program 69 times [2025-04-13 23:05:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:44,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089483300] [2025-04-13 23:05:44,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:44,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:44,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:44,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:44,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:44,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089483300] [2025-04-13 23:05:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089483300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:44,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008064370] [2025-04-13 23:05:44,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:44,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:44,622 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:44,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 23:05:44,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:44,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:44,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:44,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:44,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:05:44,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:45,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:45,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:05:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:45,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:46,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:46,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 267 treesize of output 127 [2025-04-13 23:05:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:46,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008064370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:46,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:46,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:05:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483083508] [2025-04-13 23:05:46,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:46,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:05:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:46,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:05:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:05:46,557 INFO L87 Difference]: Start difference. First operand 1213 states and 4170 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:53,504 INFO L93 Difference]: Finished difference Result 1709 states and 5890 transitions. [2025-04-13 23:05:53,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-13 23:05:53,505 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:53,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:53,509 INFO L225 Difference]: With dead ends: 1709 [2025-04-13 23:05:53,509 INFO L226 Difference]: Without dead ends: 1698 [2025-04-13 23:05:53,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2768 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1252, Invalid=7490, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:05:53,510 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:53,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:05:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-04-13 23:05:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1221. [2025-04-13 23:05:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 3.4311475409836065) internal successors, (4186), 1220 states have internal predecessors, (4186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 4186 transitions. [2025-04-13 23:05:53,527 INFO L79 Accepts]: Start accepts. Automaton has 1221 states and 4186 transitions. Word has length 25 [2025-04-13 23:05:53,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:53,527 INFO L485 AbstractCegarLoop]: Abstraction has 1221 states and 4186 transitions. [2025-04-13 23:05:53,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,527 INFO L278 IsEmpty]: Start isEmpty. Operand 1221 states and 4186 transitions. [2025-04-13 23:05:53,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:53,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:53,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:53,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 23:05:53,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:53,729 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:53,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1422240658, now seen corresponding path program 70 times [2025-04-13 23:05:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:53,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847448597] [2025-04-13 23:05:53,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:53,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:53,739 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:53,739 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:54,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847448597] [2025-04-13 23:05:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847448597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:54,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877559495] [2025-04-13 23:05:54,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:54,073 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:54,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 23:05:54,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:54,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:54,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:54,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:54,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:54,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:54,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:54,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:05:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:54,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:55,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:55,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:05:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:55,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877559495] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:55,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:05:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396969689] [2025-04-13 23:05:55,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:55,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:05:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:55,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:05:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:05:55,888 INFO L87 Difference]: Start difference. First operand 1221 states and 4186 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:05:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:57,603 INFO L93 Difference]: Finished difference Result 1417 states and 4814 transitions. [2025-04-13 23:05:57,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:05:57,603 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 25 [2025-04-13 23:05:57,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:57,606 INFO L225 Difference]: With dead ends: 1417 [2025-04-13 23:05:57,606 INFO L226 Difference]: Without dead ends: 1406 [2025-04-13 23:05:57,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:05:57,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:57,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:05:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-04-13 23:05:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1229. [2025-04-13 23:05:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 3.433224755700326) internal successors, (4216), 1228 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 4216 transitions. [2025-04-13 23:05:57,620 INFO L79 Accepts]: Start accepts. Automaton has 1229 states and 4216 transitions. Word has length 25 [2025-04-13 23:05:57,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:57,620 INFO L485 AbstractCegarLoop]: Abstraction has 1229 states and 4216 transitions. [2025-04-13 23:05:57,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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 23:05:57,621 INFO L278 IsEmpty]: Start isEmpty. Operand 1229 states and 4216 transitions. [2025-04-13 23:05:57,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:57,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:57,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:57,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:57,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 23:05:57,822 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:57,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2146771652, now seen corresponding path program 71 times [2025-04-13 23:05:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:57,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140051831] [2025-04-13 23:05:57,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:57,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:57,832 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:57,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:58,426 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 23:05:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:58,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140051831] [2025-04-13 23:05:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140051831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:58,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009276300] [2025-04-13 23:05:58,427 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:58,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:58,428 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:58,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 23:05:58,497 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:58,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:58,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:58,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:05:58,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:58,833 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:58,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:05:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:58,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:59,762 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:59,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:06:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009276300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:00,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:06:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891752231] [2025-04-13 23:06:00,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:00,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:06:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:00,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:06:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:06:00,746 INFO L87 Difference]: Start difference. First operand 1229 states and 4216 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:08,756 INFO L93 Difference]: Finished difference Result 1629 states and 5496 transitions. [2025-04-13 23:06:08,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:06:08,756 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:08,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:08,760 INFO L225 Difference]: With dead ends: 1629 [2025-04-13 23:06:08,760 INFO L226 Difference]: Without dead ends: 1618 [2025-04-13 23:06:08,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1298, Invalid=9832, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 23:06:08,761 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:08,761 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:06:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-04-13 23:06:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1223. [2025-04-13 23:06:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 3.434533551554828) internal successors, (4197), 1222 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 4197 transitions. [2025-04-13 23:06:08,777 INFO L79 Accepts]: Start accepts. Automaton has 1223 states and 4197 transitions. Word has length 25 [2025-04-13 23:06:08,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:08,777 INFO L485 AbstractCegarLoop]: Abstraction has 1223 states and 4197 transitions. [2025-04-13 23:06:08,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:08,777 INFO L278 IsEmpty]: Start isEmpty. Operand 1223 states and 4197 transitions. [2025-04-13 23:06:08,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:08,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:08,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:08,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 23:06:08,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:08,979 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:08,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -255354048, now seen corresponding path program 72 times [2025-04-13 23:06:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:08,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012388932] [2025-04-13 23:06:08,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:08,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:08,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:06:08,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:06:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:09,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012388932] [2025-04-13 23:06:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012388932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834322322] [2025-04-13 23:06:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:09,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:09,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:09,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:09,301 INFO L87 Difference]: Start difference. First operand 1223 states and 4197 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:09,759 INFO L93 Difference]: Finished difference Result 1353 states and 4653 transitions. [2025-04-13 23:06:09,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:06:09,759 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:09,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:09,762 INFO L225 Difference]: With dead ends: 1353 [2025-04-13 23:06:09,762 INFO L226 Difference]: Without dead ends: 1347 [2025-04-13 23:06:09,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:06:09,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:09,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:06:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-04-13 23:06:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1227. [2025-04-13 23:06:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 3.433931484502447) internal successors, (4210), 1226 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 4210 transitions. [2025-04-13 23:06:09,777 INFO L79 Accepts]: Start accepts. Automaton has 1227 states and 4210 transitions. Word has length 25 [2025-04-13 23:06:09,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:09,777 INFO L485 AbstractCegarLoop]: Abstraction has 1227 states and 4210 transitions. [2025-04-13 23:06:09,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:09,777 INFO L278 IsEmpty]: Start isEmpty. Operand 1227 states and 4210 transitions. [2025-04-13 23:06:09,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:09,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:09,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:09,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 23:06:09,778 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:09,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1879733774, now seen corresponding path program 73 times [2025-04-13 23:06:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:09,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699223735] [2025-04-13 23:06:09,779 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:09,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:09,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:09,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:10,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699223735] [2025-04-13 23:06:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699223735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:10,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772984560] [2025-04-13 23:06:10,410 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:10,412 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:10,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 23:06:10,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:10,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:10,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:10,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:06:10,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:10,899 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:10,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:06:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:10,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:06:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772984560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:06:10,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:06:10,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303862013] [2025-04-13 23:06:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:10,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:06:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:10,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:06:10,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:06:10,976 INFO L87 Difference]: Start difference. First operand 1227 states and 4210 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:11,234 INFO L93 Difference]: Finished difference Result 1287 states and 4368 transitions. [2025-04-13 23:06:11,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:06:11,235 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:11,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:11,238 INFO L225 Difference]: With dead ends: 1287 [2025-04-13 23:06:11,238 INFO L226 Difference]: Without dead ends: 1281 [2025-04-13 23:06:11,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:06:11,238 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:11,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:06:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-04-13 23:06:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1223. [2025-04-13 23:06:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 3.436988543371522) internal successors, (4200), 1222 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 4200 transitions. [2025-04-13 23:06:11,252 INFO L79 Accepts]: Start accepts. Automaton has 1223 states and 4200 transitions. Word has length 25 [2025-04-13 23:06:11,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:11,252 INFO L485 AbstractCegarLoop]: Abstraction has 1223 states and 4200 transitions. [2025-04-13 23:06:11,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:11,252 INFO L278 IsEmpty]: Start isEmpty. Operand 1223 states and 4200 transitions. [2025-04-13 23:06:11,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:11,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:11,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:11,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 23:06:11,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2025-04-13 23:06:11,454 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:11,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -524136138, now seen corresponding path program 74 times [2025-04-13 23:06:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:11,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394174622] [2025-04-13 23:06:11,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:06:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:11,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:11,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:06:11,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:06:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:11,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394174622] [2025-04-13 23:06:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394174622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376425622] [2025-04-13 23:06:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:11,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:11,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:11,890 INFO L87 Difference]: Start difference. First operand 1223 states and 4200 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:12,390 INFO L93 Difference]: Finished difference Result 1345 states and 4635 transitions. [2025-04-13 23:06:12,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:06:12,390 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:12,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:12,393 INFO L225 Difference]: With dead ends: 1345 [2025-04-13 23:06:12,393 INFO L226 Difference]: Without dead ends: 1339 [2025-04-13 23:06:12,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:06:12,394 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:12,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:06:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-04-13 23:06:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1223. [2025-04-13 23:06:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 3.436988543371522) internal successors, (4200), 1222 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 4200 transitions. [2025-04-13 23:06:12,408 INFO L79 Accepts]: Start accepts. Automaton has 1223 states and 4200 transitions. Word has length 25 [2025-04-13 23:06:12,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:12,408 INFO L485 AbstractCegarLoop]: Abstraction has 1223 states and 4200 transitions. [2025-04-13 23:06:12,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:12,409 INFO L278 IsEmpty]: Start isEmpty. Operand 1223 states and 4200 transitions. [2025-04-13 23:06:12,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:12,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:12,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:12,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 23:06:12,410 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:12,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 197896864, now seen corresponding path program 75 times [2025-04-13 23:06:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:12,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165021045] [2025-04-13 23:06:12,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:12,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:12,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:06:12,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:06:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:12,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165021045] [2025-04-13 23:06:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165021045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:12,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:12,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844669281] [2025-04-13 23:06:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:12,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:12,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:12,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:12,798 INFO L87 Difference]: Start difference. First operand 1223 states and 4200 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:13,348 INFO L93 Difference]: Finished difference Result 1347 states and 4608 transitions. [2025-04-13 23:06:13,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:06:13,348 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:13,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:13,351 INFO L225 Difference]: With dead ends: 1347 [2025-04-13 23:06:13,351 INFO L226 Difference]: Without dead ends: 1341 [2025-04-13 23:06:13,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:06:13,352 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:13,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:06:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-04-13 23:06:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1231. [2025-04-13 23:06:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1230 states have (on average 3.4422764227642277) internal successors, (4234), 1230 states have internal predecessors, (4234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 4234 transitions. [2025-04-13 23:06:13,374 INFO L79 Accepts]: Start accepts. Automaton has 1231 states and 4234 transitions. Word has length 25 [2025-04-13 23:06:13,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:13,374 INFO L485 AbstractCegarLoop]: Abstraction has 1231 states and 4234 transitions. [2025-04-13 23:06:13,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:13,375 INFO L278 IsEmpty]: Start isEmpty. Operand 1231 states and 4234 transitions. [2025-04-13 23:06:13,376 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:13,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:13,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:13,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 23:06:13,376 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:13,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1508501444, now seen corresponding path program 76 times [2025-04-13 23:06:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:13,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837331132] [2025-04-13 23:06:13,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:13,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:13,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:13,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:13,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:13,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837331132] [2025-04-13 23:06:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837331132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481739] [2025-04-13 23:06:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:13,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:13,710 INFO L87 Difference]: Start difference. First operand 1231 states and 4234 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:14,300 INFO L93 Difference]: Finished difference Result 1381 states and 4741 transitions. [2025-04-13 23:06:14,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:06:14,301 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:14,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:14,304 INFO L225 Difference]: With dead ends: 1381 [2025-04-13 23:06:14,304 INFO L226 Difference]: Without dead ends: 1375 [2025-04-13 23:06:14,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:06:14,305 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:14,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:06:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-04-13 23:06:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1231. [2025-04-13 23:06:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1230 states have (on average 3.4422764227642277) internal successors, (4234), 1230 states have internal predecessors, (4234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 4234 transitions. [2025-04-13 23:06:14,322 INFO L79 Accepts]: Start accepts. Automaton has 1231 states and 4234 transitions. Word has length 25 [2025-04-13 23:06:14,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:14,322 INFO L485 AbstractCegarLoop]: Abstraction has 1231 states and 4234 transitions. [2025-04-13 23:06:14,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:14,322 INFO L278 IsEmpty]: Start isEmpty. Operand 1231 states and 4234 transitions. [2025-04-13 23:06:14,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:14,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:14,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:14,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 23:06:14,324 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:14,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1518662904, now seen corresponding path program 77 times [2025-04-13 23:06:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:14,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175841836] [2025-04-13 23:06:14,324 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:14,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:14,333 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:14,333 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:14,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:14,822 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 23:06:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:14,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175841836] [2025-04-13 23:06:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175841836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:14,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28294365] [2025-04-13 23:06:14,822 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:14,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:14,824 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:14,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 23:06:14,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:14,908 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:14,908 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:14,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:06:14,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:15,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:15,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:06:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:15,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:16,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:16,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:06:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28294365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:17,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:06:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603544285] [2025-04-13 23:06:17,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:17,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:06:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:06:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:06:17,122 INFO L87 Difference]: Start difference. First operand 1231 states and 4234 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:25,264 INFO L93 Difference]: Finished difference Result 1564 states and 5300 transitions. [2025-04-13 23:06:25,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 23:06:25,264 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:25,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:25,268 INFO L225 Difference]: With dead ends: 1564 [2025-04-13 23:06:25,268 INFO L226 Difference]: Without dead ends: 1553 [2025-04-13 23:06:25,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=935, Invalid=7255, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:06:25,269 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:25,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 3486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:06:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-04-13 23:06:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1223. [2025-04-13 23:06:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 3.436988543371522) internal successors, (4200), 1222 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 4200 transitions. [2025-04-13 23:06:25,287 INFO L79 Accepts]: Start accepts. Automaton has 1223 states and 4200 transitions. Word has length 25 [2025-04-13 23:06:25,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:25,287 INFO L485 AbstractCegarLoop]: Abstraction has 1223 states and 4200 transitions. [2025-04-13 23:06:25,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,287 INFO L278 IsEmpty]: Start isEmpty. Operand 1223 states and 4200 transitions. [2025-04-13 23:06:25,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:25,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:25,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:25,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 23:06:25,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:25,489 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:25,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -56502664, now seen corresponding path program 78 times [2025-04-13 23:06:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:25,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348843956] [2025-04-13 23:06:25,490 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:25,494 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:25,497 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:06:25,497 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:06:25,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:25,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348843956] [2025-04-13 23:06:25,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348843956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:25,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:25,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063621381] [2025-04-13 23:06:25,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:25,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:25,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:25,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:25,866 INFO L87 Difference]: Start difference. First operand 1223 states and 4200 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:26,364 INFO L93 Difference]: Finished difference Result 1331 states and 4560 transitions. [2025-04-13 23:06:26,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:06:26,364 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:26,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:26,368 INFO L225 Difference]: With dead ends: 1331 [2025-04-13 23:06:26,368 INFO L226 Difference]: Without dead ends: 1325 [2025-04-13 23:06:26,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:06:26,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:26,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:06:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-04-13 23:06:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1229. [2025-04-13 23:06:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 3.4438110749185666) internal successors, (4229), 1228 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 4229 transitions. [2025-04-13 23:06:26,386 INFO L79 Accepts]: Start accepts. Automaton has 1229 states and 4229 transitions. Word has length 25 [2025-04-13 23:06:26,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:26,386 INFO L485 AbstractCegarLoop]: Abstraction has 1229 states and 4229 transitions. [2025-04-13 23:06:26,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:26,386 INFO L278 IsEmpty]: Start isEmpty. Operand 1229 states and 4229 transitions. [2025-04-13 23:06:26,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:26,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:26,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:26,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 23:06:26,388 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:26,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 159861476, now seen corresponding path program 79 times [2025-04-13 23:06:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:26,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751779484] [2025-04-13 23:06:26,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:26,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:26,952 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 23:06:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:26,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751779484] [2025-04-13 23:06:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751779484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:26,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838377329] [2025-04-13 23:06:26,953 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:26,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:26,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:26,954 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:26,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 23:06:27,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:27,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:27,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:27,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:06:27,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:27,379 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:27,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:06:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:27,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:27,998 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:27,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:06:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838377329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:29,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:06:29,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584006123] [2025-04-13 23:06:29,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:29,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:06:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:29,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:06:29,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:06:29,049 INFO L87 Difference]: Start difference. First operand 1229 states and 4229 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:32,899 INFO L93 Difference]: Finished difference Result 1636 states and 5465 transitions. [2025-04-13 23:06:32,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 23:06:32,899 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:32,900 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:32,903 INFO L225 Difference]: With dead ends: 1636 [2025-04-13 23:06:32,903 INFO L226 Difference]: Without dead ends: 1625 [2025-04-13 23:06:32,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=964, Invalid=7778, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:06:32,904 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 337 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:32,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 0 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:06:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-04-13 23:06:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1235. [2025-04-13 23:06:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 3.445705024311183) internal successors, (4252), 1234 states have internal predecessors, (4252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 4252 transitions. [2025-04-13 23:06:32,924 INFO L79 Accepts]: Start accepts. Automaton has 1235 states and 4252 transitions. Word has length 25 [2025-04-13 23:06:32,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:32,924 INFO L485 AbstractCegarLoop]: Abstraction has 1235 states and 4252 transitions. [2025-04-13 23:06:32,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:32,924 INFO L278 IsEmpty]: Start isEmpty. Operand 1235 states and 4252 transitions. [2025-04-13 23:06:32,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:32,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:32,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:32,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 23:06:33,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:33,127 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:33,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1773062432, now seen corresponding path program 80 times [2025-04-13 23:06:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:33,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267546968] [2025-04-13 23:06:33,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:06:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:33,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:33,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:33,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:33,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:33,635 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 23:06:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:33,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267546968] [2025-04-13 23:06:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267546968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:33,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606013760] [2025-04-13 23:06:33,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:06:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:33,637 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:33,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 23:06:33,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:33,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:33,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:33,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:33,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:06:33,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:34,149 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:34,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:06:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:34,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:34,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:34,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:06:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606013760] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:35,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 23:06:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778887530] [2025-04-13 23:06:35,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:35,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:06:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:35,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:06:35,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:06:35,301 INFO L87 Difference]: Start difference. First operand 1235 states and 4252 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:38,753 INFO L93 Difference]: Finished difference Result 1636 states and 5503 transitions. [2025-04-13 23:06:38,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 23:06:38,753 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:38,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:38,757 INFO L225 Difference]: With dead ends: 1636 [2025-04-13 23:06:38,757 INFO L226 Difference]: Without dead ends: 1625 [2025-04-13 23:06:38,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=862, Invalid=6970, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 23:06:38,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:38,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:06:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-04-13 23:06:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1243. [2025-04-13 23:06:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 3.4428341384863126) internal successors, (4276), 1242 states have internal predecessors, (4276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 4276 transitions. [2025-04-13 23:06:38,785 INFO L79 Accepts]: Start accepts. Automaton has 1243 states and 4276 transitions. Word has length 25 [2025-04-13 23:06:38,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:38,785 INFO L485 AbstractCegarLoop]: Abstraction has 1243 states and 4276 transitions. [2025-04-13 23:06:38,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,785 INFO L278 IsEmpty]: Start isEmpty. Operand 1243 states and 4276 transitions. [2025-04-13 23:06:38,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:38,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:38,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:38,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-04-13 23:06:38,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2025-04-13 23:06:38,987 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:38,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 522312158, now seen corresponding path program 81 times [2025-04-13 23:06:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:38,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192110715] [2025-04-13 23:06:38,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:38,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:38,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:38,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:38,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:39,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192110715] [2025-04-13 23:06:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192110715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:39,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147813139] [2025-04-13 23:06:39,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:39,453 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:39,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 23:06:39,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:39,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:39,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:39,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:39,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:06:39,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:39,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:39,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:06:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:40,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:40,686 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:40,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:06:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147813139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:40,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:06:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919562292] [2025-04-13 23:06:40,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:40,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:06:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:40,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:06:40,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:06:40,996 INFO L87 Difference]: Start difference. First operand 1243 states and 4276 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:46,525 INFO L93 Difference]: Finished difference Result 1811 states and 6071 transitions. [2025-04-13 23:06:46,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 23:06:46,526 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:46,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:46,530 INFO L225 Difference]: With dead ends: 1811 [2025-04-13 23:06:46,531 INFO L226 Difference]: Without dead ends: 1800 [2025-04-13 23:06:46,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3990 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1519, Invalid=10253, Unknown=0, NotChecked=0, Total=11772 [2025-04-13 23:06:46,532 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 324 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:46,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 0 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3146 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:06:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-04-13 23:06:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1249. [2025-04-13 23:06:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.4423076923076925) internal successors, (4296), 1248 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4296 transitions. [2025-04-13 23:06:46,552 INFO L79 Accepts]: Start accepts. Automaton has 1249 states and 4296 transitions. Word has length 25 [2025-04-13 23:06:46,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:46,552 INFO L485 AbstractCegarLoop]: Abstraction has 1249 states and 4296 transitions. [2025-04-13 23:06:46,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:46,552 INFO L278 IsEmpty]: Start isEmpty. Operand 1249 states and 4296 transitions. [2025-04-13 23:06:46,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:46,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:46,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:46,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 23:06:46,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 23:06:46,755 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:46,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2041844522, now seen corresponding path program 82 times [2025-04-13 23:06:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:46,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317492681] [2025-04-13 23:06:46,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:46,759 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:46,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:46,763 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:46,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:47,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317492681] [2025-04-13 23:06:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317492681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:47,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178280738] [2025-04-13 23:06:47,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:47,142 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:47,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 23:06:47,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:47,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:47,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:47,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:06:47,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:47,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:47,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:06:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:47,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:48,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:48,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:06:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:49,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178280738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:49,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:06:49,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267349799] [2025-04-13 23:06:49,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:49,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:06:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:49,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:06:49,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:06:49,415 INFO L87 Difference]: Start difference. First operand 1249 states and 4296 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:51,892 INFO L93 Difference]: Finished difference Result 1518 states and 5160 transitions. [2025-04-13 23:06:51,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 23:06:51,892 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:51,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:51,896 INFO L225 Difference]: With dead ends: 1518 [2025-04-13 23:06:51,896 INFO L226 Difference]: Without dead ends: 1507 [2025-04-13 23:06:51,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=568, Invalid=3722, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:06:51,897 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:51,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:06:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-04-13 23:06:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1263. [2025-04-13 23:06:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 3.454041204437401) internal successors, (4359), 1262 states have internal predecessors, (4359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 4359 transitions. [2025-04-13 23:06:51,914 INFO L79 Accepts]: Start accepts. Automaton has 1263 states and 4359 transitions. Word has length 25 [2025-04-13 23:06:51,914 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:51,914 INFO L485 AbstractCegarLoop]: Abstraction has 1263 states and 4359 transitions. [2025-04-13 23:06:51,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,914 INFO L278 IsEmpty]: Start isEmpty. Operand 1263 states and 4359 transitions. [2025-04-13 23:06:51,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:51,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:51,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:51,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-13 23:06:52,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:52,116 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:52,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash 253530068, now seen corresponding path program 83 times [2025-04-13 23:06:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:52,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306041708] [2025-04-13 23:06:52,117 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:52,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:52,127 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:52,127 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:52,585 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 23:06:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:52,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306041708] [2025-04-13 23:06:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306041708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:52,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372587955] [2025-04-13 23:06:52,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:52,587 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:52,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 23:06:52,662 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:52,678 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:52,678 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:52,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:06:52,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:52,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:52,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:06:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:53,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:53,566 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:53,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:06:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372587955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:54,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:06:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549780474] [2025-04-13 23:06:54,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:54,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:06:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:54,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:06:54,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:06:54,506 INFO L87 Difference]: Start difference. First operand 1263 states and 4359 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:57,143 INFO L93 Difference]: Finished difference Result 1513 states and 5131 transitions. [2025-04-13 23:06:57,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:06:57,144 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:57,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:57,147 INFO L225 Difference]: With dead ends: 1513 [2025-04-13 23:06:57,147 INFO L226 Difference]: Without dead ends: 1489 [2025-04-13 23:06:57,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=602, Invalid=4228, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 23:06:57,148 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:57,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:06:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-04-13 23:06:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1303. [2025-04-13 23:06:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 3.467741935483871) internal successors, (4515), 1302 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 4515 transitions. [2025-04-13 23:06:57,165 INFO L79 Accepts]: Start accepts. Automaton has 1303 states and 4515 transitions. Word has length 25 [2025-04-13 23:06:57,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:57,165 INFO L485 AbstractCegarLoop]: Abstraction has 1303 states and 4515 transitions. [2025-04-13 23:06:57,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:57,165 INFO L278 IsEmpty]: Start isEmpty. Operand 1303 states and 4515 transitions. [2025-04-13 23:06:57,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:57,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:57,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:57,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 23:06:57,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:57,367 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:57,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -117364360, now seen corresponding path program 84 times [2025-04-13 23:06:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:57,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228451074] [2025-04-13 23:06:57,368 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:57,371 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:57,376 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:57,376 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:57,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228451074] [2025-04-13 23:06:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228451074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:57,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634612689] [2025-04-13 23:06:57,719 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:57,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:57,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:57,721 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:57,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 23:06:57,792 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:57,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:57,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:57,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:57,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:06:57,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:58,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:58,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:06:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:58,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:58,956 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:58,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:06:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634612689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:59,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:06:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643664273] [2025-04-13 23:06:59,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:59,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:06:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:59,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:06:59,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:06:59,278 INFO L87 Difference]: Start difference. First operand 1303 states and 4515 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:02,480 INFO L93 Difference]: Finished difference Result 1674 states and 5730 transitions. [2025-04-13 23:07:02,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:07:02,480 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:02,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:02,484 INFO L225 Difference]: With dead ends: 1674 [2025-04-13 23:07:02,485 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 23:07:02,485 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1097, Invalid=5875, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:07:02,485 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:02,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:07:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 23:07:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1299. [2025-04-13 23:07:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 3.467642526964561) internal successors, (4501), 1298 states have internal predecessors, (4501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 4501 transitions. [2025-04-13 23:07:02,505 INFO L79 Accepts]: Start accepts. Automaton has 1299 states and 4501 transitions. Word has length 25 [2025-04-13 23:07:02,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:02,505 INFO L485 AbstractCegarLoop]: Abstraction has 1299 states and 4501 transitions. [2025-04-13 23:07:02,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:02,505 INFO L278 IsEmpty]: Start isEmpty. Operand 1299 states and 4501 transitions. [2025-04-13 23:07:02,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:02,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:02,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:02,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-13 23:07:02,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2025-04-13 23:07:02,707 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:02,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2072793384, now seen corresponding path program 85 times [2025-04-13 23:07:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:02,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972715780] [2025-04-13 23:07:02,708 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:02,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:02,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:03,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972715780] [2025-04-13 23:07:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972715780] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:03,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874041934] [2025-04-13 23:07:03,197 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:03,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:03,199 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:03,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 23:07:03,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:03,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:03,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:03,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:03,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:07:03,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:03,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:03,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:07:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:03,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:04,419 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:04,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:07:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874041934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:05,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:05,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:07:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044755231] [2025-04-13 23:07:05,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:05,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:07:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:05,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:07:05,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:07:05,414 INFO L87 Difference]: Start difference. First operand 1299 states and 4501 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:07,999 INFO L93 Difference]: Finished difference Result 1476 states and 4989 transitions. [2025-04-13 23:07:07,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:07:07,999 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:08,000 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:08,003 INFO L225 Difference]: With dead ends: 1476 [2025-04-13 23:07:08,003 INFO L226 Difference]: Without dead ends: 1465 [2025-04-13 23:07:08,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=445, Invalid=3587, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:07:08,003 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:08,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:07:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-04-13 23:07:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1305. [2025-04-13 23:07:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 3.4708588957055215) internal successors, (4526), 1304 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 4526 transitions. [2025-04-13 23:07:08,019 INFO L79 Accepts]: Start accepts. Automaton has 1305 states and 4526 transitions. Word has length 25 [2025-04-13 23:07:08,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:08,019 INFO L485 AbstractCegarLoop]: Abstraction has 1305 states and 4526 transitions. [2025-04-13 23:07:08,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:08,019 INFO L278 IsEmpty]: Start isEmpty. Operand 1305 states and 4526 transitions. [2025-04-13 23:07:08,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:08,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:08,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:08,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-13 23:07:08,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2025-04-13 23:07:08,221 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:08,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1915273222, now seen corresponding path program 86 times [2025-04-13 23:07:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:08,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979641071] [2025-04-13 23:07:08,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:08,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:08,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:08,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:08,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:08,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979641071] [2025-04-13 23:07:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979641071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:08,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459028970] [2025-04-13 23:07:08,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:08,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:08,591 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 23:07:08,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:08,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:08,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:08,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:08,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:09,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:07:09,200 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:09,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 23:07:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:09,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:09,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:09,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:07:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459028970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:10,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:07:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268693454] [2025-04-13 23:07:10,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:10,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:07:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:10,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:07:10,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:07:10,172 INFO L87 Difference]: Start difference. First operand 1305 states and 4526 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:12,877 INFO L93 Difference]: Finished difference Result 1649 states and 5711 transitions. [2025-04-13 23:07:12,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:07:12,877 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:12,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:12,881 INFO L225 Difference]: With dead ends: 1649 [2025-04-13 23:07:12,881 INFO L226 Difference]: Without dead ends: 1638 [2025-04-13 23:07:12,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=776, Invalid=4480, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 23:07:12,882 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:12,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:07:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-04-13 23:07:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1311. [2025-04-13 23:07:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 3.4709923664122138) internal successors, (4547), 1310 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 4547 transitions. [2025-04-13 23:07:12,898 INFO L79 Accepts]: Start accepts. Automaton has 1311 states and 4547 transitions. Word has length 25 [2025-04-13 23:07:12,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:12,898 INFO L485 AbstractCegarLoop]: Abstraction has 1311 states and 4547 transitions. [2025-04-13 23:07:12,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:12,898 INFO L278 IsEmpty]: Start isEmpty. Operand 1311 states and 4547 transitions. [2025-04-13 23:07:12,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:12,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:12,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:12,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-04-13 23:07:13,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:13,100 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:13,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1917457306, now seen corresponding path program 87 times [2025-04-13 23:07:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:13,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157473117] [2025-04-13 23:07:13,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:13,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:13,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:13,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:13,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157473117] [2025-04-13 23:07:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157473117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:13,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860481468] [2025-04-13 23:07:13,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:13,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:13,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:13,499 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:13,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 23:07:13,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:13,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:13,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:13,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:13,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:13,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:13,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:13,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:07:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:14,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:14,795 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:14,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:07:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860481468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:15,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:07:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616024910] [2025-04-13 23:07:15,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:15,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:07:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:15,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:07:15,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:15,144 INFO L87 Difference]: Start difference. First operand 1311 states and 4547 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:20,484 INFO L93 Difference]: Finished difference Result 1693 states and 5837 transitions. [2025-04-13 23:07:20,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 23:07:20,484 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:20,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:20,488 INFO L225 Difference]: With dead ends: 1693 [2025-04-13 23:07:20,488 INFO L226 Difference]: Without dead ends: 1682 [2025-04-13 23:07:20,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1357, Invalid=8149, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:07:20,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:20,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:07:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-04-13 23:07:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1325. [2025-04-13 23:07:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 3.472809667673716) internal successors, (4598), 1324 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4598 transitions. [2025-04-13 23:07:20,506 INFO L79 Accepts]: Start accepts. Automaton has 1325 states and 4598 transitions. Word has length 25 [2025-04-13 23:07:20,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:20,506 INFO L485 AbstractCegarLoop]: Abstraction has 1325 states and 4598 transitions. [2025-04-13 23:07:20,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,507 INFO L278 IsEmpty]: Start isEmpty. Operand 1325 states and 4598 transitions. [2025-04-13 23:07:20,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:20,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:20,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:20,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 23:07:20,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable120 [2025-04-13 23:07:20,709 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:20,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2086454542, now seen corresponding path program 88 times [2025-04-13 23:07:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:20,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565092220] [2025-04-13 23:07:20,709 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:20,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:20,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:20,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:20,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:21,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565092220] [2025-04-13 23:07:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565092220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:21,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441540823] [2025-04-13 23:07:21,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:21,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:21,133 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:21,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-13 23:07:21,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:21,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:21,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:21,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:07:21,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:21,729 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:21,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:07:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:21,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:22,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:22,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:07:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441540823] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:23,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:07:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328748688] [2025-04-13 23:07:23,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:23,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:07:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:23,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:07:23,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:07:23,267 INFO L87 Difference]: Start difference. First operand 1325 states and 4598 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:26,579 INFO L93 Difference]: Finished difference Result 1803 states and 5925 transitions. [2025-04-13 23:07:26,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:07:26,580 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:26,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:26,583 INFO L225 Difference]: With dead ends: 1803 [2025-04-13 23:07:26,584 INFO L226 Difference]: Without dead ends: 1782 [2025-04-13 23:07:26,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=675, Invalid=6131, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 23:07:26,584 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3443 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:26,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 3492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3443 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:07:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-04-13 23:07:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1361. [2025-04-13 23:07:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 3.4808823529411765) internal successors, (4734), 1360 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 4734 transitions. [2025-04-13 23:07:26,602 INFO L79 Accepts]: Start accepts. Automaton has 1361 states and 4734 transitions. Word has length 25 [2025-04-13 23:07:26,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:26,602 INFO L485 AbstractCegarLoop]: Abstraction has 1361 states and 4734 transitions. [2025-04-13 23:07:26,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:26,603 INFO L278 IsEmpty]: Start isEmpty. Operand 1361 states and 4734 transitions. [2025-04-13 23:07:26,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:26,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:26,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:26,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-04-13 23:07:26,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:26,805 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:26,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash -344872408, now seen corresponding path program 89 times [2025-04-13 23:07:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:26,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532910239] [2025-04-13 23:07:26,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:26,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:26,814 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:26,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:26,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:27,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532910239] [2025-04-13 23:07:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532910239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:27,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103728392] [2025-04-13 23:07:27,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:27,460 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:27,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-13 23:07:27,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:27,552 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:27,552 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:27,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:27,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:07:27,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:27,970 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:27,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:07:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:28,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:28,691 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:28,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 361 treesize of output 165 [2025-04-13 23:07:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103728392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:29,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 30 [2025-04-13 23:07:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237437453] [2025-04-13 23:07:29,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:29,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:07:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:29,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:07:29,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:07:29,641 INFO L87 Difference]: Start difference. First operand 1361 states and 4734 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:33,027 INFO L93 Difference]: Finished difference Result 1568 states and 5377 transitions. [2025-04-13 23:07:33,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 23:07:33,028 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:33,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:33,031 INFO L225 Difference]: With dead ends: 1568 [2025-04-13 23:07:33,032 INFO L226 Difference]: Without dead ends: 1557 [2025-04-13 23:07:33,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=455, Invalid=3705, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:07:33,032 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:33,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:07:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-04-13 23:07:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1361. [2025-04-13 23:07:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 3.4808823529411765) internal successors, (4734), 1360 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 4734 transitions. [2025-04-13 23:07:33,050 INFO L79 Accepts]: Start accepts. Automaton has 1361 states and 4734 transitions. Word has length 25 [2025-04-13 23:07:33,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:33,050 INFO L485 AbstractCegarLoop]: Abstraction has 1361 states and 4734 transitions. [2025-04-13 23:07:33,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:33,050 INFO L278 IsEmpty]: Start isEmpty. Operand 1361 states and 4734 transitions. [2025-04-13 23:07:33,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:33,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:33,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:33,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-13 23:07:33,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2025-04-13 23:07:33,252 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:33,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash -710779950, now seen corresponding path program 90 times [2025-04-13 23:07:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:33,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973089051] [2025-04-13 23:07:33,253 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:07:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:33,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:33,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:33,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:07:33,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:33,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973089051] [2025-04-13 23:07:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973089051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:33,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543616956] [2025-04-13 23:07:33,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:07:33,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:33,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:33,635 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:33,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-13 23:07:33,709 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:33,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:33,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:07:33,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:33,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:07:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:34,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:34,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:07:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:34,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:35,017 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:35,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:07:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543616956] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:35,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:35,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:07:35,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499215189] [2025-04-13 23:07:35,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:35,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:07:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:35,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:07:35,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:35,345 INFO L87 Difference]: Start difference. First operand 1361 states and 4734 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:40,103 INFO L93 Difference]: Finished difference Result 1789 states and 6187 transitions. [2025-04-13 23:07:40,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 23:07:40,103 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:40,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:40,107 INFO L225 Difference]: With dead ends: 1789 [2025-04-13 23:07:40,107 INFO L226 Difference]: Without dead ends: 1778 [2025-04-13 23:07:40,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1414, Invalid=7328, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:07:40,108 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:40,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:07:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-04-13 23:07:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1365. [2025-04-13 23:07:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 3.4809384164222874) internal successors, (4748), 1364 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 4748 transitions. [2025-04-13 23:07:40,125 INFO L79 Accepts]: Start accepts. Automaton has 1365 states and 4748 transitions. Word has length 25 [2025-04-13 23:07:40,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:40,125 INFO L485 AbstractCegarLoop]: Abstraction has 1365 states and 4748 transitions. [2025-04-13 23:07:40,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:40,126 INFO L278 IsEmpty]: Start isEmpty. Operand 1365 states and 4748 transitions. [2025-04-13 23:07:40,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:40,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:40,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:40,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-04-13 23:07:40,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 23:07:40,328 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:40,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -607874096, now seen corresponding path program 91 times [2025-04-13 23:07:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:40,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101025260] [2025-04-13 23:07:40,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:40,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:40,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:40,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:40,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101025260] [2025-04-13 23:07:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101025260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:40,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136664967] [2025-04-13 23:07:40,833 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:40,835 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:40,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-13 23:07:40,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:40,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:40,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:40,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:40,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:07:40,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:41,296 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:41,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:07:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:41,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:07:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136664967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:07:41,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:07:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:07:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858205180] [2025-04-13 23:07:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:07:41,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:07:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:41,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:07:41,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:07:41,362 INFO L87 Difference]: Start difference. First operand 1365 states and 4748 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:41,603 INFO L93 Difference]: Finished difference Result 1417 states and 4882 transitions. [2025-04-13 23:07:41,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:07:41,603 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:41,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:41,606 INFO L225 Difference]: With dead ends: 1417 [2025-04-13 23:07:41,607 INFO L226 Difference]: Without dead ends: 1411 [2025-04-13 23:07:41,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:07:41,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:41,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:07:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-04-13 23:07:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1365. [2025-04-13 23:07:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 3.4809384164222874) internal successors, (4748), 1364 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 4748 transitions. [2025-04-13 23:07:41,623 INFO L79 Accepts]: Start accepts. Automaton has 1365 states and 4748 transitions. Word has length 25 [2025-04-13 23:07:41,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:41,623 INFO L485 AbstractCegarLoop]: Abstraction has 1365 states and 4748 transitions. [2025-04-13 23:07:41,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:41,623 INFO L278 IsEmpty]: Start isEmpty. Operand 1365 states and 4748 transitions. [2025-04-13 23:07:41,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:41,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:41,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:41,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-13 23:07:41,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2025-04-13 23:07:41,826 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:41,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1598845488, now seen corresponding path program 92 times [2025-04-13 23:07:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:41,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128692446] [2025-04-13 23:07:41,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:41,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:41,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:41,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:41,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:41,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:42,290 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 23:07:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:42,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128692446] [2025-04-13 23:07:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128692446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:42,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646802105] [2025-04-13 23:07:42,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:42,292 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-13 23:07:42,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:42,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:42,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:42,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:42,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:07:42,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:42,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:42,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2025-04-13 23:07:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:43,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:43,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:43,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:07:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646802105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:44,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:44,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 34 [2025-04-13 23:07:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351114243] [2025-04-13 23:07:44,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:44,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:07:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:44,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:07:44,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:07:44,018 INFO L87 Difference]: Start difference. First operand 1365 states and 4748 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:48,418 INFO L93 Difference]: Finished difference Result 1816 states and 6300 transitions. [2025-04-13 23:07:48,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:07:48,419 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:48,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:48,423 INFO L225 Difference]: With dead ends: 1816 [2025-04-13 23:07:48,423 INFO L226 Difference]: Without dead ends: 1805 [2025-04-13 23:07:48,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1281, Invalid=6729, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 23:07:48,424 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:48,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:07:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-04-13 23:07:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1365. [2025-04-13 23:07:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 3.4809384164222874) internal successors, (4748), 1364 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 4748 transitions. [2025-04-13 23:07:48,441 INFO L79 Accepts]: Start accepts. Automaton has 1365 states and 4748 transitions. Word has length 25 [2025-04-13 23:07:48,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:48,441 INFO L485 AbstractCegarLoop]: Abstraction has 1365 states and 4748 transitions. [2025-04-13 23:07:48,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,441 INFO L278 IsEmpty]: Start isEmpty. Operand 1365 states and 4748 transitions. [2025-04-13 23:07:48,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:48,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:48,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:48,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-13 23:07:48,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:48,644 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:48,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1954403496, now seen corresponding path program 93 times [2025-04-13 23:07:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:48,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600641568] [2025-04-13 23:07:48,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:48,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:48,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:48,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:48,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:49,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600641568] [2025-04-13 23:07:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600641568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:49,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238392547] [2025-04-13 23:07:49,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:49,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:49,185 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:49,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-13 23:07:49,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:49,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:49,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:49,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:49,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:49,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:07:49,792 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:49,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 85 [2025-04-13 23:07:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:49,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:50,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:50,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:07:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238392547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:50,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:07:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303311246] [2025-04-13 23:07:50,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:50,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:07:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:50,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:07:50,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:50,882 INFO L87 Difference]: Start difference. First operand 1365 states and 4748 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:55,054 INFO L93 Difference]: Finished difference Result 1869 states and 6443 transitions. [2025-04-13 23:07:55,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:07:55,054 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:55,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:55,058 INFO L225 Difference]: With dead ends: 1869 [2025-04-13 23:07:55,058 INFO L226 Difference]: Without dead ends: 1858 [2025-04-13 23:07:55,059 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1072, Invalid=6068, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:07:55,059 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:55,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:07:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-04-13 23:07:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1367. [2025-04-13 23:07:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 3.4831625183016106) internal successors, (4758), 1366 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 4758 transitions. [2025-04-13 23:07:55,079 INFO L79 Accepts]: Start accepts. Automaton has 1367 states and 4758 transitions. Word has length 25 [2025-04-13 23:07:55,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:55,079 INFO L485 AbstractCegarLoop]: Abstraction has 1367 states and 4758 transitions. [2025-04-13 23:07:55,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:55,079 INFO L278 IsEmpty]: Start isEmpty. Operand 1367 states and 4758 transitions. [2025-04-13 23:07:55,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:55,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:55,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-13 23:07:55,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2025-04-13 23:07:55,282 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:55,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1904495630, now seen corresponding path program 94 times [2025-04-13 23:07:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:55,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123232575] [2025-04-13 23:07:55,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:55,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:55,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:55,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:55,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:55,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123232575] [2025-04-13 23:07:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123232575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:55,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336948447] [2025-04-13 23:07:55,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:55,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:55,614 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:55,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-13 23:07:55,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:55,705 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:55,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:55,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:55,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:55,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:56,064 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:56,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:07:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:56,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:56,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:56,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:07:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336948447] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:57,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2025-04-13 23:07:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318669123] [2025-04-13 23:07:57,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:57,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:07:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:57,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:07:57,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:07:57,727 INFO L87 Difference]: Start difference. First operand 1367 states and 4758 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:00,638 INFO L93 Difference]: Finished difference Result 1739 states and 5963 transitions. [2025-04-13 23:08:00,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:08:00,639 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:00,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:00,643 INFO L225 Difference]: With dead ends: 1739 [2025-04-13 23:08:00,643 INFO L226 Difference]: Without dead ends: 1728 [2025-04-13 23:08:00,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=718, Invalid=5602, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 23:08:00,644 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:00,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2439 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:08:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-04-13 23:08:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1389. [2025-04-13 23:08:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 3.4812680115273773) internal successors, (4832), 1388 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 4832 transitions. [2025-04-13 23:08:00,664 INFO L79 Accepts]: Start accepts. Automaton has 1389 states and 4832 transitions. Word has length 25 [2025-04-13 23:08:00,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:00,664 INFO L485 AbstractCegarLoop]: Abstraction has 1389 states and 4832 transitions. [2025-04-13 23:08:00,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:00,664 INFO L278 IsEmpty]: Start isEmpty. Operand 1389 states and 4832 transitions. [2025-04-13 23:08:00,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:00,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:00,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:00,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-04-13 23:08:00,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2025-04-13 23:08:00,866 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:00,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 965784292, now seen corresponding path program 95 times [2025-04-13 23:08:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:00,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651484955] [2025-04-13 23:08:00,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:00,871 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:00,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:00,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:01,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:01,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651484955] [2025-04-13 23:08:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651484955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:01,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291987908] [2025-04-13 23:08:01,462 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:01,463 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-04-13 23:08:01,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:01,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:01,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:01,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:01,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:08:01,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:02,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:02,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:08:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:02,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:02,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:02,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:08:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:03,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291987908] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:03,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:08:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:08:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583528902] [2025-04-13 23:08:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:03,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:08:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:03,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:08:03,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:08:03,586 INFO L87 Difference]: Start difference. First operand 1389 states and 4832 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:04,296 INFO L93 Difference]: Finished difference Result 1447 states and 4997 transitions. [2025-04-13 23:08:04,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:08:04,296 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:04,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:04,300 INFO L225 Difference]: With dead ends: 1447 [2025-04-13 23:08:04,300 INFO L226 Difference]: Without dead ends: 1441 [2025-04-13 23:08:04,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=1666, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 23:08:04,301 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:04,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:08:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-04-13 23:08:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1389. [2025-04-13 23:08:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 3.4812680115273773) internal successors, (4832), 1388 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 4832 transitions. [2025-04-13 23:08:04,319 INFO L79 Accepts]: Start accepts. Automaton has 1389 states and 4832 transitions. Word has length 25 [2025-04-13 23:08:04,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:04,319 INFO L485 AbstractCegarLoop]: Abstraction has 1389 states and 4832 transitions. [2025-04-13 23:08:04,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,319 INFO L278 IsEmpty]: Start isEmpty. Operand 1389 states and 4832 transitions. [2025-04-13 23:08:04,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:04,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:04,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:04,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2025-04-13 23:08:04,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2025-04-13 23:08:04,521 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:04,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1181925514, now seen corresponding path program 96 times [2025-04-13 23:08:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:04,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622037789] [2025-04-13 23:08:04,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:04,525 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:04,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:04,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:04,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622037789] [2025-04-13 23:08:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622037789] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:04,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681065819] [2025-04-13 23:08:04,948 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:04,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:04,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:04,950 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:04,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-04-13 23:08:05,027 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:05,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:05,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:05,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:05,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:05,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:05,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:08:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:05,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:06,365 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:06,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:08:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681065819] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:06,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:08:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785203910] [2025-04-13 23:08:06,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:06,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:08:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:06,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:08:06,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:08:06,692 INFO L87 Difference]: Start difference. First operand 1389 states and 4832 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:10,330 INFO L93 Difference]: Finished difference Result 1855 states and 6324 transitions. [2025-04-13 23:08:10,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:08:10,330 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:10,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:10,334 INFO L225 Difference]: With dead ends: 1855 [2025-04-13 23:08:10,334 INFO L226 Difference]: Without dead ends: 1839 [2025-04-13 23:08:10,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=896, Invalid=4804, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 23:08:10,335 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 354 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:10,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 0 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-04-13 23:08:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1399. [2025-04-13 23:08:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 3.4914163090128754) internal successors, (4881), 1398 states have internal predecessors, (4881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 4881 transitions. [2025-04-13 23:08:10,354 INFO L79 Accepts]: Start accepts. Automaton has 1399 states and 4881 transitions. Word has length 25 [2025-04-13 23:08:10,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:10,354 INFO L485 AbstractCegarLoop]: Abstraction has 1399 states and 4881 transitions. [2025-04-13 23:08:10,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:10,354 INFO L278 IsEmpty]: Start isEmpty. Operand 1399 states and 4881 transitions. [2025-04-13 23:08:10,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:10,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:10,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:10,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-04-13 23:08:10,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:10,556 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:10,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1326773358, now seen corresponding path program 97 times [2025-04-13 23:08:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:10,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241164377] [2025-04-13 23:08:10,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:10,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:10,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:10,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:10,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:11,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241164377] [2025-04-13 23:08:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241164377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:11,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47418259] [2025-04-13 23:08:11,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:11,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:11,063 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:11,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-04-13 23:08:11,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:11,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:11,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:11,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:11,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:11,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:11,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:08:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:11,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:08:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47418259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:08:11,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:08:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339010699] [2025-04-13 23:08:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:11,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:08:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:11,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:08:11,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:08:11,612 INFO L87 Difference]: Start difference. First operand 1399 states and 4881 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:11,867 INFO L93 Difference]: Finished difference Result 1457 states and 5032 transitions. [2025-04-13 23:08:11,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:08:11,867 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:11,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:11,870 INFO L225 Difference]: With dead ends: 1457 [2025-04-13 23:08:11,871 INFO L226 Difference]: Without dead ends: 1451 [2025-04-13 23:08:11,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:08:11,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:11,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2025-04-13 23:08:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1397. [2025-04-13 23:08:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 3.492836676217765) internal successors, (4876), 1396 states have internal predecessors, (4876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 4876 transitions. [2025-04-13 23:08:11,886 INFO L79 Accepts]: Start accepts. Automaton has 1397 states and 4876 transitions. Word has length 25 [2025-04-13 23:08:11,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:11,886 INFO L485 AbstractCegarLoop]: Abstraction has 1397 states and 4876 transitions. [2025-04-13 23:08:11,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,886 INFO L278 IsEmpty]: Start isEmpty. Operand 1397 states and 4876 transitions. [2025-04-13 23:08:11,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:11,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:11,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:11,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:12,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:12,088 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:12,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash 913143424, now seen corresponding path program 98 times [2025-04-13 23:08:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:12,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946375735] [2025-04-13 23:08:12,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:12,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:12,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:12,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:12,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:12,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946375735] [2025-04-13 23:08:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946375735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:12,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082237118] [2025-04-13 23:08:12,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:12,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:12,571 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:12,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-04-13 23:08:12,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:12,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:12,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:12,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:08:12,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:13,198 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:13,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:08:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:13,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:14,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:14,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:08:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082237118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:14,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:14,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:08:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845721886] [2025-04-13 23:08:14,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:14,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:14,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:14,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:14,363 INFO L87 Difference]: Start difference. First operand 1397 states and 4876 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:18,071 INFO L93 Difference]: Finished difference Result 1860 states and 6341 transitions. [2025-04-13 23:08:18,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:08:18,071 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:18,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:18,075 INFO L225 Difference]: With dead ends: 1860 [2025-04-13 23:08:18,075 INFO L226 Difference]: Without dead ends: 1844 [2025-04-13 23:08:18,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=896, Invalid=5110, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 23:08:18,076 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:18,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:08:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-04-13 23:08:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1399. [2025-04-13 23:08:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 3.495708154506438) internal successors, (4887), 1398 states have internal predecessors, (4887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 4887 transitions. [2025-04-13 23:08:18,095 INFO L79 Accepts]: Start accepts. Automaton has 1399 states and 4887 transitions. Word has length 25 [2025-04-13 23:08:18,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:18,096 INFO L485 AbstractCegarLoop]: Abstraction has 1399 states and 4887 transitions. [2025-04-13 23:08:18,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,096 INFO L278 IsEmpty]: Start isEmpty. Operand 1399 states and 4887 transitions. [2025-04-13 23:08:18,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:18,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:18,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:18,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:18,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:18,298 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:18,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash 907334136, now seen corresponding path program 99 times [2025-04-13 23:08:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:18,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58590080] [2025-04-13 23:08:18,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:18,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:18,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:08:18,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:08:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:18,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58590080] [2025-04-13 23:08:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58590080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:18,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:08:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054085417] [2025-04-13 23:08:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:18,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:18,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:18,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:18,689 INFO L87 Difference]: Start difference. First operand 1399 states and 4887 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:19,058 INFO L93 Difference]: Finished difference Result 1459 states and 5080 transitions. [2025-04-13 23:08:19,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:08:19,058 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:19,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:19,062 INFO L225 Difference]: With dead ends: 1459 [2025-04-13 23:08:19,062 INFO L226 Difference]: Without dead ends: 1453 [2025-04-13 23:08:19,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:08:19,063 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:19,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-04-13 23:08:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1399. [2025-04-13 23:08:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 3.495708154506438) internal successors, (4887), 1398 states have internal predecessors, (4887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 4887 transitions. [2025-04-13 23:08:19,080 INFO L79 Accepts]: Start accepts. Automaton has 1399 states and 4887 transitions. Word has length 25 [2025-04-13 23:08:19,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:19,080 INFO L485 AbstractCegarLoop]: Abstraction has 1399 states and 4887 transitions. [2025-04-13 23:08:19,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:19,080 INFO L278 IsEmpty]: Start isEmpty. Operand 1399 states and 4887 transitions. [2025-04-13 23:08:19,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:19,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:19,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:19,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 23:08:19,082 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:19,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1349186290, now seen corresponding path program 100 times [2025-04-13 23:08:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:19,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66866142] [2025-04-13 23:08:19,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:19,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:19,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:19,091 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:19,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66866142] [2025-04-13 23:08:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66866142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:19,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68985726] [2025-04-13 23:08:19,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:19,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:19,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:19,507 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:19,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-04-13 23:08:19,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:19,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:19,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:19,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:08:19,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:20,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:20,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:08:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:20,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:20,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:20,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:08:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:21,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68985726] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:21,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:21,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:08:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823834264] [2025-04-13 23:08:21,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:21,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:08:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:08:21,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:08:21,767 INFO L87 Difference]: Start difference. First operand 1399 states and 4887 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:25,796 INFO L93 Difference]: Finished difference Result 1903 states and 6477 transitions. [2025-04-13 23:08:25,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:08:25,796 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:25,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:25,800 INFO L225 Difference]: With dead ends: 1903 [2025-04-13 23:08:25,800 INFO L226 Difference]: Without dead ends: 1887 [2025-04-13 23:08:25,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=668, Invalid=5494, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:08:25,801 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:25,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:08:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-04-13 23:08:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1417. [2025-04-13 23:08:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 3.5021186440677967) internal successors, (4959), 1416 states have internal predecessors, (4959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 4959 transitions. [2025-04-13 23:08:25,823 INFO L79 Accepts]: Start accepts. Automaton has 1417 states and 4959 transitions. Word has length 25 [2025-04-13 23:08:25,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:25,823 INFO L485 AbstractCegarLoop]: Abstraction has 1417 states and 4959 transitions. [2025-04-13 23:08:25,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:25,823 INFO L278 IsEmpty]: Start isEmpty. Operand 1417 states and 4959 transitions. [2025-04-13 23:08:25,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:25,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:25,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:25,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2025-04-13 23:08:26,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2025-04-13 23:08:26,026 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:26,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1029899524, now seen corresponding path program 101 times [2025-04-13 23:08:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:26,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510327791] [2025-04-13 23:08:26,026 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:26,030 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:26,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:26,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:26,691 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 23:08:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:26,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510327791] [2025-04-13 23:08:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510327791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:26,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521615603] [2025-04-13 23:08:26,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:26,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:26,693 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:26,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-04-13 23:08:26,774 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:26,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:26,788 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:26,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:26,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:27,205 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:27,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:08:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:27,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:27,955 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:27,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:08:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521615603] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:28,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 32 [2025-04-13 23:08:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207580370] [2025-04-13 23:08:28,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:28,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:08:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:28,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:08:28,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:08:28,889 INFO L87 Difference]: Start difference. First operand 1417 states and 4959 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:33,973 INFO L93 Difference]: Finished difference Result 1757 states and 6009 transitions. [2025-04-13 23:08:33,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:08:33,973 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:33,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:33,987 INFO L225 Difference]: With dead ends: 1757 [2025-04-13 23:08:33,988 INFO L226 Difference]: Without dead ends: 1746 [2025-04-13 23:08:33,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=697, Invalid=5945, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:08:33,988 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:33,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:08:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-04-13 23:08:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1417. [2025-04-13 23:08:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 3.4992937853107344) internal successors, (4955), 1416 states have internal predecessors, (4955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 4955 transitions. [2025-04-13 23:08:34,007 INFO L79 Accepts]: Start accepts. Automaton has 1417 states and 4955 transitions. Word has length 25 [2025-04-13 23:08:34,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:34,007 INFO L485 AbstractCegarLoop]: Abstraction has 1417 states and 4955 transitions. [2025-04-13 23:08:34,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:34,007 INFO L278 IsEmpty]: Start isEmpty. Operand 1417 states and 4955 transitions. [2025-04-13 23:08:34,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:34,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:34,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:34,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-04-13 23:08:34,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2025-04-13 23:08:34,210 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:34,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash -253185936, now seen corresponding path program 102 times [2025-04-13 23:08:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:34,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196219271] [2025-04-13 23:08:34,210 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:34,214 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:34,219 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:34,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:34,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:34,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:34,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196219271] [2025-04-13 23:08:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196219271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:34,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534235193] [2025-04-13 23:08:34,627 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:34,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:34,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:34,629 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:34,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-04-13 23:08:34,709 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:34,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:34,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:34,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:34,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:34,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:35,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:35,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:08:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:35,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:36,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:36,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:08:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534235193] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:36,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:36,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:08:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798491990] [2025-04-13 23:08:36,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:36,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:08:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:36,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:08:36,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:08:36,392 INFO L87 Difference]: Start difference. First operand 1417 states and 4955 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:40,426 INFO L93 Difference]: Finished difference Result 1895 states and 6623 transitions. [2025-04-13 23:08:40,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:08:40,426 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:40,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:40,430 INFO L225 Difference]: With dead ends: 1895 [2025-04-13 23:08:40,430 INFO L226 Difference]: Without dead ends: 1884 [2025-04-13 23:08:40,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=917, Invalid=5089, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 23:08:40,431 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:40,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-04-13 23:08:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1421. [2025-04-13 23:08:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 3.502112676056338) internal successors, (4973), 1420 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4973 transitions. [2025-04-13 23:08:40,451 INFO L79 Accepts]: Start accepts. Automaton has 1421 states and 4973 transitions. Word has length 25 [2025-04-13 23:08:40,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:40,451 INFO L485 AbstractCegarLoop]: Abstraction has 1421 states and 4973 transitions. [2025-04-13 23:08:40,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:40,451 INFO L278 IsEmpty]: Start isEmpty. Operand 1421 states and 4973 transitions. [2025-04-13 23:08:40,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:40,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:40,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:40,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2025-04-13 23:08:40,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 23:08:40,653 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:40,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -875608270, now seen corresponding path program 103 times [2025-04-13 23:08:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:40,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107969120] [2025-04-13 23:08:40,653 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:40,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:40,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:40,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:40,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:41,199 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 23:08:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:41,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107969120] [2025-04-13 23:08:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107969120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:41,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097837551] [2025-04-13 23:08:41,200 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:41,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:41,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:41,202 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:41,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-04-13 23:08:41,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:41,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:41,625 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:41,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:08:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:41,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:42,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:42,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:08:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097837551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:43,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:08:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921111828] [2025-04-13 23:08:43,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:43,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:43,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:43,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:43,423 INFO L87 Difference]: Start difference. First operand 1421 states and 4973 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:48,635 INFO L93 Difference]: Finished difference Result 1698 states and 5816 transitions. [2025-04-13 23:08:48,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:08:48,636 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:48,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:48,643 INFO L225 Difference]: With dead ends: 1698 [2025-04-13 23:08:48,643 INFO L226 Difference]: Without dead ends: 1687 [2025-04-13 23:08:48,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=977, Invalid=7213, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:08:48,644 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:48,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:08:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-04-13 23:08:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1409. [2025-04-13 23:08:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 3.5021306818181817) internal successors, (4931), 1408 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 4931 transitions. [2025-04-13 23:08:48,664 INFO L79 Accepts]: Start accepts. Automaton has 1409 states and 4931 transitions. Word has length 25 [2025-04-13 23:08:48,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:48,664 INFO L485 AbstractCegarLoop]: Abstraction has 1409 states and 4931 transitions. [2025-04-13 23:08:48,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:48,664 INFO L278 IsEmpty]: Start isEmpty. Operand 1409 states and 4931 transitions. [2025-04-13 23:08:48,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:48,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:48,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2025-04-13 23:08:48,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 23:08:48,866 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:48,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1779451646, now seen corresponding path program 104 times [2025-04-13 23:08:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:48,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452953223] [2025-04-13 23:08:48,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:48,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:48,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:48,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:49,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452953223] [2025-04-13 23:08:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452953223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:49,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932186982] [2025-04-13 23:08:49,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:49,254 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-04-13 23:08:49,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:49,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:49,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:49,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:49,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:08:49,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:49,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:08:49,956 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:49,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 23:08:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:50,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:50,827 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:50,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:08:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932186982] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:51,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:08:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518629986] [2025-04-13 23:08:51,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:51,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:51,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:51,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:51,217 INFO L87 Difference]: Start difference. First operand 1409 states and 4931 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:55,087 INFO L93 Difference]: Finished difference Result 1803 states and 6349 transitions. [2025-04-13 23:08:55,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:08:55,087 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:55,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:55,091 INFO L225 Difference]: With dead ends: 1803 [2025-04-13 23:08:55,092 INFO L226 Difference]: Without dead ends: 1792 [2025-04-13 23:08:55,092 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=753, Invalid=4797, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:08:55,092 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:55,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 0 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:08:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-04-13 23:08:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1401. [2025-04-13 23:08:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 3.499285714285714) internal successors, (4899), 1400 states have internal predecessors, (4899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4899 transitions. [2025-04-13 23:08:55,113 INFO L79 Accepts]: Start accepts. Automaton has 1401 states and 4899 transitions. Word has length 25 [2025-04-13 23:08:55,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:55,113 INFO L485 AbstractCegarLoop]: Abstraction has 1401 states and 4899 transitions. [2025-04-13 23:08:55,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,113 INFO L278 IsEmpty]: Start isEmpty. Operand 1401 states and 4899 transitions. [2025-04-13 23:08:55,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:55,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:55,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:55,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2025-04-13 23:08:55,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2025-04-13 23:08:55,315 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:55,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1245098552, now seen corresponding path program 105 times [2025-04-13 23:08:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:55,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834364461] [2025-04-13 23:08:55,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:55,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:55,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:55,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:55,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:55,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834364461] [2025-04-13 23:08:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834364461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:55,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227413277] [2025-04-13 23:08:55,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:55,732 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-04-13 23:08:55,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:55,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:55,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:55,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:55,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:56,358 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:56,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:08:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:56,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:57,223 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:57,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:08:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:57,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227413277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:57,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:57,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:08:57,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421329372] [2025-04-13 23:08:57,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:57,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:57,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:57,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:57,600 INFO L87 Difference]: Start difference. First operand 1401 states and 4899 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:04,475 INFO L93 Difference]: Finished difference Result 1927 states and 6527 transitions. [2025-04-13 23:09:04,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 23:09:04,475 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:04,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:04,480 INFO L225 Difference]: With dead ends: 1927 [2025-04-13 23:09:04,480 INFO L226 Difference]: Without dead ends: 1901 [2025-04-13 23:09:04,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3397 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1214, Invalid=9706, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 23:09:04,481 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:04,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:09:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-04-13 23:09:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1407. [2025-04-13 23:09:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1406 states have (on average 3.5021337126600285) internal successors, (4924), 1406 states have internal predecessors, (4924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 4924 transitions. [2025-04-13 23:09:04,501 INFO L79 Accepts]: Start accepts. Automaton has 1407 states and 4924 transitions. Word has length 25 [2025-04-13 23:09:04,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:04,501 INFO L485 AbstractCegarLoop]: Abstraction has 1407 states and 4924 transitions. [2025-04-13 23:09:04,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:04,501 INFO L278 IsEmpty]: Start isEmpty. Operand 1407 states and 4924 transitions. [2025-04-13 23:09:04,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:04,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:04,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:04,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2025-04-13 23:09:04,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:04,703 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:04,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash -693420782, now seen corresponding path program 106 times [2025-04-13 23:09:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:04,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305139862] [2025-04-13 23:09:04,704 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:04,709 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:04,714 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:04,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:04,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:05,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305139862] [2025-04-13 23:09:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305139862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:05,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844596301] [2025-04-13 23:09:05,107 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:05,109 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:05,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-04-13 23:09:05,191 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:05,204 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:05,205 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:05,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:09:05,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:05,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:05,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:09:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:05,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:06,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:06,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:09:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844596301] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:07,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:09:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568907820] [2025-04-13 23:09:07,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:07,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:09:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:07,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:09:07,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:09:07,257 INFO L87 Difference]: Start difference. First operand 1407 states and 4924 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:10,684 INFO L93 Difference]: Finished difference Result 1741 states and 5835 transitions. [2025-04-13 23:09:10,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:09:10,684 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:10,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:10,688 INFO L225 Difference]: With dead ends: 1741 [2025-04-13 23:09:10,688 INFO L226 Difference]: Without dead ends: 1725 [2025-04-13 23:09:10,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=562, Invalid=5290, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 23:09:10,689 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 338 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:10,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 0 Invalid, 3353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:09:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2025-04-13 23:09:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1433. [2025-04-13 23:09:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 3.505586592178771) internal successors, (5020), 1432 states have internal predecessors, (5020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 5020 transitions. [2025-04-13 23:09:10,709 INFO L79 Accepts]: Start accepts. Automaton has 1433 states and 5020 transitions. Word has length 25 [2025-04-13 23:09:10,709 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:10,709 INFO L485 AbstractCegarLoop]: Abstraction has 1433 states and 5020 transitions. [2025-04-13 23:09:10,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:10,709 INFO L278 IsEmpty]: Start isEmpty. Operand 1433 states and 5020 transitions. [2025-04-13 23:09:10,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:10,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:10,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:10,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-04-13 23:09:10,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:10,911 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:10,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -836243840, now seen corresponding path program 107 times [2025-04-13 23:09:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:10,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694719215] [2025-04-13 23:09:10,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:10,916 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:10,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:10,923 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:10,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:11,483 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 23:09:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:11,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694719215] [2025-04-13 23:09:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694719215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:11,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139839110] [2025-04-13 23:09:11,483 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:11,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:11,485 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:11,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-04-13 23:09:11,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:11,582 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:11,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:11,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:09:11,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:12,046 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:12,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:09:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:12,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:12,531 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:12,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:09:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139839110] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:13,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 23:09:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927269858] [2025-04-13 23:09:13,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:13,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:09:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:13,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:09:13,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:09:13,561 INFO L87 Difference]: Start difference. First operand 1433 states and 5020 transitions. Second operand has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:15,513 INFO L93 Difference]: Finished difference Result 1754 states and 6038 transitions. [2025-04-13 23:09:15,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:09:15,514 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:15,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:15,518 INFO L225 Difference]: With dead ends: 1754 [2025-04-13 23:09:15,518 INFO L226 Difference]: Without dead ends: 1743 [2025-04-13 23:09:15,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=467, Invalid=3565, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:09:15,518 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:15,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:09:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-04-13 23:09:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1461. [2025-04-13 23:09:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 3.506164383561644) internal successors, (5119), 1460 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 5119 transitions. [2025-04-13 23:09:15,536 INFO L79 Accepts]: Start accepts. Automaton has 1461 states and 5119 transitions. Word has length 25 [2025-04-13 23:09:15,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:15,536 INFO L485 AbstractCegarLoop]: Abstraction has 1461 states and 5119 transitions. [2025-04-13 23:09:15,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:15,537 INFO L278 IsEmpty]: Start isEmpty. Operand 1461 states and 5119 transitions. [2025-04-13 23:09:15,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:15,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:15,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:15,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:15,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:15,739 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:15,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1000613152, now seen corresponding path program 108 times [2025-04-13 23:09:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:15,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673528444] [2025-04-13 23:09:15,739 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:15,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:15,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:15,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:16,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673528444] [2025-04-13 23:09:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673528444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:16,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283674219] [2025-04-13 23:09:16,194 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:16,196 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-04-13 23:09:16,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:16,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:16,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:16,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:09:16,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:16,849 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:16,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:09:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:17,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:17,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:17,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:09:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283674219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:18,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:09:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858536484] [2025-04-13 23:09:18,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:18,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:09:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:18,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:09:18,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:09:18,002 INFO L87 Difference]: Start difference. First operand 1461 states and 5119 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:21,443 INFO L93 Difference]: Finished difference Result 1885 states and 6453 transitions. [2025-04-13 23:09:21,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:09:21,443 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:21,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:21,447 INFO L225 Difference]: With dead ends: 1885 [2025-04-13 23:09:21,447 INFO L226 Difference]: Without dead ends: 1869 [2025-04-13 23:09:21,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=803, Invalid=4747, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:09:21,448 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:21,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:09:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-04-13 23:09:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1475. [2025-04-13 23:09:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 3.514925373134328) internal successors, (5181), 1474 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 5181 transitions. [2025-04-13 23:09:21,467 INFO L79 Accepts]: Start accepts. Automaton has 1475 states and 5181 transitions. Word has length 25 [2025-04-13 23:09:21,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:21,467 INFO L485 AbstractCegarLoop]: Abstraction has 1475 states and 5181 transitions. [2025-04-13 23:09:21,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:21,467 INFO L278 IsEmpty]: Start isEmpty. Operand 1475 states and 5181 transitions. [2025-04-13 23:09:21,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:21,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:21,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:21,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-04-13 23:09:21,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:21,669 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:21,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2140292214, now seen corresponding path program 109 times [2025-04-13 23:09:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:21,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056415053] [2025-04-13 23:09:21,669 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:21,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:21,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:21,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:22,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056415053] [2025-04-13 23:09:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056415053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:22,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346247363] [2025-04-13 23:09:22,175 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:22,177 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:22,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-04-13 23:09:22,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:22,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:22,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:22,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:09:22,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:22,646 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:22,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:09:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:22,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:09:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346247363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:09:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:09:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487822085] [2025-04-13 23:09:22,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:22,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:09:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:22,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:09:22,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:09:22,720 INFO L87 Difference]: Start difference. First operand 1475 states and 5181 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:22,984 INFO L93 Difference]: Finished difference Result 1535 states and 5344 transitions. [2025-04-13 23:09:22,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:09:22,985 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:22,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:22,989 INFO L225 Difference]: With dead ends: 1535 [2025-04-13 23:09:22,989 INFO L226 Difference]: Without dead ends: 1529 [2025-04-13 23:09:22,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:09:22,989 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:22,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:09:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-04-13 23:09:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1481. [2025-04-13 23:09:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1480 states have (on average 3.510135135135135) internal successors, (5195), 1480 states have internal predecessors, (5195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 5195 transitions. [2025-04-13 23:09:23,007 INFO L79 Accepts]: Start accepts. Automaton has 1481 states and 5195 transitions. Word has length 25 [2025-04-13 23:09:23,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:23,007 INFO L485 AbstractCegarLoop]: Abstraction has 1481 states and 5195 transitions. [2025-04-13 23:09:23,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:23,007 INFO L278 IsEmpty]: Start isEmpty. Operand 1481 states and 5195 transitions. [2025-04-13 23:09:23,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:23,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:23,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:23,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-04-13 23:09:23,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:23,209 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:23,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1269395242, now seen corresponding path program 110 times [2025-04-13 23:09:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:23,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157814219] [2025-04-13 23:09:23,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:23,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:23,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:23,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:23,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:23,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157814219] [2025-04-13 23:09:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157814219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:23,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139334492] [2025-04-13 23:09:23,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:23,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:23,642 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-04-13 23:09:23,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:23,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:23,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:23,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:23,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:23,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:24,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:24,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:09:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:24,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:25,203 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:25,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:09:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:25,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139334492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:25,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:25,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:09:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274947365] [2025-04-13 23:09:25,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:25,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:09:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:25,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:09:25,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:09:25,502 INFO L87 Difference]: Start difference. First operand 1481 states and 5195 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:29,135 INFO L93 Difference]: Finished difference Result 1932 states and 6606 transitions. [2025-04-13 23:09:29,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:09:29,136 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:29,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:29,140 INFO L225 Difference]: With dead ends: 1932 [2025-04-13 23:09:29,141 INFO L226 Difference]: Without dead ends: 1916 [2025-04-13 23:09:29,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=900, Invalid=4952, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 23:09:29,141 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:29,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:09:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-04-13 23:09:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1477. [2025-04-13 23:09:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1476 states have (on average 3.505420054200542) internal successors, (5174), 1476 states have internal predecessors, (5174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 5174 transitions. [2025-04-13 23:09:29,160 INFO L79 Accepts]: Start accepts. Automaton has 1477 states and 5174 transitions. Word has length 25 [2025-04-13 23:09:29,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:29,160 INFO L485 AbstractCegarLoop]: Abstraction has 1477 states and 5174 transitions. [2025-04-13 23:09:29,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:29,161 INFO L278 IsEmpty]: Start isEmpty. Operand 1477 states and 5174 transitions. [2025-04-13 23:09:29,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:29,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:29,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:29,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:29,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:29,363 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:29,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash 474983366, now seen corresponding path program 111 times [2025-04-13 23:09:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:29,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192558347] [2025-04-13 23:09:29,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:29,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:29,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:09:29,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:09:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:29,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192558347] [2025-04-13 23:09:29,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192558347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:29,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:09:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775927256] [2025-04-13 23:09:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:29,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:29,726 INFO L87 Difference]: Start difference. First operand 1477 states and 5174 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:30,182 INFO L93 Difference]: Finished difference Result 1604 states and 5608 transitions. [2025-04-13 23:09:30,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:09:30,183 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:30,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:30,186 INFO L225 Difference]: With dead ends: 1604 [2025-04-13 23:09:30,186 INFO L226 Difference]: Without dead ends: 1598 [2025-04-13 23:09:30,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:09:30,187 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:30,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:09:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2025-04-13 23:09:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1479. [2025-04-13 23:09:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1478 states have (on average 3.506765899864682) internal successors, (5183), 1478 states have internal predecessors, (5183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 5183 transitions. [2025-04-13 23:09:30,204 INFO L79 Accepts]: Start accepts. Automaton has 1479 states and 5183 transitions. Word has length 25 [2025-04-13 23:09:30,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:30,204 INFO L485 AbstractCegarLoop]: Abstraction has 1479 states and 5183 transitions. [2025-04-13 23:09:30,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:30,204 INFO L278 IsEmpty]: Start isEmpty. Operand 1479 states and 5183 transitions. [2025-04-13 23:09:30,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:30,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:30,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:30,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 23:09:30,206 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:30,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash 763242340, now seen corresponding path program 112 times [2025-04-13 23:09:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:30,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757711573] [2025-04-13 23:09:30,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:30,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:30,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:30,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:30,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757711573] [2025-04-13 23:09:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757711573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:30,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258919215] [2025-04-13 23:09:30,555 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:30,556 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-04-13 23:09:30,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:30,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:30,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:30,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:30,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:31,158 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:31,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:09:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:31,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:31,691 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:31,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:09:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258919215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:32,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2025-04-13 23:09:32,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716671771] [2025-04-13 23:09:32,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:32,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:09:32,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:32,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:09:32,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:09:32,660 INFO L87 Difference]: Start difference. First operand 1479 states and 5183 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:36,370 INFO L93 Difference]: Finished difference Result 1843 states and 6237 transitions. [2025-04-13 23:09:36,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:09:36,371 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:36,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:36,375 INFO L225 Difference]: With dead ends: 1843 [2025-04-13 23:09:36,375 INFO L226 Difference]: Without dead ends: 1827 [2025-04-13 23:09:36,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=612, Invalid=5088, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 23:09:36,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:36,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:09:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-04-13 23:09:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1483. [2025-04-13 23:09:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1482 states have (on average 3.5080971659919027) internal successors, (5199), 1482 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 5199 transitions. [2025-04-13 23:09:36,393 INFO L79 Accepts]: Start accepts. Automaton has 1483 states and 5199 transitions. Word has length 25 [2025-04-13 23:09:36,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:36,393 INFO L485 AbstractCegarLoop]: Abstraction has 1483 states and 5199 transitions. [2025-04-13 23:09:36,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:36,394 INFO L278 IsEmpty]: Start isEmpty. Operand 1483 states and 5199 transitions. [2025-04-13 23:09:36,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:36,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:36,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:36,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-04-13 23:09:36,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 23:09:36,596 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:36,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash 206201276, now seen corresponding path program 113 times [2025-04-13 23:09:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:36,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930062553] [2025-04-13 23:09:36,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:36,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:36,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:36,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:37,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930062553] [2025-04-13 23:09:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930062553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:37,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500654520] [2025-04-13 23:09:37,060 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:37,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:37,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:37,062 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:37,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 23:09:37,147 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:37,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:37,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:37,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:37,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:09:37,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:37,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:37,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:09:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:37,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:38,063 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:38,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:09:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500654520] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:09:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:09:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523285244] [2025-04-13 23:09:38,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:38,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:09:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:38,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:09:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:09:38,908 INFO L87 Difference]: Start difference. First operand 1483 states and 5199 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:39,563 INFO L93 Difference]: Finished difference Result 1549 states and 5373 transitions. [2025-04-13 23:09:39,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:09:39,563 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:39,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:39,567 INFO L225 Difference]: With dead ends: 1549 [2025-04-13 23:09:39,567 INFO L226 Difference]: Without dead ends: 1543 [2025-04-13 23:09:39,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=1657, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 23:09:39,567 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:39,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:09:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-04-13 23:09:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1481. [2025-04-13 23:09:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1480 states have (on average 3.5094594594594595) internal successors, (5194), 1480 states have internal predecessors, (5194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 5194 transitions. [2025-04-13 23:09:39,584 INFO L79 Accepts]: Start accepts. Automaton has 1481 states and 5194 transitions. Word has length 25 [2025-04-13 23:09:39,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:39,584 INFO L485 AbstractCegarLoop]: Abstraction has 1481 states and 5194 transitions. [2025-04-13 23:09:39,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:39,584 INFO L278 IsEmpty]: Start isEmpty. Operand 1481 states and 5194 transitions. [2025-04-13 23:09:39,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:39,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:39,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:39,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-04-13 23:09:39,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 23:09:39,786 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:39,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2139975384, now seen corresponding path program 114 times [2025-04-13 23:09:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:39,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493512648] [2025-04-13 23:09:39,787 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:39,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:39,796 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:39,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:40,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493512648] [2025-04-13 23:09:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493512648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:40,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969169643] [2025-04-13 23:09:40,364 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:40,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:40,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:40,365 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:40,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-04-13 23:09:40,448 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:40,461 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:40,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:40,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:40,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:40,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:41,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:09:41,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:09:41,011 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:41,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 87 [2025-04-13 23:09:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:41,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:41,816 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:41,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:09:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969169643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:42,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 23:09:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293143721] [2025-04-13 23:09:42,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:42,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:09:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:42,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:09:42,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:09:42,116 INFO L87 Difference]: Start difference. First operand 1481 states and 5194 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:44,641 INFO L93 Difference]: Finished difference Result 1783 states and 6135 transitions. [2025-04-13 23:09:44,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:09:44,641 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:44,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:44,645 INFO L225 Difference]: With dead ends: 1783 [2025-04-13 23:09:44,645 INFO L226 Difference]: Without dead ends: 1772 [2025-04-13 23:09:44,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=474, Invalid=3816, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:09:44,646 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:44,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2643 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:09:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-04-13 23:09:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1513. [2025-04-13 23:09:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1512 states have (on average 3.505952380952381) internal successors, (5301), 1512 states have internal predecessors, (5301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 5301 transitions. [2025-04-13 23:09:44,663 INFO L79 Accepts]: Start accepts. Automaton has 1513 states and 5301 transitions. Word has length 25 [2025-04-13 23:09:44,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:44,663 INFO L485 AbstractCegarLoop]: Abstraction has 1513 states and 5301 transitions. [2025-04-13 23:09:44,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:44,663 INFO L278 IsEmpty]: Start isEmpty. Operand 1513 states and 5301 transitions. [2025-04-13 23:09:44,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:44,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:44,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:44,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:44,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 23:09:44,865 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:44,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1142302114, now seen corresponding path program 115 times [2025-04-13 23:09:44,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:44,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937537404] [2025-04-13 23:09:44,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:44,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:44,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:44,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:44,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:45,400 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 23:09:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:45,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937537404] [2025-04-13 23:09:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937537404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:45,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057930885] [2025-04-13 23:09:45,401 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:45,403 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-04-13 23:09:45,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:45,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:45,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:45,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:45,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:09:45,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:45,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:45,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:09:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:45,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:46,447 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:46,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:09:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:47,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057930885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:47,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:47,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:09:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556260131] [2025-04-13 23:09:47,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:47,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:09:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:47,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:09:47,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:09:47,571 INFO L87 Difference]: Start difference. First operand 1513 states and 5301 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:49,507 INFO L93 Difference]: Finished difference Result 1729 states and 5922 transitions. [2025-04-13 23:09:49,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:09:49,507 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:49,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:49,511 INFO L225 Difference]: With dead ends: 1729 [2025-04-13 23:09:49,511 INFO L226 Difference]: Without dead ends: 1718 [2025-04-13 23:09:49,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=502, Invalid=3530, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:09:49,512 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:49,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:09:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-04-13 23:09:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1519. [2025-04-13 23:09:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1518 states have (on average 3.504611330698287) internal successors, (5320), 1518 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 5320 transitions. [2025-04-13 23:09:49,529 INFO L79 Accepts]: Start accepts. Automaton has 1519 states and 5320 transitions. Word has length 25 [2025-04-13 23:09:49,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:49,530 INFO L485 AbstractCegarLoop]: Abstraction has 1519 states and 5320 transitions. [2025-04-13 23:09:49,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:49,530 INFO L278 IsEmpty]: Start isEmpty. Operand 1519 states and 5320 transitions. [2025-04-13 23:09:49,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:49,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:49,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:49,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:49,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:49,732 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:49,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -272117234, now seen corresponding path program 116 times [2025-04-13 23:09:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:49,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566581035] [2025-04-13 23:09:49,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:49,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:49,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:49,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:49,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:50,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566581035] [2025-04-13 23:09:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566581035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:50,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104322609] [2025-04-13 23:09:50,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:50,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:50,188 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:50,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-04-13 23:09:50,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:50,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:50,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:50,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:50,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:50,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:09:50,928 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:50,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 85 [2025-04-13 23:09:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:51,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:51,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:51,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:09:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104322609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:52,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:09:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499934323] [2025-04-13 23:09:52,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:52,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:09:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:09:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:09:52,085 INFO L87 Difference]: Start difference. First operand 1519 states and 5320 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:53,935 INFO L93 Difference]: Finished difference Result 1722 states and 6007 transitions. [2025-04-13 23:09:53,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:09:53,935 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:53,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:53,939 INFO L225 Difference]: With dead ends: 1722 [2025-04-13 23:09:53,939 INFO L226 Difference]: Without dead ends: 1711 [2025-04-13 23:09:53,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=2084, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 23:09:53,940 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:53,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:09:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-04-13 23:09:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1525. [2025-04-13 23:09:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 3.5013123359580054) internal successors, (5336), 1524 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 5336 transitions. [2025-04-13 23:09:53,959 INFO L79 Accepts]: Start accepts. Automaton has 1525 states and 5336 transitions. Word has length 25 [2025-04-13 23:09:53,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:53,959 INFO L485 AbstractCegarLoop]: Abstraction has 1525 states and 5336 transitions. [2025-04-13 23:09:53,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,959 INFO L278 IsEmpty]: Start isEmpty. Operand 1525 states and 5336 transitions. [2025-04-13 23:09:53,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:53,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:53,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-04-13 23:09:54,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2025-04-13 23:09:54,161 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:54,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2083491674, now seen corresponding path program 117 times [2025-04-13 23:09:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:54,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738669453] [2025-04-13 23:09:54,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:54,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:54,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:09:54,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:09:54,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:54,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738669453] [2025-04-13 23:09:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738669453] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:54,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:09:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794041206] [2025-04-13 23:09:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:54,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:54,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:54,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:54,550 INFO L87 Difference]: Start difference. First operand 1525 states and 5336 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:55,091 INFO L93 Difference]: Finished difference Result 1654 states and 5755 transitions. [2025-04-13 23:09:55,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:09:55,091 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:55,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:55,095 INFO L225 Difference]: With dead ends: 1654 [2025-04-13 23:09:55,095 INFO L226 Difference]: Without dead ends: 1648 [2025-04-13 23:09:55,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:09:55,095 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:55,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:09:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-04-13 23:09:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1533. [2025-04-13 23:09:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 3.503916449086162) internal successors, (5368), 1532 states have internal predecessors, (5368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 5368 transitions. [2025-04-13 23:09:55,112 INFO L79 Accepts]: Start accepts. Automaton has 1533 states and 5368 transitions. Word has length 25 [2025-04-13 23:09:55,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:55,112 INFO L485 AbstractCegarLoop]: Abstraction has 1533 states and 5368 transitions. [2025-04-13 23:09:55,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:55,112 INFO L278 IsEmpty]: Start isEmpty. Operand 1533 states and 5368 transitions. [2025-04-13 23:09:55,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:55,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:55,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:55,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 23:09:55,114 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:55,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 474584510, now seen corresponding path program 118 times [2025-04-13 23:09:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:55,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463277373] [2025-04-13 23:09:55,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:55,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:55,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:55,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:55,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463277373] [2025-04-13 23:09:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463277373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:55,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007028679] [2025-04-13 23:09:55,548 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:55,550 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:55,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-04-13 23:09:55,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:55,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:55,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:55,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:56,113 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:09:56,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 161 treesize of output 85 [2025-04-13 23:09:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:56,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:56,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:56,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:09:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007028679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:57,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2025-04-13 23:09:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330540616] [2025-04-13 23:09:57,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:57,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:09:57,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:57,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:09:57,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:09:57,704 INFO L87 Difference]: Start difference. First operand 1533 states and 5368 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:01,037 INFO L93 Difference]: Finished difference Result 1778 states and 6262 transitions. [2025-04-13 23:10:01,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:10:01,037 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:01,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:01,041 INFO L225 Difference]: With dead ends: 1778 [2025-04-13 23:10:01,041 INFO L226 Difference]: Without dead ends: 1772 [2025-04-13 23:10:01,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=473, Invalid=3949, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 23:10:01,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:01,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:10:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-04-13 23:10:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1548. [2025-04-13 23:10:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1547 states have (on average 3.5029088558500323) internal successors, (5419), 1547 states have internal predecessors, (5419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 5419 transitions. [2025-04-13 23:10:01,059 INFO L79 Accepts]: Start accepts. Automaton has 1548 states and 5419 transitions. Word has length 25 [2025-04-13 23:10:01,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:01,059 INFO L485 AbstractCegarLoop]: Abstraction has 1548 states and 5419 transitions. [2025-04-13 23:10:01,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:01,059 INFO L278 IsEmpty]: Start isEmpty. Operand 1548 states and 5419 transitions. [2025-04-13 23:10:01,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:01,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:01,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:01,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2025-04-13 23:10:01,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:01,262 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:01,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash 226133764, now seen corresponding path program 119 times [2025-04-13 23:10:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:01,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712463817] [2025-04-13 23:10:01,262 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:01,266 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:01,270 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:01,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:01,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:01,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712463817] [2025-04-13 23:10:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712463817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:01,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186318139] [2025-04-13 23:10:01,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:01,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:01,736 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:01,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-04-13 23:10:01,824 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:01,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:01,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:01,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:01,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:10:01,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:02,221 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:02,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:10:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:02,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:02,775 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:02,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186318139] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:03,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:10:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:10:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040232157] [2025-04-13 23:10:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:03,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:10:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:03,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:10:03,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:10:03,819 INFO L87 Difference]: Start difference. First operand 1548 states and 5419 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:04,435 INFO L93 Difference]: Finished difference Result 1604 states and 5571 transitions. [2025-04-13 23:10:04,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:10:04,435 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:04,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:04,438 INFO L225 Difference]: With dead ends: 1604 [2025-04-13 23:10:04,438 INFO L226 Difference]: Without dead ends: 1598 [2025-04-13 23:10:04,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:10:04,439 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:04,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:10:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2025-04-13 23:10:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1550. [2025-04-13 23:10:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1549 states have (on average 3.50161394448031) internal successors, (5424), 1549 states have internal predecessors, (5424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 5424 transitions. [2025-04-13 23:10:04,455 INFO L79 Accepts]: Start accepts. Automaton has 1550 states and 5424 transitions. Word has length 25 [2025-04-13 23:10:04,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:04,455 INFO L485 AbstractCegarLoop]: Abstraction has 1550 states and 5424 transitions. [2025-04-13 23:10:04,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,455 INFO L278 IsEmpty]: Start isEmpty. Operand 1550 states and 5424 transitions. [2025-04-13 23:10:04,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:04,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:04,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:04,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 23:10:04,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:04,658 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:04,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2056647116, now seen corresponding path program 120 times [2025-04-13 23:10:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:04,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989321982] [2025-04-13 23:10:04,658 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:04,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:04,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:04,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:10:04,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:05,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989321982] [2025-04-13 23:10:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989321982] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:05,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288300025] [2025-04-13 23:10:05,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:05,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:05,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:05,162 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:05,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-04-13 23:10:05,249 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:05,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:05,264 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:10:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:05,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:10:05,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:05,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:05,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:10:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:06,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:06,661 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:06,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:10:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288300025] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:07,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:07,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:10:07,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211183608] [2025-04-13 23:10:07,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:07,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:07,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:07,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:07,000 INFO L87 Difference]: Start difference. First operand 1550 states and 5424 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:11,358 INFO L93 Difference]: Finished difference Result 1984 states and 6989 transitions. [2025-04-13 23:10:11,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:10:11,358 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:11,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:11,363 INFO L225 Difference]: With dead ends: 1984 [2025-04-13 23:10:11,363 INFO L226 Difference]: Without dead ends: 1973 [2025-04-13 23:10:11,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1783 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=979, Invalid=5183, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:10:11,364 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:11,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:10:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-04-13 23:10:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1556. [2025-04-13 23:10:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 3.5067524115755626) internal successors, (5453), 1555 states have internal predecessors, (5453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 5453 transitions. [2025-04-13 23:10:11,385 INFO L79 Accepts]: Start accepts. Automaton has 1556 states and 5453 transitions. Word has length 25 [2025-04-13 23:10:11,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:11,385 INFO L485 AbstractCegarLoop]: Abstraction has 1556 states and 5453 transitions. [2025-04-13 23:10:11,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,385 INFO L278 IsEmpty]: Start isEmpty. Operand 1556 states and 5453 transitions. [2025-04-13 23:10:11,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:11,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:11,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:11,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-04-13 23:10:11,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable153 [2025-04-13 23:10:11,588 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:11,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash 531783906, now seen corresponding path program 121 times [2025-04-13 23:10:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:11,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844809223] [2025-04-13 23:10:11,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:11,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:11,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:12,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844809223] [2025-04-13 23:10:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844809223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:12,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719445385] [2025-04-13 23:10:12,054 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:12,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:12,055 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:12,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-04-13 23:10:12,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:12,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:12,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:12,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:12,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:12,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:12,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:10:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:12,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:13,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:13,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:10:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719445385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:13,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304523430] [2025-04-13 23:10:13,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:13,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:13,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:13,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:13,934 INFO L87 Difference]: Start difference. First operand 1556 states and 5453 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:16,080 INFO L93 Difference]: Finished difference Result 1816 states and 6236 transitions. [2025-04-13 23:10:16,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:10:16,080 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:16,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:16,084 INFO L225 Difference]: With dead ends: 1816 [2025-04-13 23:10:16,084 INFO L226 Difference]: Without dead ends: 1805 [2025-04-13 23:10:16,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=605, Invalid=3951, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 23:10:16,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:16,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:10:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-04-13 23:10:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1552. [2025-04-13 23:10:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 3.509348807221148) internal successors, (5443), 1551 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 5443 transitions. [2025-04-13 23:10:16,105 INFO L79 Accepts]: Start accepts. Automaton has 1552 states and 5443 transitions. Word has length 25 [2025-04-13 23:10:16,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:16,105 INFO L485 AbstractCegarLoop]: Abstraction has 1552 states and 5443 transitions. [2025-04-13 23:10:16,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:16,105 INFO L278 IsEmpty]: Start isEmpty. Operand 1552 states and 5443 transitions. [2025-04-13 23:10:16,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:16,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:16,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-04-13 23:10:16,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:16,307 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:16,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1787865026, now seen corresponding path program 122 times [2025-04-13 23:10:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:16,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528855653] [2025-04-13 23:10:16,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:16,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:16,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:16,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:16,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528855653] [2025-04-13 23:10:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528855653] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:16,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429023814] [2025-04-13 23:10:16,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:16,792 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:16,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-13 23:10:16,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:16,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:16,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:16,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:16,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:10:16,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:17,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:17,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:10:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:17,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:18,301 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:18,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:10:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429023814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:18,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:10:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634647028] [2025-04-13 23:10:18,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:18,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:18,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:18,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:18,603 INFO L87 Difference]: Start difference. First operand 1552 states and 5443 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:22,322 INFO L93 Difference]: Finished difference Result 1954 states and 6871 transitions. [2025-04-13 23:10:22,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:10:22,323 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:22,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:22,327 INFO L225 Difference]: With dead ends: 1954 [2025-04-13 23:10:22,327 INFO L226 Difference]: Without dead ends: 1943 [2025-04-13 23:10:22,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=778, Invalid=4624, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:10:22,327 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 307 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:22,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 0 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:10:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-04-13 23:10:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1552. [2025-04-13 23:10:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 3.509348807221148) internal successors, (5443), 1551 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 5443 transitions. [2025-04-13 23:10:22,347 INFO L79 Accepts]: Start accepts. Automaton has 1552 states and 5443 transitions. Word has length 25 [2025-04-13 23:10:22,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:22,347 INFO L485 AbstractCegarLoop]: Abstraction has 1552 states and 5443 transitions. [2025-04-13 23:10:22,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,347 INFO L278 IsEmpty]: Start isEmpty. Operand 1552 states and 5443 transitions. [2025-04-13 23:10:22,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:22,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:22,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:22,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2025-04-13 23:10:22,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 23:10:22,549 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:22,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 394622142, now seen corresponding path program 123 times [2025-04-13 23:10:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:22,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810659241] [2025-04-13 23:10:22,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:22,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:22,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:22,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:10:22,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:22,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810659241] [2025-04-13 23:10:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810659241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283492736] [2025-04-13 23:10:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:22,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:22,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:22,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:22,910 INFO L87 Difference]: Start difference. First operand 1552 states and 5443 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:23,503 INFO L93 Difference]: Finished difference Result 1698 states and 5925 transitions. [2025-04-13 23:10:23,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:10:23,504 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:23,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:23,507 INFO L225 Difference]: With dead ends: 1698 [2025-04-13 23:10:23,507 INFO L226 Difference]: Without dead ends: 1692 [2025-04-13 23:10:23,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:10:23,508 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:23,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:10:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-04-13 23:10:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1550. [2025-04-13 23:10:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1549 states have (on average 3.5080697224015496) internal successors, (5434), 1549 states have internal predecessors, (5434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 5434 transitions. [2025-04-13 23:10:23,526 INFO L79 Accepts]: Start accepts. Automaton has 1550 states and 5434 transitions. Word has length 25 [2025-04-13 23:10:23,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:23,526 INFO L485 AbstractCegarLoop]: Abstraction has 1550 states and 5434 transitions. [2025-04-13 23:10:23,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:23,526 INFO L278 IsEmpty]: Start isEmpty. Operand 1550 states and 5434 transitions. [2025-04-13 23:10:23,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:23,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:23,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:23,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-13 23:10:23,528 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:23,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -474464688, now seen corresponding path program 124 times [2025-04-13 23:10:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:23,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452467644] [2025-04-13 23:10:23,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:23,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:23,536 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:23,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:23,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:23,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452467644] [2025-04-13 23:10:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452467644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:23,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378538505] [2025-04-13 23:10:23,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:23,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:23,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:23,991 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-04-13 23:10:24,080 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:24,093 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:24,093 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:24,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:24,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:10:24,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:24,673 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:24,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:10:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:24,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:25,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:25,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:10:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378538505] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:26,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:10:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646427439] [2025-04-13 23:10:26,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:26,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:10:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:26,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:10:26,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:10:26,197 INFO L87 Difference]: Start difference. First operand 1550 states and 5434 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:29,242 INFO L93 Difference]: Finished difference Result 1788 states and 6243 transitions. [2025-04-13 23:10:29,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:10:29,242 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:29,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:29,246 INFO L225 Difference]: With dead ends: 1788 [2025-04-13 23:10:29,246 INFO L226 Difference]: Without dead ends: 1777 [2025-04-13 23:10:29,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=385, Invalid=3521, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 23:10:29,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:29,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:10:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-04-13 23:10:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1551. [2025-04-13 23:10:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 3.5038709677419355) internal successors, (5431), 1550 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 5431 transitions. [2025-04-13 23:10:29,265 INFO L79 Accepts]: Start accepts. Automaton has 1551 states and 5431 transitions. Word has length 25 [2025-04-13 23:10:29,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:29,265 INFO L485 AbstractCegarLoop]: Abstraction has 1551 states and 5431 transitions. [2025-04-13 23:10:29,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,265 INFO L278 IsEmpty]: Start isEmpty. Operand 1551 states and 5431 transitions. [2025-04-13 23:10:29,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:29,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:29,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:29,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-04-13 23:10:29,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 23:10:29,467 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:29,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1590719716, now seen corresponding path program 125 times [2025-04-13 23:10:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:29,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788843755] [2025-04-13 23:10:29,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:29,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:29,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:29,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:29,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788843755] [2025-04-13 23:10:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788843755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:29,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930486482] [2025-04-13 23:10:29,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:29,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:29,932 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:29,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-04-13 23:10:30,027 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:30,044 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:30,044 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:30,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:30,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:10:30,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:30,434 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:30,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:10:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:30,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:30,980 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:30,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930486482] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:10:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:10:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873642274] [2025-04-13 23:10:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:31,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:10:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:31,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:10:31,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:10:31,943 INFO L87 Difference]: Start difference. First operand 1551 states and 5431 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:32,672 INFO L93 Difference]: Finished difference Result 1637 states and 5693 transitions. [2025-04-13 23:10:32,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:10:32,672 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:32,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:32,676 INFO L225 Difference]: With dead ends: 1637 [2025-04-13 23:10:32,676 INFO L226 Difference]: Without dead ends: 1631 [2025-04-13 23:10:32,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1652, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 23:10:32,676 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:32,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:10:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-04-13 23:10:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1553. [2025-04-13 23:10:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1552 states have (on average 3.502577319587629) internal successors, (5436), 1552 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 5436 transitions. [2025-04-13 23:10:32,694 INFO L79 Accepts]: Start accepts. Automaton has 1553 states and 5436 transitions. Word has length 25 [2025-04-13 23:10:32,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:32,694 INFO L485 AbstractCegarLoop]: Abstraction has 1553 states and 5436 transitions. [2025-04-13 23:10:32,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:32,694 INFO L278 IsEmpty]: Start isEmpty. Operand 1553 states and 5436 transitions. [2025-04-13 23:10:32,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:32,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:32,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:32,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 23:10:32,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2025-04-13 23:10:32,897 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:32,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2090405234, now seen corresponding path program 126 times [2025-04-13 23:10:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:32,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919140135] [2025-04-13 23:10:32,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:32,901 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:32,907 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:32,907 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:10:32,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:33,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919140135] [2025-04-13 23:10:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919140135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:33,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535471120] [2025-04-13 23:10:33,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:33,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:33,469 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:33,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-04-13 23:10:33,566 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:33,579 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:33,579 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:10:33,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:33,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:10:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:34,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:10:34,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:10:34,148 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:34,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 87 [2025-04-13 23:10:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:34,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:35,019 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:35,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:10:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535471120] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:35,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 34 [2025-04-13 23:10:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425622844] [2025-04-13 23:10:35,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:35,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:10:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:35,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:10:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:10:35,377 INFO L87 Difference]: Start difference. First operand 1553 states and 5436 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:38,625 INFO L93 Difference]: Finished difference Result 1913 states and 6726 transitions. [2025-04-13 23:10:38,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:10:38,625 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:38,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:38,629 INFO L225 Difference]: With dead ends: 1913 [2025-04-13 23:10:38,629 INFO L226 Difference]: Without dead ends: 1902 [2025-04-13 23:10:38,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=588, Invalid=4524, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:10:38,630 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:38,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:10:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-04-13 23:10:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1553. [2025-04-13 23:10:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1552 states have (on average 3.502577319587629) internal successors, (5436), 1552 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 5436 transitions. [2025-04-13 23:10:38,649 INFO L79 Accepts]: Start accepts. Automaton has 1553 states and 5436 transitions. Word has length 25 [2025-04-13 23:10:38,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:38,649 INFO L485 AbstractCegarLoop]: Abstraction has 1553 states and 5436 transitions. [2025-04-13 23:10:38,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:38,649 INFO L278 IsEmpty]: Start isEmpty. Operand 1553 states and 5436 transitions. [2025-04-13 23:10:38,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:38,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:38,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:38,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-04-13 23:10:38,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:38,851 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:38,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1553851664, now seen corresponding path program 127 times [2025-04-13 23:10:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:38,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032851924] [2025-04-13 23:10:38,852 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:38,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:38,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:38,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:39,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032851924] [2025-04-13 23:10:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032851924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:39,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474875970] [2025-04-13 23:10:39,361 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:39,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:39,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:39,363 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:39,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-04-13 23:10:39,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:39,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:39,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:39,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:39,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:10:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:39,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:10:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474875970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:10:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:10:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190071261] [2025-04-13 23:10:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:39,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:10:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:10:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:10:39,897 INFO L87 Difference]: Start difference. First operand 1553 states and 5436 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:40,194 INFO L93 Difference]: Finished difference Result 1615 states and 5602 transitions. [2025-04-13 23:10:40,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:10:40,194 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:40,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:40,198 INFO L225 Difference]: With dead ends: 1615 [2025-04-13 23:10:40,198 INFO L226 Difference]: Without dead ends: 1609 [2025-04-13 23:10:40,198 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:10:40,198 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:40,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-04-13 23:10:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1547. [2025-04-13 23:10:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 3.5071151358344115) internal successors, (5422), 1546 states have internal predecessors, (5422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 5422 transitions. [2025-04-13 23:10:40,216 INFO L79 Accepts]: Start accepts. Automaton has 1547 states and 5422 transitions. Word has length 25 [2025-04-13 23:10:40,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:40,216 INFO L485 AbstractCegarLoop]: Abstraction has 1547 states and 5422 transitions. [2025-04-13 23:10:40,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:40,216 INFO L278 IsEmpty]: Start isEmpty. Operand 1547 states and 5422 transitions. [2025-04-13 23:10:40,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:40,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:40,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:40,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-04-13 23:10:40,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable160 [2025-04-13 23:10:40,418 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:40,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1981075666, now seen corresponding path program 128 times [2025-04-13 23:10:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:40,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520328647] [2025-04-13 23:10:40,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:40,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:40,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:40,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:40,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:40,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520328647] [2025-04-13 23:10:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520328647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:40,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440527191] [2025-04-13 23:10:40,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:40,965 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:40,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-04-13 23:10:41,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:41,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:41,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:41,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:41,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:10:41,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:41,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:41,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:10:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:41,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:42,521 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:42,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 287 treesize of output 127 [2025-04-13 23:10:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440527191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:42,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:10:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474595986] [2025-04-13 23:10:42,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:42,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:10:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:42,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:10:42,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:10:42,849 INFO L87 Difference]: Start difference. First operand 1547 states and 5422 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:48,943 INFO L93 Difference]: Finished difference Result 1912 states and 6789 transitions. [2025-04-13 23:10:48,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 23:10:48,943 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:48,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:48,948 INFO L225 Difference]: With dead ends: 1912 [2025-04-13 23:10:48,948 INFO L226 Difference]: Without dead ends: 1901 [2025-04-13 23:10:48,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1170, Invalid=6840, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 23:10:48,949 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:48,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:10:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-04-13 23:10:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1549. [2025-04-13 23:10:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1548 states have (on average 3.5045219638242893) internal successors, (5425), 1548 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 5425 transitions. [2025-04-13 23:10:48,968 INFO L79 Accepts]: Start accepts. Automaton has 1549 states and 5425 transitions. Word has length 25 [2025-04-13 23:10:48,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:48,968 INFO L485 AbstractCegarLoop]: Abstraction has 1549 states and 5425 transitions. [2025-04-13 23:10:48,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:48,968 INFO L278 IsEmpty]: Start isEmpty. Operand 1549 states and 5425 transitions. [2025-04-13 23:10:48,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:48,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:48,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:48,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2025-04-13 23:10:49,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable161 [2025-04-13 23:10:49,171 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:49,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:49,171 INFO L85 PathProgramCache]: Analyzing trace with hash 815348104, now seen corresponding path program 129 times [2025-04-13 23:10:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:49,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653701168] [2025-04-13 23:10:49,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:49,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:49,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:49,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:10:49,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:49,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:49,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653701168] [2025-04-13 23:10:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653701168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521922628] [2025-04-13 23:10:49,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:49,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:49,552 INFO L87 Difference]: Start difference. First operand 1549 states and 5425 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:49,904 INFO L93 Difference]: Finished difference Result 1635 states and 5731 transitions. [2025-04-13 23:10:49,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:10:49,904 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:49,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:49,908 INFO L225 Difference]: With dead ends: 1635 [2025-04-13 23:10:49,908 INFO L226 Difference]: Without dead ends: 1629 [2025-04-13 23:10:49,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:10:49,908 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:49,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-04-13 23:10:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1553. [2025-04-13 23:10:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1552 states have (on average 3.5045103092783507) internal successors, (5439), 1552 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 5439 transitions. [2025-04-13 23:10:49,926 INFO L79 Accepts]: Start accepts. Automaton has 1553 states and 5439 transitions. Word has length 25 [2025-04-13 23:10:49,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:49,926 INFO L485 AbstractCegarLoop]: Abstraction has 1553 states and 5439 transitions. [2025-04-13 23:10:49,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:49,926 INFO L278 IsEmpty]: Start isEmpty. Operand 1553 states and 5439 transitions. [2025-04-13 23:10:49,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:49,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:49,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:49,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-13 23:10:49,928 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:49,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -4266192, now seen corresponding path program 130 times [2025-04-13 23:10:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:49,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296672488] [2025-04-13 23:10:49,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:49,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:49,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:49,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:49,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:50,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296672488] [2025-04-13 23:10:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296672488] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:50,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853156453] [2025-04-13 23:10:50,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:50,390 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:50,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-04-13 23:10:50,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:50,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:50,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:50,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:50,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:10:50,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:50,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:50,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:10:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:50,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:51,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:51,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853156453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:52,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2025-04-13 23:10:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6244499] [2025-04-13 23:10:52,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:52,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:52,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:52,667 INFO L87 Difference]: Start difference. First operand 1553 states and 5439 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:56,572 INFO L93 Difference]: Finished difference Result 1870 states and 6613 transitions. [2025-04-13 23:10:56,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:10:56,572 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:56,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:56,577 INFO L225 Difference]: With dead ends: 1870 [2025-04-13 23:10:56,577 INFO L226 Difference]: Without dead ends: 1859 [2025-04-13 23:10:56,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=611, Invalid=5241, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 23:10:56,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 184 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3062 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:56,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 0 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3062 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:10:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-04-13 23:10:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1577. [2025-04-13 23:10:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 3.5145939086294415) internal successors, (5539), 1576 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 5539 transitions. [2025-04-13 23:10:56,596 INFO L79 Accepts]: Start accepts. Automaton has 1577 states and 5539 transitions. Word has length 25 [2025-04-13 23:10:56,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:56,596 INFO L485 AbstractCegarLoop]: Abstraction has 1577 states and 5539 transitions. [2025-04-13 23:10:56,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:56,596 INFO L278 IsEmpty]: Start isEmpty. Operand 1577 states and 5539 transitions. [2025-04-13 23:10:56,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:56,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:56,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:56,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2025-04-13 23:10:56,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:56,799 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:56,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 852216156, now seen corresponding path program 131 times [2025-04-13 23:10:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:56,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032369575] [2025-04-13 23:10:56,799 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:56,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:56,807 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:56,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:56,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:57,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:57,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032369575] [2025-04-13 23:10:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032369575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:57,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028610828] [2025-04-13 23:10:57,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:57,347 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:57,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-04-13 23:10:57,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:57,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:57,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:57,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:57,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:10:57,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:57,859 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:57,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:10:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:57,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:58,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:58,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:10:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:59,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028610828] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:59,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:10:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 34 [2025-04-13 23:10:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421614933] [2025-04-13 23:10:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:59,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:10:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:59,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:10:59,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:10:59,351 INFO L87 Difference]: Start difference. First operand 1577 states and 5539 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:00,191 INFO L93 Difference]: Finished difference Result 1679 states and 5874 transitions. [2025-04-13 23:11:00,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:11:00,191 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:00,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:00,195 INFO L225 Difference]: With dead ends: 1679 [2025-04-13 23:11:00,195 INFO L226 Difference]: Without dead ends: 1673 [2025-04-13 23:11:00,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:11:00,196 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:00,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:11:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-04-13 23:11:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1575. [2025-04-13 23:11:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 3.5158831003811946) internal successors, (5534), 1574 states have internal predecessors, (5534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 5534 transitions. [2025-04-13 23:11:00,213 INFO L79 Accepts]: Start accepts. Automaton has 1575 states and 5534 transitions. Word has length 25 [2025-04-13 23:11:00,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:00,213 INFO L485 AbstractCegarLoop]: Abstraction has 1575 states and 5534 transitions. [2025-04-13 23:11:00,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:00,214 INFO L278 IsEmpty]: Start isEmpty. Operand 1575 states and 5534 transitions. [2025-04-13 23:11:00,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:00,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:00,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:00,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-04-13 23:11:00,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:00,416 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:00,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 301383950, now seen corresponding path program 132 times [2025-04-13 23:11:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:00,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686142046] [2025-04-13 23:11:00,416 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:00,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:00,426 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:00,426 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:00,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686142046] [2025-04-13 23:11:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686142046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:00,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757468077] [2025-04-13 23:11:00,888 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:00,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:00,890 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:00,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-04-13 23:11:00,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:00,996 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:00,996 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:00,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:00,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:00,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:01,378 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:01,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:11:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:01,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:02,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:02,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:11:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:02,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757468077] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:02,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:11:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919682059] [2025-04-13 23:11:02,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:02,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:11:02,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:02,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:11:02,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:11:02,811 INFO L87 Difference]: Start difference. First operand 1575 states and 5534 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:08,946 INFO L93 Difference]: Finished difference Result 1992 states and 7100 transitions. [2025-04-13 23:11:08,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 23:11:08,946 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:08,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:08,951 INFO L225 Difference]: With dead ends: 1992 [2025-04-13 23:11:08,952 INFO L226 Difference]: Without dead ends: 1981 [2025-04-13 23:11:08,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1179, Invalid=6131, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 23:11:08,953 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:08,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 0 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:11:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-04-13 23:11:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1579. [2025-04-13 23:11:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 3.5158428390367553) internal successors, (5548), 1578 states have internal predecessors, (5548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 5548 transitions. [2025-04-13 23:11:08,982 INFO L79 Accepts]: Start accepts. Automaton has 1579 states and 5548 transitions. Word has length 25 [2025-04-13 23:11:08,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:08,982 INFO L485 AbstractCegarLoop]: Abstraction has 1579 states and 5548 transitions. [2025-04-13 23:11:08,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:08,982 INFO L278 IsEmpty]: Start isEmpty. Operand 1579 states and 5548 transitions. [2025-04-13 23:11:08,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:08,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:08,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:08,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2025-04-13 23:11:09,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:09,184 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:09,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1149322518, now seen corresponding path program 133 times [2025-04-13 23:11:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:09,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528031392] [2025-04-13 23:11:09,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:09,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:09,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:09,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528031392] [2025-04-13 23:11:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528031392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:09,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727027317] [2025-04-13 23:11:09,647 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:09,649 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:09,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-04-13 23:11:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:09,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:11:09,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:10,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:10,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 23:11:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:10,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:11:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727027317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:10,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:11:10,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:11:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100263042] [2025-04-13 23:11:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:10,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:11:10,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:10,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:11:10,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:11:10,223 INFO L87 Difference]: Start difference. First operand 1579 states and 5548 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:10,511 INFO L93 Difference]: Finished difference Result 1644 states and 5735 transitions. [2025-04-13 23:11:10,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:11:10,511 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:10,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:10,515 INFO L225 Difference]: With dead ends: 1644 [2025-04-13 23:11:10,515 INFO L226 Difference]: Without dead ends: 1638 [2025-04-13 23:11:10,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:11:10,515 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:10,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:11:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-04-13 23:11:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1581. [2025-04-13 23:11:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 3.518354430379747) internal successors, (5559), 1580 states have internal predecessors, (5559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 5559 transitions. [2025-04-13 23:11:10,534 INFO L79 Accepts]: Start accepts. Automaton has 1581 states and 5559 transitions. Word has length 25 [2025-04-13 23:11:10,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:10,534 INFO L485 AbstractCegarLoop]: Abstraction has 1581 states and 5559 transitions. [2025-04-13 23:11:10,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:10,534 INFO L278 IsEmpty]: Start isEmpty. Operand 1581 states and 5559 transitions. [2025-04-13 23:11:10,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:10,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:10,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:10,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2025-04-13 23:11:10,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2025-04-13 23:11:10,736 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:10,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 32601860, now seen corresponding path program 134 times [2025-04-13 23:11:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:10,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583374035] [2025-04-13 23:11:10,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:10,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:10,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:10,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:10,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:11,374 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 23:11:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:11,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583374035] [2025-04-13 23:11:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583374035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:11,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750928223] [2025-04-13 23:11:11,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:11,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:11,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:11,376 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-04-13 23:11:11,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:11,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:11,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:11,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:11,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:11,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:11,891 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:11,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:11:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:12,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:12,946 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:12,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 295 treesize of output 127 [2025-04-13 23:11:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750928223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:13,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 33 [2025-04-13 23:11:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930070645] [2025-04-13 23:11:13,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:13,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:13,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:13,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:13,289 INFO L87 Difference]: Start difference. First operand 1581 states and 5559 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:18,733 INFO L93 Difference]: Finished difference Result 2011 states and 7130 transitions. [2025-04-13 23:11:18,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 23:11:18,734 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:18,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:18,739 INFO L225 Difference]: With dead ends: 2011 [2025-04-13 23:11:18,739 INFO L226 Difference]: Without dead ends: 2000 [2025-04-13 23:11:18,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1054, Invalid=6256, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 23:11:18,739 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:18,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:11:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2025-04-13 23:11:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1589. [2025-04-13 23:11:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 3.519521410579345) internal successors, (5589), 1588 states have internal predecessors, (5589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 5589 transitions. [2025-04-13 23:11:18,758 INFO L79 Accepts]: Start accepts. Automaton has 1589 states and 5589 transitions. Word has length 25 [2025-04-13 23:11:18,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:18,758 INFO L485 AbstractCegarLoop]: Abstraction has 1589 states and 5589 transitions. [2025-04-13 23:11:18,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,759 INFO L278 IsEmpty]: Start isEmpty. Operand 1589 states and 5589 transitions. [2025-04-13 23:11:18,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:18,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:18,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:18,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2025-04-13 23:11:18,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable167 [2025-04-13 23:11:18,961 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:18,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1416597444, now seen corresponding path program 135 times [2025-04-13 23:11:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:18,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380295695] [2025-04-13 23:11:18,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:18,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:18,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:11:18,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:11:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:19,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380295695] [2025-04-13 23:11:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380295695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:19,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:11:19,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:11:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101035811] [2025-04-13 23:11:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:19,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:11:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:19,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:11:19,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:11:19,321 INFO L87 Difference]: Start difference. First operand 1589 states and 5589 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:19,695 INFO L93 Difference]: Finished difference Result 1655 states and 5813 transitions. [2025-04-13 23:11:19,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:11:19,695 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:19,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:19,699 INFO L225 Difference]: With dead ends: 1655 [2025-04-13 23:11:19,699 INFO L226 Difference]: Without dead ends: 1649 [2025-04-13 23:11:19,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:11:19,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:19,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:11:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-04-13 23:11:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1589. [2025-04-13 23:11:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 3.519521410579345) internal successors, (5589), 1588 states have internal predecessors, (5589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 5589 transitions. [2025-04-13 23:11:19,717 INFO L79 Accepts]: Start accepts. Automaton has 1589 states and 5589 transitions. Word has length 25 [2025-04-13 23:11:19,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:19,718 INFO L485 AbstractCegarLoop]: Abstraction has 1589 states and 5589 transitions. [2025-04-13 23:11:19,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:19,718 INFO L278 IsEmpty]: Start isEmpty. Operand 1589 states and 5589 transitions. [2025-04-13 23:11:19,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:19,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:19,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:19,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 23:11:19,720 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:19,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2065239442, now seen corresponding path program 136 times [2025-04-13 23:11:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:19,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141983943] [2025-04-13 23:11:19,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:19,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:19,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:19,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:19,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:20,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141983943] [2025-04-13 23:11:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141983943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:20,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087036407] [2025-04-13 23:11:20,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:20,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:20,153 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-04-13 23:11:20,245 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:20,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:20,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:20,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:20,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:11:20,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:20,715 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:20,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:11:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:20,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:21,459 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:21,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:11:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087036407] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:22,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:11:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205012296] [2025-04-13 23:11:22,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:22,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:11:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:22,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:11:22,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:11:22,342 INFO L87 Difference]: Start difference. First operand 1589 states and 5589 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:25,710 INFO L93 Difference]: Finished difference Result 1853 states and 6480 transitions. [2025-04-13 23:11:25,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 23:11:25,710 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:25,710 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:25,714 INFO L225 Difference]: With dead ends: 1853 [2025-04-13 23:11:25,715 INFO L226 Difference]: Without dead ends: 1842 [2025-04-13 23:11:25,715 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=465, Invalid=3957, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 23:11:25,715 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3387 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:25,715 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3387 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:11:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-04-13 23:11:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1589. [2025-04-13 23:11:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 3.519521410579345) internal successors, (5589), 1588 states have internal predecessors, (5589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 5589 transitions. [2025-04-13 23:11:25,734 INFO L79 Accepts]: Start accepts. Automaton has 1589 states and 5589 transitions. Word has length 25 [2025-04-13 23:11:25,734 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:25,734 INFO L485 AbstractCegarLoop]: Abstraction has 1589 states and 5589 transitions. [2025-04-13 23:11:25,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:25,734 INFO L278 IsEmpty]: Start isEmpty. Operand 1589 states and 5589 transitions. [2025-04-13 23:11:25,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:25,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:25,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:25,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2025-04-13 23:11:25,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 23:11:25,937 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:25,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash 115270212, now seen corresponding path program 137 times [2025-04-13 23:11:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:25,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231798987] [2025-04-13 23:11:25,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:25,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:25,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:25,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:25,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:26,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231798987] [2025-04-13 23:11:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231798987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:26,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337541453] [2025-04-13 23:11:26,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:26,462 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:26,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-04-13 23:11:26,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:26,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:26,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:26,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:26,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:11:26,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:27,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:27,039 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:27,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 85 [2025-04-13 23:11:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:27,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:27,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:27,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:11:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337541453] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:11:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 33 [2025-04-13 23:11:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621630430] [2025-04-13 23:11:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:28,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:11:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:11:28,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:28,725 INFO L87 Difference]: Start difference. First operand 1589 states and 5589 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:29,566 INFO L93 Difference]: Finished difference Result 1740 states and 6086 transitions. [2025-04-13 23:11:29,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:11:29,566 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:29,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:29,571 INFO L225 Difference]: With dead ends: 1740 [2025-04-13 23:11:29,571 INFO L226 Difference]: Without dead ends: 1734 [2025-04-13 23:11:29,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=1812, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:11:29,571 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:29,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:11:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-04-13 23:11:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1585. [2025-04-13 23:11:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 3.5157828282828283) internal successors, (5569), 1584 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 5569 transitions. [2025-04-13 23:11:29,591 INFO L79 Accepts]: Start accepts. Automaton has 1585 states and 5569 transitions. Word has length 25 [2025-04-13 23:11:29,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:29,591 INFO L485 AbstractCegarLoop]: Abstraction has 1585 states and 5569 transitions. [2025-04-13 23:11:29,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:29,591 INFO L278 IsEmpty]: Start isEmpty. Operand 1585 states and 5569 transitions. [2025-04-13 23:11:29,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:29,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:29,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:29,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2025-04-13 23:11:29,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:29,793 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:29,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash 163984530, now seen corresponding path program 138 times [2025-04-13 23:11:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:29,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176718176] [2025-04-13 23:11:29,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:29,797 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:29,802 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:29,802 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:29,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:30,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176718176] [2025-04-13 23:11:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176718176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:30,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827618114] [2025-04-13 23:11:30,331 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:30,333 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-04-13 23:11:30,428 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:30,441 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:30,441 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:30,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:30,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:11:30,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:30,981 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:30,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:11:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:31,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:32,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:32,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 230 treesize of output 110 [2025-04-13 23:11:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827618114] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:32,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:32,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:11:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713463512] [2025-04-13 23:11:32,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:32,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:32,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:32,313 INFO L87 Difference]: Start difference. First operand 1585 states and 5569 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:38,220 INFO L93 Difference]: Finished difference Result 1968 states and 6973 transitions. [2025-04-13 23:11:38,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 23:11:38,221 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:38,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:38,225 INFO L225 Difference]: With dead ends: 1968 [2025-04-13 23:11:38,225 INFO L226 Difference]: Without dead ends: 1957 [2025-04-13 23:11:38,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1164, Invalid=6492, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:11:38,226 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:38,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:11:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2025-04-13 23:11:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1595. [2025-04-13 23:11:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 3.523212045169385) internal successors, (5616), 1594 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 5616 transitions. [2025-04-13 23:11:38,247 INFO L79 Accepts]: Start accepts. Automaton has 1595 states and 5616 transitions. Word has length 25 [2025-04-13 23:11:38,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:38,247 INFO L485 AbstractCegarLoop]: Abstraction has 1595 states and 5616 transitions. [2025-04-13 23:11:38,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:38,247 INFO L278 IsEmpty]: Start isEmpty. Operand 1595 states and 5616 transitions. [2025-04-13 23:11:38,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:38,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:38,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:38,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2025-04-13 23:11:38,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:38,450 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:38,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1897521900, now seen corresponding path program 139 times [2025-04-13 23:11:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:38,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103765171] [2025-04-13 23:11:38,450 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:38,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:38,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:38,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:38,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:38,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103765171] [2025-04-13 23:11:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103765171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:38,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48040457] [2025-04-13 23:11:38,994 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:38,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:38,997 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-13 23:11:39,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:39,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:39,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:39,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:11:39,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:39,515 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:39,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:11:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:39,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:11:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48040457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:11:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:11:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018931838] [2025-04-13 23:11:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:39,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:11:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:39,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:11:39,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:11:39,577 INFO L87 Difference]: Start difference. First operand 1595 states and 5616 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:39,844 INFO L93 Difference]: Finished difference Result 1663 states and 5800 transitions. [2025-04-13 23:11:39,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:11:39,844 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:39,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:39,849 INFO L225 Difference]: With dead ends: 1663 [2025-04-13 23:11:39,849 INFO L226 Difference]: Without dead ends: 1657 [2025-04-13 23:11:39,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:11:39,849 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:39,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:11:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-04-13 23:11:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1595. [2025-04-13 23:11:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 3.523212045169385) internal successors, (5616), 1594 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 5616 transitions. [2025-04-13 23:11:39,870 INFO L79 Accepts]: Start accepts. Automaton has 1595 states and 5616 transitions. Word has length 25 [2025-04-13 23:11:39,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:39,870 INFO L485 AbstractCegarLoop]: Abstraction has 1595 states and 5616 transitions. [2025-04-13 23:11:39,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:39,870 INFO L278 IsEmpty]: Start isEmpty. Operand 1595 states and 5616 transitions. [2025-04-13 23:11:39,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:39,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:39,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:39,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2025-04-13 23:11:40,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2025-04-13 23:11:40,073 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:40,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1552575238, now seen corresponding path program 140 times [2025-04-13 23:11:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:40,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367075109] [2025-04-13 23:11:40,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:40,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:40,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:40,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:40,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367075109] [2025-04-13 23:11:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367075109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:40,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461536984] [2025-04-13 23:11:40,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:40,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:40,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:40,570 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-04-13 23:11:40,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:40,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:40,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:40,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:11:40,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:41,168 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:41,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 93 [2025-04-13 23:11:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:41,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:42,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:42,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 230 treesize of output 110 [2025-04-13 23:11:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461536984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:42,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:11:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609793330] [2025-04-13 23:11:42,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:42,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:42,526 INFO L87 Difference]: Start difference. First operand 1595 states and 5616 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:48,004 INFO L93 Difference]: Finished difference Result 1940 states and 6835 transitions. [2025-04-13 23:11:48,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 23:11:48,004 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:48,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:48,010 INFO L225 Difference]: With dead ends: 1940 [2025-04-13 23:11:48,010 INFO L226 Difference]: Without dead ends: 1929 [2025-04-13 23:11:48,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1022, Invalid=6118, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:11:48,011 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:48,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:11:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-04-13 23:11:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1595. [2025-04-13 23:11:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 3.5244667503136764) internal successors, (5618), 1594 states have internal predecessors, (5618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 5618 transitions. [2025-04-13 23:11:48,040 INFO L79 Accepts]: Start accepts. Automaton has 1595 states and 5618 transitions. Word has length 25 [2025-04-13 23:11:48,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:48,040 INFO L485 AbstractCegarLoop]: Abstraction has 1595 states and 5618 transitions. [2025-04-13 23:11:48,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,040 INFO L278 IsEmpty]: Start isEmpty. Operand 1595 states and 5618 transitions. [2025-04-13 23:11:48,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:48,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:48,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:48,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 23:11:48,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:48,247 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:48,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1799792152, now seen corresponding path program 141 times [2025-04-13 23:11:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:48,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324855639] [2025-04-13 23:11:48,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:48,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:48,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:48,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:11:48,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:11:48,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:48,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324855639] [2025-04-13 23:11:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324855639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:11:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:11:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944421368] [2025-04-13 23:11:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:48,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:11:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:48,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:11:48,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:11:48,608 INFO L87 Difference]: Start difference. First operand 1595 states and 5618 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:48,885 INFO L93 Difference]: Finished difference Result 1661 states and 5840 transitions. [2025-04-13 23:11:48,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:11:48,886 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:48,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:48,890 INFO L225 Difference]: With dead ends: 1661 [2025-04-13 23:11:48,890 INFO L226 Difference]: Without dead ends: 1655 [2025-04-13 23:11:48,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:11:48,890 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:48,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:11:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-04-13 23:11:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1595. [2025-04-13 23:11:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 3.5244667503136764) internal successors, (5618), 1594 states have internal predecessors, (5618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 5618 transitions. [2025-04-13 23:11:48,909 INFO L79 Accepts]: Start accepts. Automaton has 1595 states and 5618 transitions. Word has length 25 [2025-04-13 23:11:48,909 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:48,909 INFO L485 AbstractCegarLoop]: Abstraction has 1595 states and 5618 transitions. [2025-04-13 23:11:48,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,909 INFO L278 IsEmpty]: Start isEmpty. Operand 1595 states and 5618 transitions. [2025-04-13 23:11:48,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:48,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:48,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:48,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-13 23:11:48,911 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:48,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1821357328, now seen corresponding path program 142 times [2025-04-13 23:11:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:48,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061359752] [2025-04-13 23:11:48,911 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:48,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:48,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:48,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:48,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:49,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061359752] [2025-04-13 23:11:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061359752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:49,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38883099] [2025-04-13 23:11:49,409 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:49,410 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:49,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-04-13 23:11:49,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:49,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:49,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:11:49,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:49,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:49,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:11:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:49,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:50,743 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:50,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:11:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38883099] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:51,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-04-13 23:11:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447355797] [2025-04-13 23:11:51,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:51,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:11:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:51,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:11:51,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:11:51,738 INFO L87 Difference]: Start difference. First operand 1595 states and 5618 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:54,884 INFO L93 Difference]: Finished difference Result 1846 states and 6491 transitions. [2025-04-13 23:11:54,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:11:54,885 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:54,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:54,889 INFO L225 Difference]: With dead ends: 1846 [2025-04-13 23:11:54,889 INFO L226 Difference]: Without dead ends: 1835 [2025-04-13 23:11:54,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=444, Invalid=3462, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 23:11:54,890 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:54,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:11:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-04-13 23:11:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1601. [2025-04-13 23:11:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 3.524375) internal successors, (5639), 1600 states have internal predecessors, (5639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 5639 transitions. [2025-04-13 23:11:54,911 INFO L79 Accepts]: Start accepts. Automaton has 1601 states and 5639 transitions. Word has length 25 [2025-04-13 23:11:54,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:54,911 INFO L485 AbstractCegarLoop]: Abstraction has 1601 states and 5639 transitions. [2025-04-13 23:11:54,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:54,911 INFO L278 IsEmpty]: Start isEmpty. Operand 1601 states and 5639 transitions. [2025-04-13 23:11:54,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:54,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:54,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:54,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2025-04-13 23:11:55,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:55,113 INFO L403 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:55,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1836660204, now seen corresponding path program 143 times [2025-04-13 23:11:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:55,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021257415] [2025-04-13 23:11:55,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:55,118 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:55,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:55,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:55,602 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 23:11:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:55,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021257415] [2025-04-13 23:11:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021257415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:55,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135978847] [2025-04-13 23:11:55,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:55,604 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:55,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-04-13 23:11:55,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:55,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:55,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:55,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:11:55,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:56,136 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:56,136 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 23:11:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:56,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:56,716 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:56,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:11:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135978847] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:57,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2025-04-13 23:11:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11031526] [2025-04-13 23:11:57,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:57,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:57,643 INFO L87 Difference]: Start difference. First operand 1601 states and 5639 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:00,172 INFO L93 Difference]: Finished difference Result 1808 states and 6311 transitions. [2025-04-13 23:12:00,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:12:00,173 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:00,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:00,177 INFO L225 Difference]: With dead ends: 1808 [2025-04-13 23:12:00,177 INFO L226 Difference]: Without dead ends: 1797 [2025-04-13 23:12:00,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=585, Invalid=4245, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 23:12:00,178 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:00,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:12:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-04-13 23:12:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1595. [2025-04-13 23:12:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1594 states have (on average 3.5257214554579672) internal successors, (5620), 1594 states have internal predecessors, (5620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 5620 transitions. [2025-04-13 23:12:00,200 INFO L79 Accepts]: Start accepts. Automaton has 1595 states and 5620 transitions. Word has length 25 [2025-04-13 23:12:00,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:00,200 INFO L485 AbstractCegarLoop]: Abstraction has 1595 states and 5620 transitions. [2025-04-13 23:12:00,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:00,200 INFO L278 IsEmpty]: Start isEmpty. Operand 1595 states and 5620 transitions. [2025-04-13 23:12:00,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:00,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:00,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:00,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2025-04-13 23:12:00,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:00,403 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:00,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:00,404 INFO L85 PathProgramCache]: Analyzing trace with hash -653653720, now seen corresponding path program 144 times [2025-04-13 23:12:00,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:00,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471923031] [2025-04-13 23:12:00,404 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:00,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:00,408 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:00,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:00,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:00,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471923031] [2025-04-13 23:12:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471923031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:00,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778841876] [2025-04-13 23:12:00,953 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:00,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:00,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:00,955 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:00,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-04-13 23:12:01,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:01,063 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:01,063 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:01,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:12:01,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:01,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:12:01,492 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:01,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 95 [2025-04-13 23:12:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:01,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:02,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:02,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 230 treesize of output 110 [2025-04-13 23:12:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778841876] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:02,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:12:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011026239] [2025-04-13 23:12:02,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:02,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:12:02,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:02,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:12:02,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:12:02,954 INFO L87 Difference]: Start difference. First operand 1595 states and 5620 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:08,321 INFO L93 Difference]: Finished difference Result 1931 states and 6830 transitions. [2025-04-13 23:12:08,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 23:12:08,322 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:08,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:08,326 INFO L225 Difference]: With dead ends: 1931 [2025-04-13 23:12:08,326 INFO L226 Difference]: Without dead ends: 1920 [2025-04-13 23:12:08,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1014, Invalid=5958, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:12:08,327 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:08,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-04-13 23:12:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1601. [2025-04-13 23:12:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 3.523125) internal successors, (5637), 1600 states have internal predecessors, (5637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 5637 transitions. [2025-04-13 23:12:08,347 INFO L79 Accepts]: Start accepts. Automaton has 1601 states and 5637 transitions. Word has length 25 [2025-04-13 23:12:08,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:08,347 INFO L485 AbstractCegarLoop]: Abstraction has 1601 states and 5637 transitions. [2025-04-13 23:12:08,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:08,347 INFO L278 IsEmpty]: Start isEmpty. Operand 1601 states and 5637 transitions. [2025-04-13 23:12:08,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:08,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:08,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2025-04-13 23:12:08,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2025-04-13 23:12:08,549 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:08,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1091094454, now seen corresponding path program 145 times [2025-04-13 23:12:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:08,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387427540] [2025-04-13 23:12:08,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:08,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:08,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:08,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:09,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387427540] [2025-04-13 23:12:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387427540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:09,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537981270] [2025-04-13 23:12:09,115 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:09,116 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:09,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-04-13 23:12:09,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:09,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:09,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:09,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:09,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:12:09,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:09,693 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:09,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 23:12:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:09,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:12:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537981270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:12:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:12:09,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2025-04-13 23:12:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93577372] [2025-04-13 23:12:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:12:09,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:12:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:09,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:12:09,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:12:09,754 INFO L87 Difference]: Start difference. First operand 1601 states and 5637 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:10,034 INFO L93 Difference]: Finished difference Result 1675 states and 5848 transitions. [2025-04-13 23:12:10,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:12:10,034 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:10,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:10,038 INFO L225 Difference]: With dead ends: 1675 [2025-04-13 23:12:10,038 INFO L226 Difference]: Without dead ends: 1669 [2025-04-13 23:12:10,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:12:10,039 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:10,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:12:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-04-13 23:12:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1603. [2025-04-13 23:12:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 3.5255930087390763) internal successors, (5648), 1602 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 5648 transitions. [2025-04-13 23:12:10,057 INFO L79 Accepts]: Start accepts. Automaton has 1603 states and 5648 transitions. Word has length 25 [2025-04-13 23:12:10,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:10,057 INFO L485 AbstractCegarLoop]: Abstraction has 1603 states and 5648 transitions. [2025-04-13 23:12:10,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,057 INFO L278 IsEmpty]: Start isEmpty. Operand 1603 states and 5648 transitions. [2025-04-13 23:12:10,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:10,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:10,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:10,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2025-04-13 23:12:10,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable178 [2025-04-13 23:12:10,259 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:10,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash -635219694, now seen corresponding path program 146 times [2025-04-13 23:12:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:10,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858557616] [2025-04-13 23:12:10,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:10,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:10,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:10,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:10,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858557616] [2025-04-13 23:12:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858557616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:10,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302523692] [2025-04-13 23:12:10,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:10,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:10,775 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:10,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2025-04-13 23:12:10,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:10,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:10,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:12:10,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:11,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:12:11,310 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:11,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 95 [2025-04-13 23:12:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:11,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:12,415 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:12,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 279 treesize of output 127 [2025-04-13 23:12:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302523692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:12,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:12:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504455552] [2025-04-13 23:12:12,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:12,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:12:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:12:12,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:12:12,724 INFO L87 Difference]: Start difference. First operand 1603 states and 5648 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:18,625 INFO L93 Difference]: Finished difference Result 1910 states and 6783 transitions. [2025-04-13 23:12:18,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 23:12:18,625 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:18,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:18,630 INFO L225 Difference]: With dead ends: 1910 [2025-04-13 23:12:18,630 INFO L226 Difference]: Without dead ends: 1899 [2025-04-13 23:12:18,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1054, Invalid=5918, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:12:18,630 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:18,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-04-13 23:12:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1615. [2025-04-13 23:12:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 3.524163568773234) internal successors, (5688), 1614 states have internal predecessors, (5688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5688 transitions. [2025-04-13 23:12:18,648 INFO L79 Accepts]: Start accepts. Automaton has 1615 states and 5688 transitions. Word has length 25 [2025-04-13 23:12:18,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:18,649 INFO L485 AbstractCegarLoop]: Abstraction has 1615 states and 5688 transitions. [2025-04-13 23:12:18,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:18,649 INFO L278 IsEmpty]: Start isEmpty. Operand 1615 states and 5688 transitions. [2025-04-13 23:12:18,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:18,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:18,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:18,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2025-04-13 23:12:18,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2025-04-13 23:12:18,851 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:18,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1264342146, now seen corresponding path program 147 times [2025-04-13 23:12:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:18,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897198162] [2025-04-13 23:12:18,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:18,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:18,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:12:18,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:12:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:19,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897198162] [2025-04-13 23:12:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897198162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:12:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:12:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:12:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629190366] [2025-04-13 23:12:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:12:19,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:12:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:12:19,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:12:19,366 INFO L87 Difference]: Start difference. First operand 1615 states and 5688 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:19,703 INFO L93 Difference]: Finished difference Result 1705 states and 5985 transitions. [2025-04-13 23:12:19,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:12:19,704 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:19,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:19,707 INFO L225 Difference]: With dead ends: 1705 [2025-04-13 23:12:19,707 INFO L226 Difference]: Without dead ends: 1699 [2025-04-13 23:12:19,708 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:12:19,708 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:19,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:12:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-04-13 23:12:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1615. [2025-04-13 23:12:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 3.524163568773234) internal successors, (5688), 1614 states have internal predecessors, (5688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5688 transitions. [2025-04-13 23:12:19,726 INFO L79 Accepts]: Start accepts. Automaton has 1615 states and 5688 transitions. Word has length 25 [2025-04-13 23:12:19,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:19,727 INFO L485 AbstractCegarLoop]: Abstraction has 1615 states and 5688 transitions. [2025-04-13 23:12:19,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:19,727 INFO L278 IsEmpty]: Start isEmpty. Operand 1615 states and 5688 transitions. [2025-04-13 23:12:19,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:19,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:19,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:19,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-04-13 23:12:19,729 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:19,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 957108082, now seen corresponding path program 148 times [2025-04-13 23:12:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:19,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841809127] [2025-04-13 23:12:19,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:19,733 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:19,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:19,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:19,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:20,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841809127] [2025-04-13 23:12:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841809127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:20,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342674218] [2025-04-13 23:12:20,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:20,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:20,283 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:20,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2025-04-13 23:12:20,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:20,403 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:20,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:20,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:20,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:12:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:20,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:12:20,783 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:20,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 85 [2025-04-13 23:12:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:20,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:21,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:21,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:12:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342674218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:22,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2025-04-13 23:12:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043772272] [2025-04-13 23:12:22,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:22,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 23:12:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 23:12:22,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:12:22,559 INFO L87 Difference]: Start difference. First operand 1615 states and 5688 transitions. Second operand has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:27,132 INFO L93 Difference]: Finished difference Result 1898 states and 6781 transitions. [2025-04-13 23:12:27,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:12:27,133 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:27,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:27,137 INFO L225 Difference]: With dead ends: 1898 [2025-04-13 23:12:27,137 INFO L226 Difference]: Without dead ends: 1892 [2025-04-13 23:12:27,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=550, Invalid=4280, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 23:12:27,138 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:27,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:12:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-04-13 23:12:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2025-04-13 23:12:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1622 states have (on average 3.524044389642417) internal successors, (5716), 1622 states have internal predecessors, (5716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 5716 transitions. [2025-04-13 23:12:27,158 INFO L79 Accepts]: Start accepts. Automaton has 1623 states and 5716 transitions. Word has length 25 [2025-04-13 23:12:27,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:27,158 INFO L485 AbstractCegarLoop]: Abstraction has 1623 states and 5716 transitions. [2025-04-13 23:12:27,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:27,158 INFO L278 IsEmpty]: Start isEmpty. Operand 1623 states and 5716 transitions. [2025-04-13 23:12:27,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:27,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:27,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:27,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2025-04-13 23:12:27,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:27,361 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:27,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1314065382, now seen corresponding path program 149 times [2025-04-13 23:12:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:27,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998291906] [2025-04-13 23:12:27,361 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:27,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:27,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:27,368 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:27,369 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:27,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:27,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998291906] [2025-04-13 23:12:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998291906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:27,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695215723] [2025-04-13 23:12:27,936 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:27,938 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:27,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-04-13 23:12:28,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:28,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:28,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:28,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:12:28,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:28,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:28,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 23:12:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:28,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:29,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:29,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:12:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695215723] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:12:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 33 [2025-04-13 23:12:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696979085] [2025-04-13 23:12:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:12:29,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:12:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:29,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:12:29,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:12:29,998 INFO L87 Difference]: Start difference. First operand 1623 states and 5716 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:30,845 INFO L93 Difference]: Finished difference Result 1709 states and 5977 transitions. [2025-04-13 23:12:30,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:12:30,846 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:30,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:30,849 INFO L225 Difference]: With dead ends: 1709 [2025-04-13 23:12:30,849 INFO L226 Difference]: Without dead ends: 1703 [2025-04-13 23:12:30,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:12:30,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:30,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:12:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-04-13 23:12:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1625. [2025-04-13 23:12:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 3.5264778325123154) internal successors, (5727), 1624 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 5727 transitions. [2025-04-13 23:12:30,868 INFO L79 Accepts]: Start accepts. Automaton has 1625 states and 5727 transitions. Word has length 25 [2025-04-13 23:12:30,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:30,868 INFO L485 AbstractCegarLoop]: Abstraction has 1625 states and 5727 transitions. [2025-04-13 23:12:30,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:30,868 INFO L278 IsEmpty]: Start isEmpty. Operand 1625 states and 5727 transitions. [2025-04-13 23:12:30,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:30,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:30,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:30,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-04-13 23:12:31,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:31,070 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:31,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 697662030, now seen corresponding path program 150 times [2025-04-13 23:12:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:31,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401869654] [2025-04-13 23:12:31,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:31,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:31,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:31,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:31,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401869654] [2025-04-13 23:12:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401869654] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:31,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267774105] [2025-04-13 23:12:31,573 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:31,575 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:31,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-04-13 23:12:31,689 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:31,702 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:31,702 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:31,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:31,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:12:31,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:32,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:32,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 93 [2025-04-13 23:12:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:32,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:33,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:33,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:12:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267774105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:33,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:12:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892349330] [2025-04-13 23:12:33,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:33,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:12:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:33,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:12:33,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:12:33,625 INFO L87 Difference]: Start difference. First operand 1625 states and 5727 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:38,321 INFO L93 Difference]: Finished difference Result 1978 states and 7066 transitions. [2025-04-13 23:12:38,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:12:38,321 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:38,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:38,326 INFO L225 Difference]: With dead ends: 1978 [2025-04-13 23:12:38,326 INFO L226 Difference]: Without dead ends: 1967 [2025-04-13 23:12:38,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=796, Invalid=4606, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:12:38,326 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:38,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:12:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-04-13 23:12:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1633. [2025-04-13 23:12:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 3.53125) internal successors, (5763), 1632 states have internal predecessors, (5763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 5763 transitions. [2025-04-13 23:12:38,347 INFO L79 Accepts]: Start accepts. Automaton has 1633 states and 5763 transitions. Word has length 25 [2025-04-13 23:12:38,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:38,347 INFO L485 AbstractCegarLoop]: Abstraction has 1633 states and 5763 transitions. [2025-04-13 23:12:38,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:38,348 INFO L278 IsEmpty]: Start isEmpty. Operand 1633 states and 5763 transitions. [2025-04-13 23:12:38,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:38,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:38,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:38,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2025-04-13 23:12:38,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable183 [2025-04-13 23:12:38,550 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:38,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash -378113900, now seen corresponding path program 151 times [2025-04-13 23:12:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:38,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579228015] [2025-04-13 23:12:38,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:38,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:38,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:38,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:38,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:39,060 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 23:12:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:39,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579228015] [2025-04-13 23:12:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579228015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:39,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156700171] [2025-04-13 23:12:39,060 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:39,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:39,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:39,062 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:39,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-04-13 23:12:39,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:39,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:39,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:39,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:39,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:12:39,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:39,558 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:12:39,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 175 treesize of output 85 [2025-04-13 23:12:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:39,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:40,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:40,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:12:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156700171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:41,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:12:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240858594] [2025-04-13 23:12:41,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:41,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:12:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:41,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:12:41,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:12:41,284 INFO L87 Difference]: Start difference. First operand 1633 states and 5763 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:43,747 INFO L93 Difference]: Finished difference Result 1836 states and 6387 transitions. [2025-04-13 23:12:43,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:12:43,748 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:43,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:43,752 INFO L225 Difference]: With dead ends: 1836 [2025-04-13 23:12:43,752 INFO L226 Difference]: Without dead ends: 1830 [2025-04-13 23:12:43,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=648, Invalid=4182, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 23:12:43,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:43,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:12:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-04-13 23:12:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1627. [2025-04-13 23:12:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 3.5252152521525217) internal successors, (5732), 1626 states have internal predecessors, (5732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 5732 transitions. [2025-04-13 23:12:43,773 INFO L79 Accepts]: Start accepts. Automaton has 1627 states and 5732 transitions. Word has length 25 [2025-04-13 23:12:43,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:43,773 INFO L485 AbstractCegarLoop]: Abstraction has 1627 states and 5732 transitions. [2025-04-13 23:12:43,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,774 INFO L278 IsEmpty]: Start isEmpty. Operand 1627 states and 5732 transitions. [2025-04-13 23:12:43,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:43,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:43,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:43,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2025-04-13 23:12:43,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:43,976 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:43,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 428879940, now seen corresponding path program 152 times [2025-04-13 23:12:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:43,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515332010] [2025-04-13 23:12:43,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:43,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:43,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:43,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:44,559 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 23:12:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:44,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515332010] [2025-04-13 23:12:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515332010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:44,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965360394] [2025-04-13 23:12:44,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:44,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:44,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:44,561 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:44,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-04-13 23:12:44,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:44,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:44,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:44,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:44,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:12:44,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:45,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:45,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 23:12:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:45,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:46,314 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:46,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 271 treesize of output 119 [2025-04-13 23:12:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965360394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:46,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 23:12:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476888643] [2025-04-13 23:12:46,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:46,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:12:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:46,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:12:46,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:12:46,628 INFO L87 Difference]: Start difference. First operand 1627 states and 5732 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:51,478 INFO L93 Difference]: Finished difference Result 1986 states and 7068 transitions. [2025-04-13 23:12:51,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:12:51,478 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:51,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:51,483 INFO L225 Difference]: With dead ends: 1986 [2025-04-13 23:12:51,483 INFO L226 Difference]: Without dead ends: 1975 [2025-04-13 23:12:51,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=844, Invalid=5318, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:12:51,483 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:51,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-04-13 23:12:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1625. [2025-04-13 23:12:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1624 states have (on average 3.522783251231527) internal successors, (5721), 1624 states have internal predecessors, (5721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 5721 transitions. [2025-04-13 23:12:51,504 INFO L79 Accepts]: Start accepts. Automaton has 1625 states and 5721 transitions. Word has length 25 [2025-04-13 23:12:51,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:51,504 INFO L485 AbstractCegarLoop]: Abstraction has 1625 states and 5721 transitions. [2025-04-13 23:12:51,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:51,504 INFO L278 IsEmpty]: Start isEmpty. Operand 1625 states and 5721 transitions. [2025-04-13 23:12:51,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:51,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:51,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:51,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-04-13 23:12:51,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:51,706 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:51,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1747674308, now seen corresponding path program 153 times [2025-04-13 23:12:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:51,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204899854] [2025-04-13 23:12:51,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:51,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:51,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:51,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:51,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:52,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204899854] [2025-04-13 23:12:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204899854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:52,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714193586] [2025-04-13 23:12:52,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:52,079 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:52,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-04-13 23:12:52,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:52,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:52,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:52,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:52,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:12:52,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2025-04-13 23:12:52,326 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 23:12:52,331 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:12:52,331 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:12:52,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2025-04-13 23:12:52,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:52,532 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-1 context. [2025-04-13 23:12:52,533 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:12:52,533 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:12:52,533 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:12:52,535 INFO L422 BasicCegarLoop]: Path program histogram: [153, 22, 7, 1, 1, 1, 1, 1] [2025-04-13 23:12:52,537 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:12:52,537 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:12:52,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:12:52 BasicIcfg [2025-04-13 23:12:52,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:12:52,539 INFO L158 Benchmark]: Toolchain (without parser) took 837207.86ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 101.6MB in the beginning and 376.2MB in the end (delta: -274.6MB). Peak memory consumption was 268.3MB. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.98ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 86.4MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.00ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: Boogie Preprocessor took 52.09ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: IcfgBuilder took 514.37ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 37.0MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 23:12:52,539 INFO L158 Benchmark]: TraceAbstraction took 836350.39ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 36.2MB in the beginning and 376.2MB in the end (delta: -340.0MB). Peak memory consumption was 205.4MB. Max. memory is 8.0GB. [2025-04-13 23:12:52,540 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.17ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.98ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 86.4MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.00ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.09ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 514.37ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 37.0MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 836350.39ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 36.2MB in the beginning and 376.2MB in the end (delta: -340.0MB). Peak memory consumption was 205.4MB. 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: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 836.3s, OverallIterations: 187, TraceHistogramMax: 2, PathProgramHistogramMax: 153, EmptinessCheckTime: 0.3s, AutomataDifference: 488.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34219 SdHoareTripleChecker+Valid, 167.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34219 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 147.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9511 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330929 IncrementalHoareTripleChecker+Invalid, 340440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9511 mSolverCounterUnsat, 0 mSDtfsCounter, 330929 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14243 GetRequests, 3957 SyntacticMatches, 19 SemanticMatches, 10267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215224 ImplicationChecksByTransitivity, 400.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1633occurred in iteration=184, InterpolantAutomatonStates: 7807, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 186 MinimizatonAttempts, 43513 StatesRemovedByMinimization, 182 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 302.5s InterpolantComputationTime, 7917 NumberOfCodeBlocks, 7844 NumberOfCodeBlocksAsserted, 539 NumberOfCheckSat, 10632 ConstructedInterpolants, 1 QuantifiedInterpolants, 425650 SizeOfPredicates, 2036 NumberOfNonLiveVariables, 25885 ConjunctsInSsa, 3453 ConjunctsInUnsatCore, 454 InterpolantComputations, 70 PerfectInterpolantSequences, 954/1696 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