/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-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:52:38,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:52:38,927 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:52:38,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:52:38,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:52:38,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:52:38,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:52:38,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:52:38,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:52:38,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:52:38,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:52:38,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:52:38,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:52:38,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:52:38,955 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:52:38,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:52:38,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:52:38,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:52:38,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:52:38,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:52:38,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:52:38,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:52:38,959 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:52:39,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:52:39,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:52:39,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:52:39,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:52:39,194 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:52:39,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2025-04-13 22:52:40,492 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5750db5a7/8c42d24655f148289d51e6ce63f42d7d/FLAG4ac17f81a [2025-04-13 22:52:40,689 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:52:40,689 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2025-04-13 22:52:40,695 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5750db5a7/8c42d24655f148289d51e6ce63f42d7d/FLAG4ac17f81a [2025-04-13 22:52:41,542 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5750db5a7/8c42d24655f148289d51e6ce63f42d7d [2025-04-13 22:52:41,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:52:41,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:52:41,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:52:41,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:52:41,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:52:41,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf58dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41, skipping insertion in model container [2025-04-13 22:52:41,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:52:41,695 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-min-max-inc.wvr.c[2682,2695] [2025-04-13 22:52:41,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:52:41,714 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:52:41,740 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-min-max-inc.wvr.c[2682,2695] [2025-04-13 22:52:41,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:52:41,752 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:52:41,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41 WrapperNode [2025-04-13 22:52:41,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:52:41,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:52:41,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:52:41,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:52:41,757 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:52:41" (1/1) ... [2025-04-13 22:52:41,764 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:52:41" (1/1) ... [2025-04-13 22:52:41,783 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-04-13 22:52:41,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:52:41,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:52:41,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:52:41,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:52:41,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,804 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:52:41,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:52:41,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:52:41,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:52:41,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:52:41,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (1/1) ... [2025-04-13 22:52:41,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:52:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:52:41,848 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:52:41,850 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:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:52:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:52:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:52:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:52:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:52:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:52:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:52:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:52:41,872 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:52:41,961 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:52:41,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:52:42,216 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:52:42,217 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:52:42,217 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:52:42,378 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:52:42,381 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:52:42,382 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:52:42,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:52:42,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:52:42 BoogieIcfgContainer [2025-04-13 22:52:42,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:52:42,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:52:42,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:52:42,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:52:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:52:41" (1/3) ... [2025-04-13 22:52:42,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce64754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:52:42, skipping insertion in model container [2025-04-13 22:52:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:52:41" (2/3) ... [2025-04-13 22:52:42,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce64754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:52:42, skipping insertion in model container [2025-04-13 22:52:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:52:42" (3/3) ... [2025-04-13 22:52:42,396 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2025-04-13 22:52:42,405 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:52:42,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-inc.wvr.c that has 5 procedures, 51 locations, 55 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:52:42,407 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:52:42,464 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:52:42,490 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 59 transitions, 146 flow [2025-04-13 22:52:42,816 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:42,837 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:52:42,843 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;@67caf45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:52:42,843 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:52:42,874 INFO L278 IsEmpty]: Start isEmpty. Operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:42,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:52:42,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:42,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:52:42,949 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 2 more)] === [2025-04-13 22:52:42,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1671348735, now seen corresponding path program 1 times [2025-04-13 22:52:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:42,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374979722] [2025-04-13 22:52:42,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:52:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:43,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:52:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:52:43,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:52:43,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:43,170 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:52:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:43,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374979722] [2025-04-13 22:52:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374979722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:52:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130442926] [2025-04-13 22:52:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:43,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:52:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:52:43,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:52:43,219 INFO L87 Difference]: Start difference. First operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 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 11.0) internal successors, (33), 3 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:52:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:43,464 INFO L93 Difference]: Finished difference Result 10421 states and 45970 transitions. [2025-04-13 22:52:43,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:52:43,465 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 33 [2025-04-13 22:52:43,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:43,614 INFO L225 Difference]: With dead ends: 10421 [2025-04-13 22:52:43,616 INFO L226 Difference]: Without dead ends: 7823 [2025-04-13 22:52:43,626 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:52:43,629 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:43,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:52:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2025-04-13 22:52:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2025-04-13 22:52:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7823 states, 7822 states have (on average 4.311301457427768) internal successors, (33723), 7822 states have internal predecessors, (33723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 33723 transitions. [2025-04-13 22:52:44,060 INFO L79 Accepts]: Start accepts. Automaton has 7823 states and 33723 transitions. Word has length 33 [2025-04-13 22:52:44,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:44,061 INFO L485 AbstractCegarLoop]: Abstraction has 7823 states and 33723 transitions. [2025-04-13 22:52:44,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:52:44,061 INFO L278 IsEmpty]: Start isEmpty. Operand 7823 states and 33723 transitions. [2025-04-13 22:52:44,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:52:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:44,163 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, 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:52:44,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:52:44,163 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 2 more)] === [2025-04-13 22:52:44,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1013578288, now seen corresponding path program 1 times [2025-04-13 22:52:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:44,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763352014] [2025-04-13 22:52:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:52:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:44,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 22:52:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:52:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:52:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:44,413 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:52:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:44,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763352014] [2025-04-13 22:52:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763352014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:44,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:44,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:52:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131110635] [2025-04-13 22:52:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:44,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:52:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:44,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:52:44,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:52:44,416 INFO L87 Difference]: Start difference. First operand 7823 states and 33723 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:52:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:44,610 INFO L93 Difference]: Finished difference Result 15643 states and 67443 transitions. [2025-04-13 22:52:44,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:52:44,610 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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 43 [2025-04-13 22:52:44,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:44,678 INFO L225 Difference]: With dead ends: 15643 [2025-04-13 22:52:44,679 INFO L226 Difference]: Without dead ends: 7824 [2025-04-13 22:52:44,693 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:52:44,694 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:44,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:52:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2025-04-13 22:52:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7824. [2025-04-13 22:52:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7824 states, 7823 states have (on average 4.310878179726448) internal successors, (33724), 7823 states have internal predecessors, (33724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7824 states to 7824 states and 33724 transitions. [2025-04-13 22:52:44,976 INFO L79 Accepts]: Start accepts. Automaton has 7824 states and 33724 transitions. Word has length 43 [2025-04-13 22:52:44,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:44,976 INFO L485 AbstractCegarLoop]: Abstraction has 7824 states and 33724 transitions. [2025-04-13 22:52:44,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:52:44,977 INFO L278 IsEmpty]: Start isEmpty. Operand 7824 states and 33724 transitions. [2025-04-13 22:52:44,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:44,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:44,998 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, 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:52:44,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:52:44,999 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 2 more)] === [2025-04-13 22:52:44,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1364580041, now seen corresponding path program 1 times [2025-04-13 22:52:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:44,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611815629] [2025-04-13 22:52:44,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:52:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:52:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:52:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:52:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:45,861 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:52:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:45,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611815629] [2025-04-13 22:52:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611815629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 22:52:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886816119] [2025-04-13 22:52:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:45,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:52:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:45,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:52:45,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:52:45,863 INFO L87 Difference]: Start difference. First operand 7824 states and 33724 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:49,639 INFO L93 Difference]: Finished difference Result 39282 states and 172933 transitions. [2025-04-13 22:52:49,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 22:52:49,640 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:49,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:49,818 INFO L225 Difference]: With dead ends: 39282 [2025-04-13 22:52:49,818 INFO L226 Difference]: Without dead ends: 31510 [2025-04-13 22:52:49,846 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3622 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1665, Invalid=7647, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 22:52:49,847 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 958 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:49,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 294 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 22:52:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31510 states. [2025-04-13 22:52:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31510 to 9040. [2025-04-13 22:52:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9040 states, 9039 states have (on average 4.285429804181878) internal successors, (38736), 9039 states have internal predecessors, (38736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9040 states to 9040 states and 38736 transitions. [2025-04-13 22:52:50,341 INFO L79 Accepts]: Start accepts. Automaton has 9040 states and 38736 transitions. Word has length 44 [2025-04-13 22:52:50,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:50,343 INFO L485 AbstractCegarLoop]: Abstraction has 9040 states and 38736 transitions. [2025-04-13 22:52:50,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:50,343 INFO L278 IsEmpty]: Start isEmpty. Operand 9040 states and 38736 transitions. [2025-04-13 22:52:50,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:50,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:50,365 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, 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:52:50,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:52:50,365 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 2 more)] === [2025-04-13 22:52:50,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1737864201, now seen corresponding path program 2 times [2025-04-13 22:52:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:50,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638498316] [2025-04-13 22:52:50,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:52:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:50,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:52:50,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:52:50,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:52:50,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:50,568 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:52:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:50,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638498316] [2025-04-13 22:52:50,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638498316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:50,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:50,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:52:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121401322] [2025-04-13 22:52:50,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:50,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:52:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:52:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:52:50,569 INFO L87 Difference]: Start difference. First operand 9040 states and 38736 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:51,613 INFO L93 Difference]: Finished difference Result 35323 states and 152097 transitions. [2025-04-13 22:52:51,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:52:51,614 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:51,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:51,770 INFO L225 Difference]: With dead ends: 35323 [2025-04-13 22:52:51,770 INFO L226 Difference]: Without dead ends: 28254 [2025-04-13 22:52:51,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:52:51,796 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 517 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:51,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 85 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:52:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28254 states. [2025-04-13 22:52:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28254 to 10108. [2025-04-13 22:52:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10108 states, 10107 states have (on average 4.291481151677056) internal successors, (43374), 10107 states have internal predecessors, (43374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 43374 transitions. [2025-04-13 22:52:52,220 INFO L79 Accepts]: Start accepts. Automaton has 10108 states and 43374 transitions. Word has length 44 [2025-04-13 22:52:52,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:52,221 INFO L485 AbstractCegarLoop]: Abstraction has 10108 states and 43374 transitions. [2025-04-13 22:52:52,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:52,221 INFO L278 IsEmpty]: Start isEmpty. Operand 10108 states and 43374 transitions. [2025-04-13 22:52:52,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:52,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:52,312 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, 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:52:52,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:52:52,313 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 2 more)] === [2025-04-13 22:52:52,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -622890231, now seen corresponding path program 3 times [2025-04-13 22:52:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:52,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720503471] [2025-04-13 22:52:52,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:52:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:52,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:52:52,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:52:52,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:52:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:52,528 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:52:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:52,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720503471] [2025-04-13 22:52:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720503471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:52:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78866066] [2025-04-13 22:52:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:52,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:52:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:52,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:52:52,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:52:52,529 INFO L87 Difference]: Start difference. First operand 10108 states and 43374 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:52,824 INFO L93 Difference]: Finished difference Result 12705 states and 54685 transitions. [2025-04-13 22:52:52,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:52:52,825 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:52,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:52,872 INFO L225 Difference]: With dead ends: 12705 [2025-04-13 22:52:52,873 INFO L226 Difference]: Without dead ends: 7168 [2025-04-13 22:52:52,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:52:52,885 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 106 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:52,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 30 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:52:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2025-04-13 22:52:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5844. [2025-04-13 22:52:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5844 states, 5843 states have (on average 4.21598493924354) internal successors, (24634), 5843 states have internal predecessors, (24634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 24634 transitions. [2025-04-13 22:52:53,071 INFO L79 Accepts]: Start accepts. Automaton has 5844 states and 24634 transitions. Word has length 44 [2025-04-13 22:52:53,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:53,071 INFO L485 AbstractCegarLoop]: Abstraction has 5844 states and 24634 transitions. [2025-04-13 22:52:53,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:53,072 INFO L278 IsEmpty]: Start isEmpty. Operand 5844 states and 24634 transitions. [2025-04-13 22:52:53,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:53,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:53,093 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, 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:52:53,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:52:53,094 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 2 more)] === [2025-04-13 22:52:53,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash 690789883, now seen corresponding path program 4 times [2025-04-13 22:52:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:53,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947058958] [2025-04-13 22:52:53,094 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:52:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:53,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:52:53,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 22:52:53,110 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:52:53,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:53,162 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:52:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:53,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947058958] [2025-04-13 22:52:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947058958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:52:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231119795] [2025-04-13 22:52:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:53,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:52:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:53,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:52:53,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:52:53,164 INFO L87 Difference]: Start difference. First operand 5844 states and 24634 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:53,502 INFO L93 Difference]: Finished difference Result 12182 states and 52421 transitions. [2025-04-13 22:52:53,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:52:53,503 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:53,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:53,557 INFO L225 Difference]: With dead ends: 12182 [2025-04-13 22:52:53,557 INFO L226 Difference]: Without dead ends: 9522 [2025-04-13 22:52:53,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:52:53,565 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 128 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:53,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 42 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:52:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states. [2025-04-13 22:52:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 8576. [2025-04-13 22:52:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8576 states, 8575 states have (on average 4.202215743440234) internal successors, (36034), 8575 states have internal predecessors, (36034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8576 states to 8576 states and 36034 transitions. [2025-04-13 22:52:53,834 INFO L79 Accepts]: Start accepts. Automaton has 8576 states and 36034 transitions. Word has length 44 [2025-04-13 22:52:53,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:53,835 INFO L485 AbstractCegarLoop]: Abstraction has 8576 states and 36034 transitions. [2025-04-13 22:52:53,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:53,835 INFO L278 IsEmpty]: Start isEmpty. Operand 8576 states and 36034 transitions. [2025-04-13 22:52:53,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:53,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:53,856 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, 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:52:53,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:52:53,857 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 2 more)] === [2025-04-13 22:52:53,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:53,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1533957805, now seen corresponding path program 5 times [2025-04-13 22:52:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:53,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469187358] [2025-04-13 22:52:53,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:52:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:53,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:52:53,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:52:53,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:52:53,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:54,130 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:52:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:54,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469187358] [2025-04-13 22:52:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469187358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:54,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:54,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:52:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775323661] [2025-04-13 22:52:54,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:54,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:52:54,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:54,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:52:54,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:52:54,131 INFO L87 Difference]: Start difference. First operand 8576 states and 36034 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:55,914 INFO L93 Difference]: Finished difference Result 36009 states and 155782 transitions. [2025-04-13 22:52:55,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 22:52:55,914 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:55,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:56,044 INFO L225 Difference]: With dead ends: 36009 [2025-04-13 22:52:56,044 INFO L226 Difference]: Without dead ends: 27212 [2025-04-13 22:52:56,059 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=552, Invalid=2528, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:52:56,060 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 878 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:56,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 128 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:52:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27212 states. [2025-04-13 22:52:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27212 to 12230. [2025-04-13 22:52:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12230 states, 12229 states have (on average 4.160274756725816) internal successors, (50876), 12229 states have internal predecessors, (50876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12230 states to 12230 states and 50876 transitions. [2025-04-13 22:52:56,598 INFO L79 Accepts]: Start accepts. Automaton has 12230 states and 50876 transitions. Word has length 44 [2025-04-13 22:52:56,599 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:56,599 INFO L485 AbstractCegarLoop]: Abstraction has 12230 states and 50876 transitions. [2025-04-13 22:52:56,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:56,599 INFO L278 IsEmpty]: Start isEmpty. Operand 12230 states and 50876 transitions. [2025-04-13 22:52:56,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:56,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:56,630 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, 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:52:56,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:52:56,631 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 2 more)] === [2025-04-13 22:52:56,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1600157851, now seen corresponding path program 6 times [2025-04-13 22:52:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:56,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762650900] [2025-04-13 22:52:56,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:52:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:56,639 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:52:56,645 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:52:56,645 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:52:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:56,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:52:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:56,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762650900] [2025-04-13 22:52:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762650900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:52:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:52:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:52:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814653967] [2025-04-13 22:52:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:52:56,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:52:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:52:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:52:56,927 INFO L87 Difference]: Start difference. First operand 12230 states and 50876 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:59,079 INFO L93 Difference]: Finished difference Result 42475 states and 181765 transitions. [2025-04-13 22:52:59,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 22:52:59,079 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:52:59,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:59,219 INFO L225 Difference]: With dead ends: 42475 [2025-04-13 22:52:59,220 INFO L226 Difference]: Without dead ends: 33480 [2025-04-13 22:52:59,246 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=643, Invalid=3389, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:52:59,247 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 800 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:59,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 154 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:52:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33480 states. [2025-04-13 22:52:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33480 to 12520. [2025-04-13 22:52:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12520 states, 12519 states have (on average 4.149213195942168) internal successors, (51944), 12519 states have internal predecessors, (51944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12520 states to 12520 states and 51944 transitions. [2025-04-13 22:52:59,717 INFO L79 Accepts]: Start accepts. Automaton has 12520 states and 51944 transitions. Word has length 44 [2025-04-13 22:52:59,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:59,718 INFO L485 AbstractCegarLoop]: Abstraction has 12520 states and 51944 transitions. [2025-04-13 22:52:59,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:52:59,718 INFO L278 IsEmpty]: Start isEmpty. Operand 12520 states and 51944 transitions. [2025-04-13 22:52:59,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:52:59,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:59,743 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, 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:52:59,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:52:59,743 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 2 more)] === [2025-04-13 22:52:59,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1446023571, now seen corresponding path program 7 times [2025-04-13 22:52:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:59,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054283740] [2025-04-13 22:52:59,744 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:52:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:59,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:52:59,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:52:59,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:52:59,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:00,022 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:53:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:00,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054283740] [2025-04-13 22:53:00,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054283740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:00,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:00,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:53:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659443455] [2025-04-13 22:53:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:00,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:53:00,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:00,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:53:00,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:53:00,023 INFO L87 Difference]: Start difference. First operand 12520 states and 51944 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:01,541 INFO L93 Difference]: Finished difference Result 34465 states and 148469 transitions. [2025-04-13 22:53:01,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 22:53:01,541 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:01,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:01,660 INFO L225 Difference]: With dead ends: 34465 [2025-04-13 22:53:01,660 INFO L226 Difference]: Without dead ends: 26936 [2025-04-13 22:53:01,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=476, Invalid=2386, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:53:01,681 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 594 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:01,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 133 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:53:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26936 states. [2025-04-13 22:53:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26936 to 12566. [2025-04-13 22:53:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12566 states, 12565 states have (on average 4.147632311977716) internal successors, (52115), 12565 states have internal predecessors, (52115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12566 states to 12566 states and 52115 transitions. [2025-04-13 22:53:02,102 INFO L79 Accepts]: Start accepts. Automaton has 12566 states and 52115 transitions. Word has length 44 [2025-04-13 22:53:02,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:02,102 INFO L485 AbstractCegarLoop]: Abstraction has 12566 states and 52115 transitions. [2025-04-13 22:53:02,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:02,102 INFO L278 IsEmpty]: Start isEmpty. Operand 12566 states and 52115 transitions. [2025-04-13 22:53:02,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:02,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:02,127 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, 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:53:02,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:53:02,127 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 2 more)] === [2025-04-13 22:53:02,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -920994359, now seen corresponding path program 8 times [2025-04-13 22:53:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:02,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688734593] [2025-04-13 22:53:02,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:53:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:02,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:53:02,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:53:02,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:53:02,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:02,401 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:53:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:02,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688734593] [2025-04-13 22:53:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688734593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:53:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65140165] [2025-04-13 22:53:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:02,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:53:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:02,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:53:02,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:53:02,402 INFO L87 Difference]: Start difference. First operand 12566 states and 52115 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:05,118 INFO L93 Difference]: Finished difference Result 40200 states and 174222 transitions. [2025-04-13 22:53:05,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-13 22:53:05,119 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:05,119 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:05,264 INFO L225 Difference]: With dead ends: 40200 [2025-04-13 22:53:05,264 INFO L226 Difference]: Without dead ends: 32671 [2025-04-13 22:53:05,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1305, Invalid=7251, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 22:53:05,289 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 668 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:05,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 237 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:53:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32671 states. [2025-04-13 22:53:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32671 to 12945. [2025-04-13 22:53:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12945 states, 12944 states have (on average 4.149026576019778) internal successors, (53705), 12944 states have internal predecessors, (53705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12945 states to 12945 states and 53705 transitions. [2025-04-13 22:53:05,840 INFO L79 Accepts]: Start accepts. Automaton has 12945 states and 53705 transitions. Word has length 44 [2025-04-13 22:53:05,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:05,840 INFO L485 AbstractCegarLoop]: Abstraction has 12945 states and 53705 transitions. [2025-04-13 22:53:05,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:05,841 INFO L278 IsEmpty]: Start isEmpty. Operand 12945 states and 53705 transitions. [2025-04-13 22:53:05,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:05,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:05,867 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, 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:53:05,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:53:05,868 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 2 more)] === [2025-04-13 22:53:05,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2008444089, now seen corresponding path program 9 times [2025-04-13 22:53:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:05,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914623364] [2025-04-13 22:53:05,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:53:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:05,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:53:05,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:53:05,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:53:05,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:06,011 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:53:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:06,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914623364] [2025-04-13 22:53:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914623364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:53:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872393333] [2025-04-13 22:53:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:06,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:53:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:06,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:53:06,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:53:06,013 INFO L87 Difference]: Start difference. First operand 12945 states and 53705 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:06,380 INFO L93 Difference]: Finished difference Result 19221 states and 80341 transitions. [2025-04-13 22:53:06,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:53:06,380 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:06,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:06,457 INFO L225 Difference]: With dead ends: 19221 [2025-04-13 22:53:06,457 INFO L226 Difference]: Without dead ends: 14185 [2025-04-13 22:53:06,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:53:06,470 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 135 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:06,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 22 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:53:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14185 states. [2025-04-13 22:53:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14185 to 12905. [2025-04-13 22:53:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12905 states, 12904 states have (on average 4.127634841909486) internal successors, (53263), 12904 states have internal predecessors, (53263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 53263 transitions. [2025-04-13 22:53:06,759 INFO L79 Accepts]: Start accepts. Automaton has 12905 states and 53263 transitions. Word has length 44 [2025-04-13 22:53:06,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:06,759 INFO L485 AbstractCegarLoop]: Abstraction has 12905 states and 53263 transitions. [2025-04-13 22:53:06,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:06,759 INFO L278 IsEmpty]: Start isEmpty. Operand 12905 states and 53263 transitions. [2025-04-13 22:53:06,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:06,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:06,785 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, 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:53:06,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:53:06,785 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 2 more)] === [2025-04-13 22:53:06,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1898518429, now seen corresponding path program 10 times [2025-04-13 22:53:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:06,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873021008] [2025-04-13 22:53:06,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:53:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:06,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:53:06,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 22:53:06,796 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:53:06,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:06,832 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:53:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:06,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873021008] [2025-04-13 22:53:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873021008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:06,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:53:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466918530] [2025-04-13 22:53:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:06,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:53:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:06,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:53:06,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:53:06,833 INFO L87 Difference]: Start difference. First operand 12905 states and 53263 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:07,399 INFO L93 Difference]: Finished difference Result 27584 states and 117016 transitions. [2025-04-13 22:53:07,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:53:07,399 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:07,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:07,512 INFO L225 Difference]: With dead ends: 27584 [2025-04-13 22:53:07,512 INFO L226 Difference]: Without dead ends: 19571 [2025-04-13 22:53:07,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:53:07,531 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 158 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:07,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 42 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:53:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19571 states. [2025-04-13 22:53:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19571 to 17457. [2025-04-13 22:53:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17457 states, 17456 states have (on average 4.102486251145738) internal successors, (71613), 17456 states have internal predecessors, (71613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17457 states to 17457 states and 71613 transitions. [2025-04-13 22:53:07,990 INFO L79 Accepts]: Start accepts. Automaton has 17457 states and 71613 transitions. Word has length 44 [2025-04-13 22:53:07,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:07,990 INFO L485 AbstractCegarLoop]: Abstraction has 17457 states and 71613 transitions. [2025-04-13 22:53:07,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:07,991 INFO L278 IsEmpty]: Start isEmpty. Operand 17457 states and 71613 transitions. [2025-04-13 22:53:08,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:08,037 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, 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:53:08,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:53:08,037 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 2 more)] === [2025-04-13 22:53:08,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1111393071, now seen corresponding path program 11 times [2025-04-13 22:53:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:08,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704133825] [2025-04-13 22:53:08,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:53:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:08,044 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:53:08,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:53:08,051 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:53:08,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:08,134 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:53:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:08,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704133825] [2025-04-13 22:53:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704133825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:08,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:53:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384454718] [2025-04-13 22:53:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:08,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:53:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:08,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:53:08,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:53:08,135 INFO L87 Difference]: Start difference. First operand 17457 states and 71613 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:08,831 INFO L93 Difference]: Finished difference Result 26500 states and 109510 transitions. [2025-04-13 22:53:08,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:53:08,831 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:08,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:08,951 INFO L225 Difference]: With dead ends: 26500 [2025-04-13 22:53:08,951 INFO L226 Difference]: Without dead ends: 22685 [2025-04-13 22:53:08,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:53:08,967 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 282 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:08,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 57 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:53:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22685 states. [2025-04-13 22:53:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22685 to 17367. [2025-04-13 22:53:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17367 states, 17366 states have (on average 4.10474490383508) internal successors, (71283), 17366 states have internal predecessors, (71283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 71283 transitions. [2025-04-13 22:53:09,497 INFO L79 Accepts]: Start accepts. Automaton has 17367 states and 71283 transitions. Word has length 44 [2025-04-13 22:53:09,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:09,497 INFO L485 AbstractCegarLoop]: Abstraction has 17367 states and 71283 transitions. [2025-04-13 22:53:09,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:09,498 INFO L278 IsEmpty]: Start isEmpty. Operand 17367 states and 71283 transitions. [2025-04-13 22:53:09,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:09,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:09,530 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, 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:53:09,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:53:09,530 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 2 more)] === [2025-04-13 22:53:09,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1964577223, now seen corresponding path program 12 times [2025-04-13 22:53:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:09,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251341724] [2025-04-13 22:53:09,531 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:53:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:09,535 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:53:09,538 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 22:53:09,538 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:53:09,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:09,617 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:53:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:09,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251341724] [2025-04-13 22:53:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251341724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:53:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870677712] [2025-04-13 22:53:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:09,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:53:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:09,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:53:09,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:53:09,618 INFO L87 Difference]: Start difference. First operand 17367 states and 71283 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:10,322 INFO L93 Difference]: Finished difference Result 27690 states and 114091 transitions. [2025-04-13 22:53:10,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:53:10,322 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:10,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:10,442 INFO L225 Difference]: With dead ends: 27690 [2025-04-13 22:53:10,442 INFO L226 Difference]: Without dead ends: 23875 [2025-04-13 22:53:10,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:53:10,458 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 264 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:10,458 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 61 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:53:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23875 states. [2025-04-13 22:53:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23875 to 17321. [2025-04-13 22:53:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17321 states, 17320 states have (on average 4.105773672055427) internal successors, (71112), 17320 states have internal predecessors, (71112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17321 states to 17321 states and 71112 transitions. [2025-04-13 22:53:10,903 INFO L79 Accepts]: Start accepts. Automaton has 17321 states and 71112 transitions. Word has length 44 [2025-04-13 22:53:10,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:10,903 INFO L485 AbstractCegarLoop]: Abstraction has 17321 states and 71112 transitions. [2025-04-13 22:53:10,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:10,903 INFO L278 IsEmpty]: Start isEmpty. Operand 17321 states and 71112 transitions. [2025-04-13 22:53:10,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:53:10,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:10,936 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, 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:53:10,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:53:10,936 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 2 more)] === [2025-04-13 22:53:10,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -421335465, now seen corresponding path program 13 times [2025-04-13 22:53:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:10,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480421421] [2025-04-13 22:53:10,936 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:53:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:10,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:53:10,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:53:10,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:53:10,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:11,037 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:53:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:11,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480421421] [2025-04-13 22:53:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480421421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:53:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807914029] [2025-04-13 22:53:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:11,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:53:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:53:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:53:11,038 INFO L87 Difference]: Start difference. First operand 17321 states and 71112 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:11,950 INFO L93 Difference]: Finished difference Result 28775 states and 118861 transitions. [2025-04-13 22:53:11,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:53:11,950 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:53:11,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:12,072 INFO L225 Difference]: With dead ends: 28775 [2025-04-13 22:53:12,073 INFO L226 Difference]: Without dead ends: 24680 [2025-04-13 22:53:12,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:53:12,089 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 372 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:12,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 65 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:53:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24680 states. [2025-04-13 22:53:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24680 to 16661. [2025-04-13 22:53:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16661 states, 16660 states have (on average 4.1123049219687875) internal successors, (68511), 16660 states have internal predecessors, (68511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16661 states to 16661 states and 68511 transitions. [2025-04-13 22:53:12,536 INFO L79 Accepts]: Start accepts. Automaton has 16661 states and 68511 transitions. Word has length 44 [2025-04-13 22:53:12,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:12,536 INFO L485 AbstractCegarLoop]: Abstraction has 16661 states and 68511 transitions. [2025-04-13 22:53:12,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:12,537 INFO L278 IsEmpty]: Start isEmpty. Operand 16661 states and 68511 transitions. [2025-04-13 22:53:12,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:12,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:12,568 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, 1, 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:53:12,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:53:12,568 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 2 more)] === [2025-04-13 22:53:12,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 909636109, now seen corresponding path program 1 times [2025-04-13 22:53:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:12,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605071028] [2025-04-13 22:53:12,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:53:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:12,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:53:12,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:53:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:53:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:12,741 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:53:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:12,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605071028] [2025-04-13 22:53:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605071028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:12,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:53:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472270663] [2025-04-13 22:53:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:12,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:53:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:53:12,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:53:12,742 INFO L87 Difference]: Start difference. First operand 16661 states and 68511 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:14,795 INFO L93 Difference]: Finished difference Result 50733 states and 216281 transitions. [2025-04-13 22:53:14,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 22:53:14,796 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:14,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:15,031 INFO L225 Difference]: With dead ends: 50733 [2025-04-13 22:53:15,031 INFO L226 Difference]: Without dead ends: 45159 [2025-04-13 22:53:15,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=856, Invalid=3836, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:53:15,061 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 837 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:15,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 162 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:53:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45159 states. [2025-04-13 22:53:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45159 to 22781. [2025-04-13 22:53:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22781 states, 22780 states have (on average 4.113037752414399) internal successors, (93695), 22780 states have internal predecessors, (93695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22781 states to 22781 states and 93695 transitions. [2025-04-13 22:53:15,813 INFO L79 Accepts]: Start accepts. Automaton has 22781 states and 93695 transitions. Word has length 45 [2025-04-13 22:53:15,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:15,814 INFO L485 AbstractCegarLoop]: Abstraction has 22781 states and 93695 transitions. [2025-04-13 22:53:15,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:15,814 INFO L278 IsEmpty]: Start isEmpty. Operand 22781 states and 93695 transitions. [2025-04-13 22:53:15,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:15,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:15,860 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, 1, 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:53:15,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:53:15,860 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 2 more)] === [2025-04-13 22:53:15,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1502624337, now seen corresponding path program 2 times [2025-04-13 22:53:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:15,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182965799] [2025-04-13 22:53:15,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:53:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:15,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:15,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:15,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:53:15,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:16,131 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:53:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:16,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182965799] [2025-04-13 22:53:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182965799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:53:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496801932] [2025-04-13 22:53:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:16,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:53:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:53:16,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:53:16,133 INFO L87 Difference]: Start difference. First operand 22781 states and 93695 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:18,899 INFO L93 Difference]: Finished difference Result 69256 states and 296386 transitions. [2025-04-13 22:53:18,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 22:53:18,899 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:18,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:19,203 INFO L225 Difference]: With dead ends: 69256 [2025-04-13 22:53:19,203 INFO L226 Difference]: Without dead ends: 61068 [2025-04-13 22:53:19,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1073, Invalid=6759, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 22:53:19,240 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 940 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:19,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 184 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3272 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:53:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61068 states. [2025-04-13 22:53:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61068 to 25443. [2025-04-13 22:53:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25443 states, 25442 states have (on average 4.110172156277022) internal successors, (104571), 25442 states have internal predecessors, (104571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25443 states to 25443 states and 104571 transitions. [2025-04-13 22:53:20,384 INFO L79 Accepts]: Start accepts. Automaton has 25443 states and 104571 transitions. Word has length 45 [2025-04-13 22:53:20,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:20,385 INFO L485 AbstractCegarLoop]: Abstraction has 25443 states and 104571 transitions. [2025-04-13 22:53:20,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:20,385 INFO L278 IsEmpty]: Start isEmpty. Operand 25443 states and 104571 transitions. [2025-04-13 22:53:20,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:20,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:20,444 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, 1, 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:53:20,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:53:20,444 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 2 more)] === [2025-04-13 22:53:20,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash -745768859, now seen corresponding path program 3 times [2025-04-13 22:53:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:20,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485204657] [2025-04-13 22:53:20,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:53:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:20,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:20,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:20,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:53:20,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:20,608 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:53:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:20,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485204657] [2025-04-13 22:53:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485204657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:20,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:53:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334587988] [2025-04-13 22:53:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:20,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:53:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:20,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:53:20,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:53:20,610 INFO L87 Difference]: Start difference. First operand 25443 states and 104571 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:22,867 INFO L93 Difference]: Finished difference Result 56007 states and 237977 transitions. [2025-04-13 22:53:22,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 22:53:22,868 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:22,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:23,144 INFO L225 Difference]: With dead ends: 56007 [2025-04-13 22:53:23,145 INFO L226 Difference]: Without dead ends: 50607 [2025-04-13 22:53:23,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1037, Invalid=5605, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 22:53:23,176 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 935 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:23,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 182 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:53:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50607 states. [2025-04-13 22:53:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50607 to 21925. [2025-04-13 22:53:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21925 states, 21924 states have (on average 4.094599525634008) internal successors, (89770), 21924 states have internal predecessors, (89770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21925 states to 21925 states and 89770 transitions. [2025-04-13 22:53:24,202 INFO L79 Accepts]: Start accepts. Automaton has 21925 states and 89770 transitions. Word has length 45 [2025-04-13 22:53:24,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:24,202 INFO L485 AbstractCegarLoop]: Abstraction has 21925 states and 89770 transitions. [2025-04-13 22:53:24,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:24,202 INFO L278 IsEmpty]: Start isEmpty. Operand 21925 states and 89770 transitions. [2025-04-13 22:53:24,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:24,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:24,253 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, 1, 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:53:24,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:53:24,253 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 2 more)] === [2025-04-13 22:53:24,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1581370799, now seen corresponding path program 4 times [2025-04-13 22:53:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:24,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168672303] [2025-04-13 22:53:24,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:53:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:24,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:24,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 22:53:24,262 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:53:24,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:24,384 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:53:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:24,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168672303] [2025-04-13 22:53:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168672303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:53:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828889203] [2025-04-13 22:53:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:24,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:53:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:53:24,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:53:24,385 INFO L87 Difference]: Start difference. First operand 21925 states and 89770 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:25,209 INFO L93 Difference]: Finished difference Result 39136 states and 165316 transitions. [2025-04-13 22:53:25,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:53:25,209 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:25,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:25,586 INFO L225 Difference]: With dead ends: 39136 [2025-04-13 22:53:25,586 INFO L226 Difference]: Without dead ends: 34260 [2025-04-13 22:53:25,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:53:25,599 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 186 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:25,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 95 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:53:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34260 states. [2025-04-13 22:53:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34260 to 22205. [2025-04-13 22:53:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22205 states, 22204 states have (on average 4.088452531075482) internal successors, (90780), 22204 states have internal predecessors, (90780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22205 states to 22205 states and 90780 transitions. [2025-04-13 22:53:26,171 INFO L79 Accepts]: Start accepts. Automaton has 22205 states and 90780 transitions. Word has length 45 [2025-04-13 22:53:26,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:26,171 INFO L485 AbstractCegarLoop]: Abstraction has 22205 states and 90780 transitions. [2025-04-13 22:53:26,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:26,171 INFO L278 IsEmpty]: Start isEmpty. Operand 22205 states and 90780 transitions. [2025-04-13 22:53:26,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:26,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:26,363 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, 1, 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:53:26,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:53:26,363 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 2 more)] === [2025-04-13 22:53:26,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -72440019, now seen corresponding path program 5 times [2025-04-13 22:53:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:26,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851014502] [2025-04-13 22:53:26,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:53:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:26,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:26,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:53:26,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:53:26,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:26,557 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:53:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:26,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851014502] [2025-04-13 22:53:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851014502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:53:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096822931] [2025-04-13 22:53:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:26,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:53:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:53:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:53:26,558 INFO L87 Difference]: Start difference. First operand 22205 states and 90780 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:29,283 INFO L93 Difference]: Finished difference Result 49139 states and 208896 transitions. [2025-04-13 22:53:29,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-13 22:53:29,283 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:29,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:29,504 INFO L225 Difference]: With dead ends: 49139 [2025-04-13 22:53:29,504 INFO L226 Difference]: Without dead ends: 44518 [2025-04-13 22:53:29,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1327, Invalid=7603, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 22:53:29,532 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 662 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:29,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 277 Invalid, 4360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:53:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44518 states. [2025-04-13 22:53:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44518 to 26629. [2025-04-13 22:53:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 4.118221421060538) internal successors, (109660), 26628 states have internal predecessors, (109660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 109660 transitions. [2025-04-13 22:53:30,450 INFO L79 Accepts]: Start accepts. Automaton has 26629 states and 109660 transitions. Word has length 45 [2025-04-13 22:53:30,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:30,450 INFO L485 AbstractCegarLoop]: Abstraction has 26629 states and 109660 transitions. [2025-04-13 22:53:30,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:30,451 INFO L278 IsEmpty]: Start isEmpty. Operand 26629 states and 109660 transitions. [2025-04-13 22:53:30,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:30,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:30,506 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, 1, 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:53:30,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:53:30,506 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 2 more)] === [2025-04-13 22:53:30,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1243961793, now seen corresponding path program 6 times [2025-04-13 22:53:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:30,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361196250] [2025-04-13 22:53:30,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:53:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:30,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:30,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:30,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:53:30,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:30,679 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:53:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:30,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361196250] [2025-04-13 22:53:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361196250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:30,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 22:53:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639249843] [2025-04-13 22:53:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:30,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:53:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:30,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:53:30,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:53:30,681 INFO L87 Difference]: Start difference. First operand 26629 states and 109660 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:33,484 INFO L93 Difference]: Finished difference Result 64936 states and 277067 transitions. [2025-04-13 22:53:33,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-04-13 22:53:33,484 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:33,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:33,795 INFO L225 Difference]: With dead ends: 64936 [2025-04-13 22:53:33,795 INFO L226 Difference]: Without dead ends: 59927 [2025-04-13 22:53:33,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3803 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1514, Invalid=8992, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 22:53:33,831 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 808 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 3904 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:33,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 237 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3904 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:53:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59927 states. [2025-04-13 22:53:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59927 to 27403. [2025-04-13 22:53:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27403 states, 27402 states have (on average 4.127946865192322) internal successors, (113114), 27402 states have internal predecessors, (113114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27403 states to 27403 states and 113114 transitions. [2025-04-13 22:53:35,112 INFO L79 Accepts]: Start accepts. Automaton has 27403 states and 113114 transitions. Word has length 45 [2025-04-13 22:53:35,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:35,113 INFO L485 AbstractCegarLoop]: Abstraction has 27403 states and 113114 transitions. [2025-04-13 22:53:35,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:35,113 INFO L278 IsEmpty]: Start isEmpty. Operand 27403 states and 113114 transitions. [2025-04-13 22:53:35,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:35,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:35,188 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, 1, 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:53:35,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:53:35,188 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 2 more)] === [2025-04-13 22:53:35,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1770015589, now seen corresponding path program 7 times [2025-04-13 22:53:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:35,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190470172] [2025-04-13 22:53:35,188 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:53:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:53:35,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:53:35,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:53:35,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:35,401 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:53:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:35,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190470172] [2025-04-13 22:53:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190470172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:35,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:53:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629164426] [2025-04-13 22:53:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:35,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:53:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:35,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:53:35,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:53:35,403 INFO L87 Difference]: Start difference. First operand 27403 states and 113114 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:38,029 INFO L93 Difference]: Finished difference Result 64928 states and 278749 transitions. [2025-04-13 22:53:38,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 22:53:38,029 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:38,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:38,355 INFO L225 Difference]: With dead ends: 64928 [2025-04-13 22:53:38,355 INFO L226 Difference]: Without dead ends: 60307 [2025-04-13 22:53:38,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1145, Invalid=5995, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 22:53:38,394 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 749 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:38,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 191 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:53:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60307 states. [2025-04-13 22:53:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60307 to 26863. [2025-04-13 22:53:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26863 states, 26862 states have (on average 4.128099173553719) internal successors, (110889), 26862 states have internal predecessors, (110889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26863 states to 26863 states and 110889 transitions. [2025-04-13 22:53:39,717 INFO L79 Accepts]: Start accepts. Automaton has 26863 states and 110889 transitions. Word has length 45 [2025-04-13 22:53:39,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:39,717 INFO L485 AbstractCegarLoop]: Abstraction has 26863 states and 110889 transitions. [2025-04-13 22:53:39,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:39,718 INFO L278 IsEmpty]: Start isEmpty. Operand 26863 states and 110889 transitions. [2025-04-13 22:53:39,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:39,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:39,776 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, 1, 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:53:39,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:53:39,777 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 2 more)] === [2025-04-13 22:53:39,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1954440487, now seen corresponding path program 8 times [2025-04-13 22:53:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:39,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634205357] [2025-04-13 22:53:39,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:53:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:39,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:39,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:39,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:53:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:39,884 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:53:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:39,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634205357] [2025-04-13 22:53:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634205357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:53:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314740368] [2025-04-13 22:53:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:39,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:53:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:53:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:53:39,885 INFO L87 Difference]: Start difference. First operand 26863 states and 110889 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:40,233 INFO L93 Difference]: Finished difference Result 30509 states and 125690 transitions. [2025-04-13 22:53:40,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:53:40,233 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:40,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:40,381 INFO L225 Difference]: With dead ends: 30509 [2025-04-13 22:53:40,381 INFO L226 Difference]: Without dead ends: 23980 [2025-04-13 22:53:40,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:53:40,399 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 136 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:40,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 20 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:53:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23980 states. [2025-04-13 22:53:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23980 to 23980. [2025-04-13 22:53:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23980 states, 23979 states have (on average 4.062596438550398) internal successors, (97417), 23979 states have internal predecessors, (97417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23980 states to 23980 states and 97417 transitions. [2025-04-13 22:53:41,039 INFO L79 Accepts]: Start accepts. Automaton has 23980 states and 97417 transitions. Word has length 45 [2025-04-13 22:53:41,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:41,039 INFO L485 AbstractCegarLoop]: Abstraction has 23980 states and 97417 transitions. [2025-04-13 22:53:41,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:41,039 INFO L278 IsEmpty]: Start isEmpty. Operand 23980 states and 97417 transitions. [2025-04-13 22:53:41,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:41,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:41,087 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, 1, 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:53:41,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:53:41,087 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 2 more)] === [2025-04-13 22:53:41,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1975025355, now seen corresponding path program 9 times [2025-04-13 22:53:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:41,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175787648] [2025-04-13 22:53:41,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:53:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:41,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:41,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:41,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:53:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:41,394 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:53:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:41,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175787648] [2025-04-13 22:53:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175787648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:41,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:41,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:53:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340025947] [2025-04-13 22:53:41,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:41,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:53:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:41,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:53:41,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:53:41,396 INFO L87 Difference]: Start difference. First operand 23980 states and 97417 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:43,640 INFO L93 Difference]: Finished difference Result 72160 states and 303389 transitions. [2025-04-13 22:53:43,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 22:53:43,641 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:43,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:43,992 INFO L225 Difference]: With dead ends: 72160 [2025-04-13 22:53:43,992 INFO L226 Difference]: Without dead ends: 65616 [2025-04-13 22:53:44,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=2652, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:53:44,019 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 856 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:44,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 131 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:53:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65616 states. [2025-04-13 22:53:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65616 to 27024. [2025-04-13 22:53:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27024 states, 27023 states have (on average 4.072345779521148) internal successors, (110047), 27023 states have internal predecessors, (110047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27024 states to 27024 states and 110047 transitions. [2025-04-13 22:53:45,084 INFO L79 Accepts]: Start accepts. Automaton has 27024 states and 110047 transitions. Word has length 45 [2025-04-13 22:53:45,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:45,085 INFO L485 AbstractCegarLoop]: Abstraction has 27024 states and 110047 transitions. [2025-04-13 22:53:45,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:45,085 INFO L278 IsEmpty]: Start isEmpty. Operand 27024 states and 110047 transitions. [2025-04-13 22:53:45,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:45,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:45,330 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, 1, 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:53:45,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:53:45,330 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 2 more)] === [2025-04-13 22:53:45,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash -384855581, now seen corresponding path program 10 times [2025-04-13 22:53:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:45,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397426892] [2025-04-13 22:53:45,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:53:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:45,334 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:45,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 22:53:45,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:53:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:45,404 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:53:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:45,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397426892] [2025-04-13 22:53:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397426892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:45,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:53:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846220605] [2025-04-13 22:53:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:45,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:53:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:45,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:53:45,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:53:45,405 INFO L87 Difference]: Start difference. First operand 27024 states and 110047 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:46,421 INFO L93 Difference]: Finished difference Result 69476 states and 297055 transitions. [2025-04-13 22:53:46,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:53:46,421 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:46,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:46,827 INFO L225 Difference]: With dead ends: 69476 [2025-04-13 22:53:46,827 INFO L226 Difference]: Without dead ends: 60980 [2025-04-13 22:53:46,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:53:46,854 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 252 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:46,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 120 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:53:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60980 states. [2025-04-13 22:53:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60980 to 33905. [2025-04-13 22:53:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33905 states, 33904 states have (on average 4.076274185936763) internal successors, (138202), 33904 states have internal predecessors, (138202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 138202 transitions. [2025-04-13 22:53:48,338 INFO L79 Accepts]: Start accepts. Automaton has 33905 states and 138202 transitions. Word has length 45 [2025-04-13 22:53:48,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:48,339 INFO L485 AbstractCegarLoop]: Abstraction has 33905 states and 138202 transitions. [2025-04-13 22:53:48,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:48,339 INFO L278 IsEmpty]: Start isEmpty. Operand 33905 states and 138202 transitions. [2025-04-13 22:53:48,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:48,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:48,412 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, 1, 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:53:48,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:53:48,412 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 2 more)] === [2025-04-13 22:53:48,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1726290404, now seen corresponding path program 1 times [2025-04-13 22:53:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:48,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842919181] [2025-04-13 22:53:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:53:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:48,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:53:48,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:53:48,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:53:48,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:48,535 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:53:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:48,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842919181] [2025-04-13 22:53:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842919181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:53:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913971848] [2025-04-13 22:53:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:48,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:53:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:48,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:53:48,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:53:48,536 INFO L87 Difference]: Start difference. First operand 33905 states and 138202 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:49,725 INFO L93 Difference]: Finished difference Result 45361 states and 185879 transitions. [2025-04-13 22:53:49,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:53:49,725 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:49,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:49,967 INFO L225 Difference]: With dead ends: 45361 [2025-04-13 22:53:49,967 INFO L226 Difference]: Without dead ends: 42884 [2025-04-13 22:53:49,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:53:49,991 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 453 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:49,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 74 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:53:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42884 states. [2025-04-13 22:53:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42884 to 37011. [2025-04-13 22:53:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37011 states, 37010 states have (on average 4.0960821399621725) internal successors, (151596), 37010 states have internal predecessors, (151596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37011 states to 37011 states and 151596 transitions. [2025-04-13 22:53:51,388 INFO L79 Accepts]: Start accepts. Automaton has 37011 states and 151596 transitions. Word has length 45 [2025-04-13 22:53:51,388 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:51,389 INFO L485 AbstractCegarLoop]: Abstraction has 37011 states and 151596 transitions. [2025-04-13 22:53:51,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:51,389 INFO L278 IsEmpty]: Start isEmpty. Operand 37011 states and 151596 transitions. [2025-04-13 22:53:51,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:51,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:51,470 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, 1, 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:53:51,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:53:51,470 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 2 more)] === [2025-04-13 22:53:51,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -412262086, now seen corresponding path program 2 times [2025-04-13 22:53:51,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:51,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122797514] [2025-04-13 22:53:51,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:53:51,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:51,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:51,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:51,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:53:51,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:51,586 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:53:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:51,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122797514] [2025-04-13 22:53:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122797514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:51,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:51,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:53:51,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563838246] [2025-04-13 22:53:51,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:51,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:53:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:51,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:53:51,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:53:51,587 INFO L87 Difference]: Start difference. First operand 37011 states and 151596 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:52,768 INFO L93 Difference]: Finished difference Result 49221 states and 202383 transitions. [2025-04-13 22:53:52,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:53:52,768 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:52,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:53,017 INFO L225 Difference]: With dead ends: 49221 [2025-04-13 22:53:53,017 INFO L226 Difference]: Without dead ends: 46266 [2025-04-13 22:53:53,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:53:53,043 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 377 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:53,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 77 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:53:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46266 states. [2025-04-13 22:53:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46266 to 37661. [2025-04-13 22:53:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37661 states, 37660 states have (on average 4.099256505576208) internal successors, (154378), 37660 states have internal predecessors, (154378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37661 states to 37661 states and 154378 transitions. [2025-04-13 22:53:54,379 INFO L79 Accepts]: Start accepts. Automaton has 37661 states and 154378 transitions. Word has length 45 [2025-04-13 22:53:54,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:54,380 INFO L485 AbstractCegarLoop]: Abstraction has 37661 states and 154378 transitions. [2025-04-13 22:53:54,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:54,380 INFO L278 IsEmpty]: Start isEmpty. Operand 37661 states and 154378 transitions. [2025-04-13 22:53:54,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:54,468 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, 1, 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:53:54,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:53:54,468 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 2 more)] === [2025-04-13 22:53:54,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 366139066, now seen corresponding path program 3 times [2025-04-13 22:53:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:54,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088018400] [2025-04-13 22:53:54,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:53:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:54,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:54,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:53:54,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:53:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:54,588 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:53:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:54,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088018400] [2025-04-13 22:53:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088018400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:53:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244110054] [2025-04-13 22:53:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:54,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:53:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:53:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:53:54,589 INFO L87 Difference]: Start difference. First operand 37661 states and 154378 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:56,104 INFO L93 Difference]: Finished difference Result 49855 states and 206170 transitions. [2025-04-13 22:53:56,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:53:56,104 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:56,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:56,384 INFO L225 Difference]: With dead ends: 49855 [2025-04-13 22:53:56,384 INFO L226 Difference]: Without dead ends: 47553 [2025-04-13 22:53:56,402 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:53:56,402 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 423 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:56,403 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 81 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:53:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47553 states. [2025-04-13 22:53:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47553 to 37615. [2025-04-13 22:53:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37615 states, 37614 states have (on average 4.099723507204764) internal successors, (154207), 37614 states have internal predecessors, (154207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37615 states to 37615 states and 154207 transitions. [2025-04-13 22:53:57,370 INFO L79 Accepts]: Start accepts. Automaton has 37615 states and 154207 transitions. Word has length 45 [2025-04-13 22:53:57,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:57,371 INFO L485 AbstractCegarLoop]: Abstraction has 37615 states and 154207 transitions. [2025-04-13 22:53:57,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:57,371 INFO L278 IsEmpty]: Start isEmpty. Operand 37615 states and 154207 transitions. [2025-04-13 22:53:57,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:53:57,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:57,664 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, 1, 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:53:57,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:53:57,665 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 2 more)] === [2025-04-13 22:53:57,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1750709986, now seen corresponding path program 4 times [2025-04-13 22:53:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:57,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952317439] [2025-04-13 22:53:57,665 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:53:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:57,669 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:53:57,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:53:57,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:53:57,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:57,796 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:53:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:57,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952317439] [2025-04-13 22:53:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952317439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:53:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:53:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:53:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302248621] [2025-04-13 22:53:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:53:57,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:53:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:57,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:53:57,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:53:57,797 INFO L87 Difference]: Start difference. First operand 37615 states and 154207 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:53:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:59,637 INFO L93 Difference]: Finished difference Result 58351 states and 243093 transitions. [2025-04-13 22:53:59,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:53:59,637 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:53:59,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:59,990 INFO L225 Difference]: With dead ends: 58351 [2025-04-13 22:53:59,991 INFO L226 Difference]: Without dead ends: 54293 [2025-04-13 22:54:00,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=436, Invalid=2216, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:54:00,029 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 683 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:00,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 134 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:54:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54293 states. [2025-04-13 22:54:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54293 to 38139. [2025-04-13 22:54:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38139 states, 38138 states have (on average 4.09819602496198) internal successors, (156297), 38138 states have internal predecessors, (156297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 156297 transitions. [2025-04-13 22:54:01,426 INFO L79 Accepts]: Start accepts. Automaton has 38139 states and 156297 transitions. Word has length 45 [2025-04-13 22:54:01,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:01,426 INFO L485 AbstractCegarLoop]: Abstraction has 38139 states and 156297 transitions. [2025-04-13 22:54:01,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:01,427 INFO L278 IsEmpty]: Start isEmpty. Operand 38139 states and 156297 transitions. [2025-04-13 22:54:01,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:01,516 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, 1, 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:54:01,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:54:01,516 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 2 more)] === [2025-04-13 22:54:01,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -151032706, now seen corresponding path program 5 times [2025-04-13 22:54:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:01,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524950570] [2025-04-13 22:54:01,517 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:54:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:01,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:01,528 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:01,528 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:54:01,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:01,650 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:54:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:01,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524950570] [2025-04-13 22:54:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524950570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:01,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:01,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:01,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145162679] [2025-04-13 22:54:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:01,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:01,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:01,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:01,651 INFO L87 Difference]: Start difference. First operand 38139 states and 156297 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:03,049 INFO L93 Difference]: Finished difference Result 53212 states and 220728 transitions. [2025-04-13 22:54:03,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:54:03,050 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:03,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:03,347 INFO L225 Difference]: With dead ends: 53212 [2025-04-13 22:54:03,347 INFO L226 Difference]: Without dead ends: 50257 [2025-04-13 22:54:03,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:54:03,375 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 465 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:03,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 91 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2013 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:54:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2025-04-13 22:54:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 38159. [2025-04-13 22:54:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38159 states, 38158 states have (on average 4.098013522721317) internal successors, (156372), 38158 states have internal predecessors, (156372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38159 states to 38159 states and 156372 transitions. [2025-04-13 22:54:04,580 INFO L79 Accepts]: Start accepts. Automaton has 38159 states and 156372 transitions. Word has length 45 [2025-04-13 22:54:04,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:04,580 INFO L485 AbstractCegarLoop]: Abstraction has 38159 states and 156372 transitions. [2025-04-13 22:54:04,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:04,580 INFO L278 IsEmpty]: Start isEmpty. Operand 38159 states and 156372 transitions. [2025-04-13 22:54:04,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:04,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:04,677 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, 1, 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:54:04,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:54:04,678 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 2 more)] === [2025-04-13 22:54:04,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -896441698, now seen corresponding path program 6 times [2025-04-13 22:54:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:04,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845059524] [2025-04-13 22:54:04,678 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:54:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:04,684 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:04,687 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:04,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:54:04,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:04,799 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:54:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:04,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845059524] [2025-04-13 22:54:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845059524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:04,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387595261] [2025-04-13 22:54:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:04,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:04,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:04,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:04,800 INFO L87 Difference]: Start difference. First operand 38159 states and 156372 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:06,188 INFO L93 Difference]: Finished difference Result 50417 states and 209714 transitions. [2025-04-13 22:54:06,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:54:06,188 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:06,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:06,483 INFO L225 Difference]: With dead ends: 50417 [2025-04-13 22:54:06,483 INFO L226 Difference]: Without dead ends: 48090 [2025-04-13 22:54:06,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:54:06,511 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 407 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:06,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 93 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:54:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48090 states. [2025-04-13 22:54:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48090 to 37957. [2025-04-13 22:54:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37957 states, 37956 states have (on average 4.098877647802719) internal successors, (155577), 37956 states have internal predecessors, (155577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37957 states to 37957 states and 155577 transitions. [2025-04-13 22:54:07,744 INFO L79 Accepts]: Start accepts. Automaton has 37957 states and 155577 transitions. Word has length 45 [2025-04-13 22:54:07,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:07,744 INFO L485 AbstractCegarLoop]: Abstraction has 37957 states and 155577 transitions. [2025-04-13 22:54:07,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:07,744 INFO L278 IsEmpty]: Start isEmpty. Operand 37957 states and 155577 transitions. [2025-04-13 22:54:07,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:07,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:07,838 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, 1, 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:54:07,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:54:07,838 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 2 more)] === [2025-04-13 22:54:07,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1576562357, now seen corresponding path program 11 times [2025-04-13 22:54:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:07,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405575000] [2025-04-13 22:54:07,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:54:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:07,844 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:07,847 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:07,847 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:54:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:08,012 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:54:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:08,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405575000] [2025-04-13 22:54:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405575000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:54:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695896868] [2025-04-13 22:54:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:08,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:54:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:54:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:54:08,013 INFO L87 Difference]: Start difference. First operand 37957 states and 155577 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:10,595 INFO L93 Difference]: Finished difference Result 88138 states and 371781 transitions. [2025-04-13 22:54:10,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 22:54:10,596 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:10,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:11,043 INFO L225 Difference]: With dead ends: 88138 [2025-04-13 22:54:11,044 INFO L226 Difference]: Without dead ends: 81035 [2025-04-13 22:54:11,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:54:11,084 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 1034 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:11,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 149 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:54:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81035 states. [2025-04-13 22:54:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81035 to 41563. [2025-04-13 22:54:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41563 states, 41562 states have (on average 4.109571242962321) internal successors, (170802), 41562 states have internal predecessors, (170802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41563 states to 41563 states and 170802 transitions. [2025-04-13 22:54:12,741 INFO L79 Accepts]: Start accepts. Automaton has 41563 states and 170802 transitions. Word has length 45 [2025-04-13 22:54:12,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:12,741 INFO L485 AbstractCegarLoop]: Abstraction has 41563 states and 170802 transitions. [2025-04-13 22:54:12,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:12,741 INFO L278 IsEmpty]: Start isEmpty. Operand 41563 states and 170802 transitions. [2025-04-13 22:54:12,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:12,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:12,846 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, 1, 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:54:12,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:54:12,846 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 2 more)] === [2025-04-13 22:54:12,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1601924093, now seen corresponding path program 12 times [2025-04-13 22:54:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:12,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321776455] [2025-04-13 22:54:12,847 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:54:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:12,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:12,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:12,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:54:12,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:13,291 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:54:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:13,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321776455] [2025-04-13 22:54:13,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321776455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:13,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:54:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983622422] [2025-04-13 22:54:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:13,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:54:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:13,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:54:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:54:13,297 INFO L87 Difference]: Start difference. First operand 41563 states and 170802 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:15,267 INFO L93 Difference]: Finished difference Result 78650 states and 330506 transitions. [2025-04-13 22:54:15,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 22:54:15,268 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:15,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:15,746 INFO L225 Difference]: With dead ends: 78650 [2025-04-13 22:54:15,746 INFO L226 Difference]: Without dead ends: 70942 [2025-04-13 22:54:15,791 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=455, Invalid=2301, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:54:15,791 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 805 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:15,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 126 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:54:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70942 states. [2025-04-13 22:54:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70942 to 42131. [2025-04-13 22:54:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42131 states, 42130 states have (on average 4.095371469261809) internal successors, (172538), 42130 states have internal predecessors, (172538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42131 states to 42131 states and 172538 transitions. [2025-04-13 22:54:17,295 INFO L79 Accepts]: Start accepts. Automaton has 42131 states and 172538 transitions. Word has length 45 [2025-04-13 22:54:17,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:17,296 INFO L485 AbstractCegarLoop]: Abstraction has 42131 states and 172538 transitions. [2025-04-13 22:54:17,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:17,296 INFO L278 IsEmpty]: Start isEmpty. Operand 42131 states and 172538 transitions. [2025-04-13 22:54:17,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:17,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:17,387 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, 1, 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:54:17,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:54:17,388 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 2 more)] === [2025-04-13 22:54:17,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash 348978916, now seen corresponding path program 7 times [2025-04-13 22:54:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:17,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319538150] [2025-04-13 22:54:17,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:54:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:17,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:54:17,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:17,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:54:17,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:17,488 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:54:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:17,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319538150] [2025-04-13 22:54:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319538150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:17,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:17,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807635947] [2025-04-13 22:54:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:17,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:17,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:17,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:17,489 INFO L87 Difference]: Start difference. First operand 42131 states and 172538 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:18,885 INFO L93 Difference]: Finished difference Result 52244 states and 214721 transitions. [2025-04-13 22:54:18,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:54:18,886 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:18,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:19,453 INFO L225 Difference]: With dead ends: 52244 [2025-04-13 22:54:19,453 INFO L226 Difference]: Without dead ends: 49767 [2025-04-13 22:54:19,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:54:19,471 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 385 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:19,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 68 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:54:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49767 states. [2025-04-13 22:54:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49767 to 45231. [2025-04-13 22:54:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45231 states, 45230 states have (on average 4.094826442626576) internal successors, (185209), 45230 states have internal predecessors, (185209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45231 states to 45231 states and 185209 transitions. [2025-04-13 22:54:20,881 INFO L79 Accepts]: Start accepts. Automaton has 45231 states and 185209 transitions. Word has length 45 [2025-04-13 22:54:20,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:20,882 INFO L485 AbstractCegarLoop]: Abstraction has 45231 states and 185209 transitions. [2025-04-13 22:54:20,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:20,882 INFO L278 IsEmpty]: Start isEmpty. Operand 45231 states and 185209 transitions. [2025-04-13 22:54:20,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:20,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:20,981 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, 1, 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:54:20,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:54:20,982 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 2 more)] === [2025-04-13 22:54:20,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1742249066, now seen corresponding path program 8 times [2025-04-13 22:54:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:20,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636387294] [2025-04-13 22:54:20,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:54:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:20,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:20,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:20,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:54:20,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:21,128 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:54:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:21,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636387294] [2025-04-13 22:54:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636387294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:21,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:21,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816253311] [2025-04-13 22:54:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:21,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:21,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:21,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:21,129 INFO L87 Difference]: Start difference. First operand 45231 states and 185209 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:22,304 INFO L93 Difference]: Finished difference Result 55022 states and 226373 transitions. [2025-04-13 22:54:22,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:54:22,304 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:22,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:22,691 INFO L225 Difference]: With dead ends: 55022 [2025-04-13 22:54:22,692 INFO L226 Difference]: Without dead ends: 52067 [2025-04-13 22:54:22,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:54:22,726 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 338 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:22,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 65 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:54:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52067 states. [2025-04-13 22:54:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52067 to 45317. [2025-04-13 22:54:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45317 states, 45316 states have (on average 4.094138935475328) internal successors, (185530), 45316 states have internal predecessors, (185530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45317 states to 45317 states and 185530 transitions. [2025-04-13 22:54:23,989 INFO L79 Accepts]: Start accepts. Automaton has 45317 states and 185530 transitions. Word has length 45 [2025-04-13 22:54:23,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:23,990 INFO L485 AbstractCegarLoop]: Abstraction has 45317 states and 185530 transitions. [2025-04-13 22:54:23,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:23,990 INFO L278 IsEmpty]: Start isEmpty. Operand 45317 states and 185530 transitions. [2025-04-13 22:54:24,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:24,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:24,090 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, 1, 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:54:24,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:54:24,090 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 2 more)] === [2025-04-13 22:54:24,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1011172422, now seen corresponding path program 9 times [2025-04-13 22:54:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:24,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616759744] [2025-04-13 22:54:24,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:54:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:24,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:24,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:24,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:54:24,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:24,415 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:54:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:24,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616759744] [2025-04-13 22:54:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616759744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562691413] [2025-04-13 22:54:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:24,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:24,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:24,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:24,417 INFO L87 Difference]: Start difference. First operand 45317 states and 185530 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:25,763 INFO L93 Difference]: Finished difference Result 55079 states and 228436 transitions. [2025-04-13 22:54:25,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:54:25,763 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:25,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:26,132 INFO L225 Difference]: With dead ends: 55079 [2025-04-13 22:54:26,132 INFO L226 Difference]: Without dead ends: 52777 [2025-04-13 22:54:26,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:54:26,153 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 329 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:26,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 77 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:54:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52777 states. [2025-04-13 22:54:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52777 to 45271. [2025-04-13 22:54:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45271 states, 45270 states have (on average 4.094521758338856) internal successors, (185359), 45270 states have internal predecessors, (185359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45271 states to 45271 states and 185359 transitions. [2025-04-13 22:54:27,628 INFO L79 Accepts]: Start accepts. Automaton has 45271 states and 185359 transitions. Word has length 45 [2025-04-13 22:54:27,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:27,628 INFO L485 AbstractCegarLoop]: Abstraction has 45271 states and 185359 transitions. [2025-04-13 22:54:27,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:27,628 INFO L278 IsEmpty]: Start isEmpty. Operand 45271 states and 185359 transitions. [2025-04-13 22:54:27,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:27,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:27,728 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, 1, 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:54:27,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 22:54:27,728 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 2 more)] === [2025-04-13 22:54:27,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash -505307340, now seen corresponding path program 10 times [2025-04-13 22:54:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:27,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621065818] [2025-04-13 22:54:27,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:54:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:27,733 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:27,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:27,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:54:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:27,865 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:54:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:27,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621065818] [2025-04-13 22:54:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621065818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:54:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875414943] [2025-04-13 22:54:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:27,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:54:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:54:27,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:54:27,866 INFO L87 Difference]: Start difference. First operand 45271 states and 185359 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:29,882 INFO L93 Difference]: Finished difference Result 90246 states and 390456 transitions. [2025-04-13 22:54:29,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:54:29,882 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:29,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:30,458 INFO L225 Difference]: With dead ends: 90246 [2025-04-13 22:54:30,459 INFO L226 Difference]: Without dead ends: 88042 [2025-04-13 22:54:30,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:54:30,491 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 476 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:30,491 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 92 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:54:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88042 states. [2025-04-13 22:54:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88042 to 49758. [2025-04-13 22:54:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49758 states, 49757 states have (on average 4.108788713145889) internal successors, (204441), 49757 states have internal predecessors, (204441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49758 states to 49758 states and 204441 transitions. [2025-04-13 22:54:32,562 INFO L79 Accepts]: Start accepts. Automaton has 49758 states and 204441 transitions. Word has length 45 [2025-04-13 22:54:32,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:32,562 INFO L485 AbstractCegarLoop]: Abstraction has 49758 states and 204441 transitions. [2025-04-13 22:54:32,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:32,562 INFO L278 IsEmpty]: Start isEmpty. Operand 49758 states and 204441 transitions. [2025-04-13 22:54:32,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:32,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:32,690 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, 1, 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:54:32,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:54:32,690 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 2 more)] === [2025-04-13 22:54:32,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1972988958, now seen corresponding path program 11 times [2025-04-13 22:54:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:32,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164403451] [2025-04-13 22:54:32,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:54:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:32,696 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:32,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:32,701 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:54:32,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:32,800 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:54:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:32,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164403451] [2025-04-13 22:54:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164403451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:32,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438119772] [2025-04-13 22:54:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:32,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:32,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:32,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:32,802 INFO L87 Difference]: Start difference. First operand 49758 states and 204441 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:34,041 INFO L93 Difference]: Finished difference Result 59554 states and 246444 transitions. [2025-04-13 22:54:34,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:54:34,041 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:34,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:34,379 INFO L225 Difference]: With dead ends: 59554 [2025-04-13 22:54:34,379 INFO L226 Difference]: Without dead ends: 57052 [2025-04-13 22:54:34,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:54:34,409 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 372 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:34,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 75 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:54:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57052 states. [2025-04-13 22:54:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57052 to 48532. [2025-04-13 22:54:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48532 states, 48531 states have (on average 4.113102965115081) internal successors, (199613), 48531 states have internal predecessors, (199613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48532 states to 48532 states and 199613 transitions. [2025-04-13 22:54:35,813 INFO L79 Accepts]: Start accepts. Automaton has 48532 states and 199613 transitions. Word has length 45 [2025-04-13 22:54:35,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:35,813 INFO L485 AbstractCegarLoop]: Abstraction has 48532 states and 199613 transitions. [2025-04-13 22:54:35,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:35,813 INFO L278 IsEmpty]: Start isEmpty. Operand 48532 states and 199613 transitions. [2025-04-13 22:54:35,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:35,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:35,919 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, 1, 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:54:35,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 22:54:35,919 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 2 more)] === [2025-04-13 22:54:35,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 257537916, now seen corresponding path program 12 times [2025-04-13 22:54:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:35,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975343951] [2025-04-13 22:54:35,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:54:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:35,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:35,926 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:35,926 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:54:35,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:36,016 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:54:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:36,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975343951] [2025-04-13 22:54:36,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975343951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:36,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:36,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:36,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699119629] [2025-04-13 22:54:36,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:36,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:36,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:36,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:36,017 INFO L87 Difference]: Start difference. First operand 48532 states and 199613 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:37,600 INFO L93 Difference]: Finished difference Result 60465 states and 249875 transitions. [2025-04-13 22:54:37,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:54:37,600 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:37,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:38,014 INFO L225 Difference]: With dead ends: 60465 [2025-04-13 22:54:38,014 INFO L226 Difference]: Without dead ends: 57510 [2025-04-13 22:54:38,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:54:38,034 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 419 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:38,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 64 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:54:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57510 states. [2025-04-13 22:54:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57510 to 49070. [2025-04-13 22:54:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49070 states, 49069 states have (on average 4.110538221687827) internal successors, (201700), 49069 states have internal predecessors, (201700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49070 states to 49070 states and 201700 transitions. [2025-04-13 22:54:39,417 INFO L79 Accepts]: Start accepts. Automaton has 49070 states and 201700 transitions. Word has length 45 [2025-04-13 22:54:39,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:39,417 INFO L485 AbstractCegarLoop]: Abstraction has 49070 states and 201700 transitions. [2025-04-13 22:54:39,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:39,417 INFO L278 IsEmpty]: Start isEmpty. Operand 49070 states and 201700 transitions. [2025-04-13 22:54:39,522 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:39,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:39,522 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, 1, 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:54:39,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:54:39,522 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 2 more)] === [2025-04-13 22:54:39,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1293680590, now seen corresponding path program 13 times [2025-04-13 22:54:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:39,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935916061] [2025-04-13 22:54:39,523 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:54:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:54:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:54:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:54:39,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:39,829 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:54:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:39,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935916061] [2025-04-13 22:54:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935916061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:54:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413210627] [2025-04-13 22:54:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:39,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:54:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:39,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:54:39,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:54:39,830 INFO L87 Difference]: Start difference. First operand 49070 states and 201700 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:41,131 INFO L93 Difference]: Finished difference Result 71156 states and 300675 transitions. [2025-04-13 22:54:41,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:54:41,131 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:41,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:54:41,573 INFO L225 Difference]: With dead ends: 71156 [2025-04-13 22:54:41,573 INFO L226 Difference]: Without dead ends: 68611 [2025-04-13 22:54:41,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:54:41,600 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 255 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:54:41,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 123 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:54:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68611 states. [2025-04-13 22:54:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68611 to 52641. [2025-04-13 22:54:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52641 states, 52640 states have (on average 4.124088145896657) internal successors, (217092), 52640 states have internal predecessors, (217092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52641 states to 52641 states and 217092 transitions. [2025-04-13 22:54:43,196 INFO L79 Accepts]: Start accepts. Automaton has 52641 states and 217092 transitions. Word has length 45 [2025-04-13 22:54:43,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:54:43,196 INFO L485 AbstractCegarLoop]: Abstraction has 52641 states and 217092 transitions. [2025-04-13 22:54:43,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:43,197 INFO L278 IsEmpty]: Start isEmpty. Operand 52641 states and 217092 transitions. [2025-04-13 22:54:43,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:54:43,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:54:43,328 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, 1, 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:54:43,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:54:43,328 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 2 more)] === [2025-04-13 22:54:43,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:54:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1211034176, now seen corresponding path program 14 times [2025-04-13 22:54:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:54:43,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426697789] [2025-04-13 22:54:43,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:54:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:54:43,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:54:43,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 22:54:43,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:54:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:54:43,683 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:54:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:54:43,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426697789] [2025-04-13 22:54:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426697789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:54:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:54:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:54:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45454786] [2025-04-13 22:54:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:54:43,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:54:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:54:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:54:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:54:43,684 INFO L87 Difference]: Start difference. First operand 52641 states and 217092 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:54:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:54:45,133 INFO L93 Difference]: Finished difference Result 63696 states and 264918 transitions. [2025-04-13 22:54:45,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:54:45,133 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 22:54:45,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted.