/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:55:15,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:55:15,223 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:55:15,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:55:15,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:55:15,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:55:15,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:55:15,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:55:15,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:55:15,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:55:15,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:55:15,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:55:15,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:55:15,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:55:15,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:55:15,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:55:15,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:55:15,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:55:15,243 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:55:15,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:55:15,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:55:15,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:55:15,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:55:15,439 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:55:15,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2025-04-13 22:55:16,737 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7261ac15a/d4ab3bec667b4ace9b34500a52885160/FLAG339e153ec [2025-04-13 22:55:16,964 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:55:16,964 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2025-04-13 22:55:16,973 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7261ac15a/d4ab3bec667b4ace9b34500a52885160/FLAG339e153ec [2025-04-13 22:55:17,738 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7261ac15a/d4ab3bec667b4ace9b34500a52885160 [2025-04-13 22:55:17,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:55:17,741 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:55:17,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:55:17,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:55:17,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:55:17,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:55:17" (1/1) ... [2025-04-13 22:55:17,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ecaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:17, skipping insertion in model container [2025-04-13 22:55:17,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:55:17" (1/1) ... [2025-04-13 22:55:17,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:55:17,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2025-04-13 22:55:17,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:55:17,987 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:55:18,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2025-04-13 22:55:18,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:55:18,054 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:55:18,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18 WrapperNode [2025-04-13 22:55:18,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:55:18,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:55:18,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:55:18,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:55:18,060 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:55:18" (1/1) ... [2025-04-13 22:55:18,075 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:55:18" (1/1) ... [2025-04-13 22:55:18,103 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 274 [2025-04-13 22:55:18,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:55:18,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:55:18,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:55:18,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:55:18,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,125 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:55:18,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:55:18,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:55:18,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:55:18,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:55:18,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (1/1) ... [2025-04-13 22:55:18,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:55:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:18,162 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:55:18,163 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:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:55:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:55:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:55:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:55:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:55:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:55:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:55:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:55:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:55:18,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:55:18,180 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:55:18,277 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:55:18,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:55:18,637 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:55:18,637 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:55:18,637 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:55:18,944 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:55:18,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:55:18 BoogieIcfgContainer [2025-04-13 22:55:18,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:55:18,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:55:18,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:55:18,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:55:18,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:55:17" (1/3) ... [2025-04-13 22:55:18,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5eaf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:55:18, skipping insertion in model container [2025-04-13 22:55:18,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:55:18" (2/3) ... [2025-04-13 22:55:18,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5eaf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:55:18, skipping insertion in model container [2025-04-13 22:55:18,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:55:18" (3/3) ... [2025-04-13 22:55:18,951 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-04-13 22:55:18,963 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:55:18,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 42 locations, 43 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:55:18,965 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:55:19,019 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:55:19,044 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 47 transitions, 122 flow [2025-04-13 22:55:19,234 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have 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:55:19,257 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:55:19,265 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;@57a9fc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:55:19,265 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:55:19,278 INFO L278 IsEmpty]: Start isEmpty. Operand has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have 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:55:19,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:55:19,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:19,318 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] [2025-04-13 22:55:19,318 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:55:19,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash 139924793, now seen corresponding path program 1 times [2025-04-13 22:55:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:19,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384760655] [2025-04-13 22:55:19,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:19,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:55:19,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:55:19,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:19,593 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:55:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:19,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384760655] [2025-04-13 22:55:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384760655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:55:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422964165] [2025-04-13 22:55:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:19,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:19,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:19,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:19,644 INFO L87 Difference]: Start difference. First operand has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:55:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:19,875 INFO L93 Difference]: Finished difference Result 5254 states and 22871 transitions. [2025-04-13 22:55:19,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:19,877 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:55:19,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:19,978 INFO L225 Difference]: With dead ends: 5254 [2025-04-13 22:55:19,978 INFO L226 Difference]: Without dead ends: 5172 [2025-04-13 22:55:19,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:19,987 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:19,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2025-04-13 22:55:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4388. [2025-04-13 22:55:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4388 states, 4387 states have (on average 4.346250284932756) internal successors, (19067), 4387 states have internal predecessors, (19067), 0 states have call successors, (0), 0 states have 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:55:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 19067 transitions. [2025-04-13 22:55:20,282 INFO L79 Accepts]: Start accepts. Automaton has 4388 states and 19067 transitions. Word has length 28 [2025-04-13 22:55:20,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:20,283 INFO L485 AbstractCegarLoop]: Abstraction has 4388 states and 19067 transitions. [2025-04-13 22:55:20,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:55:20,284 INFO L278 IsEmpty]: Start isEmpty. Operand 4388 states and 19067 transitions. [2025-04-13 22:55:20,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:55:20,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:20,302 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] [2025-04-13 22:55:20,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:55:20,303 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:55:20,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1697250949, now seen corresponding path program 1 times [2025-04-13 22:55:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:20,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117183867] [2025-04-13 22:55:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:20,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:55:20,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:55:20,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:20,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:20,494 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:55:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:20,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117183867] [2025-04-13 22:55:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117183867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:55:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931484483] [2025-04-13 22:55:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:20,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:20,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:20,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:20,496 INFO L87 Difference]: Start difference. First operand 4388 states and 19067 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:20,794 INFO L93 Difference]: Finished difference Result 8090 states and 35138 transitions. [2025-04-13 22:55:20,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:20,794 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:55:20,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:20,840 INFO L225 Difference]: With dead ends: 8090 [2025-04-13 22:55:20,840 INFO L226 Difference]: Without dead ends: 5715 [2025-04-13 22:55:20,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:20,849 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:20,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-04-13 22:55:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5369. [2025-04-13 22:55:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 5368 states have (on average 4.311475409836065) internal successors, (23144), 5368 states have internal predecessors, (23144), 0 states have call successors, (0), 0 states have 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:55:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 23144 transitions. [2025-04-13 22:55:21,098 INFO L79 Accepts]: Start accepts. Automaton has 5369 states and 23144 transitions. Word has length 31 [2025-04-13 22:55:21,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:21,099 INFO L485 AbstractCegarLoop]: Abstraction has 5369 states and 23144 transitions. [2025-04-13 22:55:21,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:21,099 INFO L278 IsEmpty]: Start isEmpty. Operand 5369 states and 23144 transitions. [2025-04-13 22:55:21,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:55:21,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:21,114 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] [2025-04-13 22:55:21,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:55:21,115 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:55:21,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1949630059, now seen corresponding path program 1 times [2025-04-13 22:55:21,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:21,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073852624] [2025-04-13 22:55:21,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:21,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:55:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:55:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:21,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073852624] [2025-04-13 22:55:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073852624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:21,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:55:21,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539697702] [2025-04-13 22:55:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:21,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:21,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:21,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:21,234 INFO L87 Difference]: Start difference. First operand 5369 states and 23144 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:21,523 INFO L93 Difference]: Finished difference Result 9435 states and 40679 transitions. [2025-04-13 22:55:21,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:21,523 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:55:21,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:21,594 INFO L225 Difference]: With dead ends: 9435 [2025-04-13 22:55:21,594 INFO L226 Difference]: Without dead ends: 6807 [2025-04-13 22:55:21,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:21,608 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:21,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2025-04-13 22:55:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 6512. [2025-04-13 22:55:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 6511 states have (on average 4.254492397481186) internal successors, (27701), 6511 states have internal predecessors, (27701), 0 states have call successors, (0), 0 states have 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:55:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 27701 transitions. [2025-04-13 22:55:21,904 INFO L79 Accepts]: Start accepts. Automaton has 6512 states and 27701 transitions. Word has length 31 [2025-04-13 22:55:21,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:21,904 INFO L485 AbstractCegarLoop]: Abstraction has 6512 states and 27701 transitions. [2025-04-13 22:55:21,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:21,904 INFO L278 IsEmpty]: Start isEmpty. Operand 6512 states and 27701 transitions. [2025-04-13 22:55:21,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:55:21,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:21,926 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] [2025-04-13 22:55:21,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:55:21,926 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:55:21,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -62916685, now seen corresponding path program 1 times [2025-04-13 22:55:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:21,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832377282] [2025-04-13 22:55:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:21,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:55:21,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:55:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:21,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:22,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832377282] [2025-04-13 22:55:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832377282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:22,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:55:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335084815] [2025-04-13 22:55:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:22,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:55:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:22,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:55:22,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:55:22,111 INFO L87 Difference]: Start difference. First operand 6512 states and 27701 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:22,569 INFO L93 Difference]: Finished difference Result 13317 states and 56379 transitions. [2025-04-13 22:55:22,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:55:22,569 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:55:22,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:22,620 INFO L225 Difference]: With dead ends: 13317 [2025-04-13 22:55:22,620 INFO L226 Difference]: Without dead ends: 8500 [2025-04-13 22:55:22,631 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:55:22,632 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:22,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8500 states. [2025-04-13 22:55:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8500 to 7982. [2025-04-13 22:55:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7982 states, 7981 states have (on average 4.212379401077559) internal successors, (33619), 7981 states have internal predecessors, (33619), 0 states have call successors, (0), 0 states have 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:55:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7982 states to 7982 states and 33619 transitions. [2025-04-13 22:55:22,974 INFO L79 Accepts]: Start accepts. Automaton has 7982 states and 33619 transitions. Word has length 34 [2025-04-13 22:55:22,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:22,974 INFO L485 AbstractCegarLoop]: Abstraction has 7982 states and 33619 transitions. [2025-04-13 22:55:22,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:22,975 INFO L278 IsEmpty]: Start isEmpty. Operand 7982 states and 33619 transitions. [2025-04-13 22:55:22,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:55:22,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:22,996 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] [2025-04-13 22:55:22,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:55:22,997 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:55:22,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1146953389, now seen corresponding path program 1 times [2025-04-13 22:55:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:22,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246723626] [2025-04-13 22:55:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:55:23,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:55:23,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:23,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:23,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246723626] [2025-04-13 22:55:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246723626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:55:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866646268] [2025-04-13 22:55:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:23,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:55:23,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:23,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:55:23,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:55:23,127 INFO L87 Difference]: Start difference. First operand 7982 states and 33619 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:23,486 INFO L93 Difference]: Finished difference Result 16335 states and 68439 transitions. [2025-04-13 22:55:23,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:55:23,487 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:55:23,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:23,538 INFO L225 Difference]: With dead ends: 16335 [2025-04-13 22:55:23,538 INFO L226 Difference]: Without dead ends: 9935 [2025-04-13 22:55:23,552 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:55:23,555 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:23,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 24 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2025-04-13 22:55:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 9288. [2025-04-13 22:55:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9288 states, 9287 states have (on average 4.18789706040702) internal successors, (38893), 9287 states have internal predecessors, (38893), 0 states have call successors, (0), 0 states have 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:55:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 38893 transitions. [2025-04-13 22:55:23,912 INFO L79 Accepts]: Start accepts. Automaton has 9288 states and 38893 transitions. Word has length 34 [2025-04-13 22:55:23,913 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:23,913 INFO L485 AbstractCegarLoop]: Abstraction has 9288 states and 38893 transitions. [2025-04-13 22:55:23,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:23,914 INFO L278 IsEmpty]: Start isEmpty. Operand 9288 states and 38893 transitions. [2025-04-13 22:55:23,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:23,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:23,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] [2025-04-13 22:55:23,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:55:23,936 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:55:23,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:23,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1699414206, now seen corresponding path program 1 times [2025-04-13 22:55:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:23,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649692004] [2025-04-13 22:55:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:23,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:23,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:23,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:23,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:24,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649692004] [2025-04-13 22:55:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649692004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888156802] [2025-04-13 22:55:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:24,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:24,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:24,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:24,382 INFO L87 Difference]: Start difference. First operand 9288 states and 38893 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:25,054 INFO L93 Difference]: Finished difference Result 10115 states and 41644 transitions. [2025-04-13 22:55:25,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:55:25,054 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:25,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:25,111 INFO L225 Difference]: With dead ends: 10115 [2025-04-13 22:55:25,111 INFO L226 Difference]: Without dead ends: 9712 [2025-04-13 22:55:25,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:25,117 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:25,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 76 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9712 states. [2025-04-13 22:55:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9712 to 9384. [2025-04-13 22:55:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9384 states, 9383 states have (on average 4.17744857721411) internal successors, (39197), 9383 states have internal predecessors, (39197), 0 states have call successors, (0), 0 states have 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:55:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9384 states to 9384 states and 39197 transitions. [2025-04-13 22:55:25,622 INFO L79 Accepts]: Start accepts. Automaton has 9384 states and 39197 transitions. Word has length 35 [2025-04-13 22:55:25,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:25,623 INFO L485 AbstractCegarLoop]: Abstraction has 9384 states and 39197 transitions. [2025-04-13 22:55:25,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:25,623 INFO L278 IsEmpty]: Start isEmpty. Operand 9384 states and 39197 transitions. [2025-04-13 22:55:25,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:25,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:25,645 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] [2025-04-13 22:55:25,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:55:25,645 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:55:25,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash -612800406, now seen corresponding path program 2 times [2025-04-13 22:55:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:25,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979308061] [2025-04-13 22:55:25,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:25,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:25,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:25,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:26,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979308061] [2025-04-13 22:55:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979308061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955983182] [2025-04-13 22:55:26,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:26,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:26,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:26,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:26,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:26,015 INFO L87 Difference]: Start difference. First operand 9384 states and 39197 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:26,504 INFO L93 Difference]: Finished difference Result 9902 states and 40774 transitions. [2025-04-13 22:55:26,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:55:26,507 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:26,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:26,563 INFO L225 Difference]: With dead ends: 9902 [2025-04-13 22:55:26,563 INFO L226 Difference]: Without dead ends: 9656 [2025-04-13 22:55:26,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:55:26,569 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 59 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:26,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 64 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9656 states. [2025-04-13 22:55:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9656 to 9456. [2025-04-13 22:55:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9456 states, 9455 states have (on average 4.16679005817028) internal successors, (39397), 9455 states have internal predecessors, (39397), 0 states have call successors, (0), 0 states have 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:55:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 39397 transitions. [2025-04-13 22:55:26,977 INFO L79 Accepts]: Start accepts. Automaton has 9456 states and 39397 transitions. Word has length 35 [2025-04-13 22:55:26,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:26,978 INFO L485 AbstractCegarLoop]: Abstraction has 9456 states and 39397 transitions. [2025-04-13 22:55:26,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:26,978 INFO L278 IsEmpty]: Start isEmpty. Operand 9456 states and 39397 transitions. [2025-04-13 22:55:26,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:26,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:26,997 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] [2025-04-13 22:55:26,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:55:26,997 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:55:26,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1538942622, now seen corresponding path program 3 times [2025-04-13 22:55:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:26,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166263161] [2025-04-13 22:55:26,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:27,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:27,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:27,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:27,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:27,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166263161] [2025-04-13 22:55:27,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166263161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:27,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:27,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:27,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892932176] [2025-04-13 22:55:27,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:27,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:27,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:27,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:27,307 INFO L87 Difference]: Start difference. First operand 9456 states and 39397 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:27,798 INFO L93 Difference]: Finished difference Result 9902 states and 40784 transitions. [2025-04-13 22:55:27,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:55:27,799 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:27,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:27,841 INFO L225 Difference]: With dead ends: 9902 [2025-04-13 22:55:27,841 INFO L226 Difference]: Without dead ends: 9616 [2025-04-13 22:55:27,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:55:27,846 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:27,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 68 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2025-04-13 22:55:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9416. [2025-04-13 22:55:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9416 states, 9415 states have (on average 4.170897503983006) internal successors, (39269), 9415 states have internal predecessors, (39269), 0 states have call successors, (0), 0 states have 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:55:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9416 states to 9416 states and 39269 transitions. [2025-04-13 22:55:28,177 INFO L79 Accepts]: Start accepts. Automaton has 9416 states and 39269 transitions. Word has length 35 [2025-04-13 22:55:28,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:28,178 INFO L485 AbstractCegarLoop]: Abstraction has 9416 states and 39269 transitions. [2025-04-13 22:55:28,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:28,178 INFO L278 IsEmpty]: Start isEmpty. Operand 9416 states and 39269 transitions. [2025-04-13 22:55:28,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:28,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:28,196 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] [2025-04-13 22:55:28,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:55:28,196 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:55:28,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2127195926, now seen corresponding path program 4 times [2025-04-13 22:55:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:28,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464521828] [2025-04-13 22:55:28,196 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:28,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:28,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:28,218 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:28,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464521828] [2025-04-13 22:55:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464521828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:28,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175091567] [2025-04-13 22:55:28,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:28,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:28,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:28,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:55:28,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:55:28,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:28,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:28,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:28,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:55:28,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:28,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:55:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175091567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:55:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-13 22:55:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394008036] [2025-04-13 22:55:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:28,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:28,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:28,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:55:28,640 INFO L87 Difference]: Start difference. First operand 9416 states and 39269 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:29,625 INFO L93 Difference]: Finished difference Result 11407 states and 46724 transitions. [2025-04-13 22:55:29,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:55:29,626 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:29,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:29,677 INFO L225 Difference]: With dead ends: 11407 [2025-04-13 22:55:29,677 INFO L226 Difference]: Without dead ends: 10881 [2025-04-13 22:55:29,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:55:29,684 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 120 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:29,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 63 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10881 states. [2025-04-13 22:55:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10881 to 9514. [2025-04-13 22:55:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9514 states, 9513 states have (on average 4.152843477346789) internal successors, (39506), 9513 states have internal predecessors, (39506), 0 states have call successors, (0), 0 states have 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:55:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 39506 transitions. [2025-04-13 22:55:30,188 INFO L79 Accepts]: Start accepts. Automaton has 9514 states and 39506 transitions. Word has length 35 [2025-04-13 22:55:30,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:30,188 INFO L485 AbstractCegarLoop]: Abstraction has 9514 states and 39506 transitions. [2025-04-13 22:55:30,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:30,188 INFO L278 IsEmpty]: Start isEmpty. Operand 9514 states and 39506 transitions. [2025-04-13 22:55:30,204 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:30,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:30,205 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] [2025-04-13 22:55:30,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:55:30,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:30,405 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:55:30,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1773842602, now seen corresponding path program 5 times [2025-04-13 22:55:30,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:30,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202196264] [2025-04-13 22:55:30,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:55:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:30,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:30,423 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:30,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:30,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202196264] [2025-04-13 22:55:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202196264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985232670] [2025-04-13 22:55:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:30,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:30,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:30,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:30,689 INFO L87 Difference]: Start difference. First operand 9514 states and 39506 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:31,416 INFO L93 Difference]: Finished difference Result 12165 states and 49554 transitions. [2025-04-13 22:55:31,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:55:31,417 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:31,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:31,459 INFO L225 Difference]: With dead ends: 12165 [2025-04-13 22:55:31,459 INFO L226 Difference]: Without dead ends: 11339 [2025-04-13 22:55:31,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:31,464 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 128 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:31,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 47 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2025-04-13 22:55:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 10106. [2025-04-13 22:55:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10106 states, 10105 states have (on average 4.180504700643246) internal successors, (42244), 10105 states have internal predecessors, (42244), 0 states have call successors, (0), 0 states have 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:55:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10106 states to 10106 states and 42244 transitions. [2025-04-13 22:55:32,035 INFO L79 Accepts]: Start accepts. Automaton has 10106 states and 42244 transitions. Word has length 35 [2025-04-13 22:55:32,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:32,035 INFO L485 AbstractCegarLoop]: Abstraction has 10106 states and 42244 transitions. [2025-04-13 22:55:32,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:32,035 INFO L278 IsEmpty]: Start isEmpty. Operand 10106 states and 42244 transitions. [2025-04-13 22:55:32,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:32,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:32,058 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] [2025-04-13 22:55:32,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:55:32,059 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:55:32,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1139853746, now seen corresponding path program 6 times [2025-04-13 22:55:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:32,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333412858] [2025-04-13 22:55:32,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:55:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:32,066 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:32,075 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:32,076 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:55:32,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:32,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:32,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333412858] [2025-04-13 22:55:32,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333412858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:32,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:32,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972806356] [2025-04-13 22:55:32,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:32,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:32,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:32,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:32,311 INFO L87 Difference]: Start difference. First operand 10106 states and 42244 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:33,312 INFO L93 Difference]: Finished difference Result 13366 states and 55215 transitions. [2025-04-13 22:55:33,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:55:33,312 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:33,313 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:33,368 INFO L225 Difference]: With dead ends: 13366 [2025-04-13 22:55:33,368 INFO L226 Difference]: Without dead ends: 12908 [2025-04-13 22:55:33,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:55:33,375 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:33,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 96 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12908 states. [2025-04-13 22:55:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12908 to 10310. [2025-04-13 22:55:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10310 states, 10309 states have (on average 4.181685905519449) internal successors, (43109), 10309 states have internal predecessors, (43109), 0 states have call successors, (0), 0 states have 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:55:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10310 states to 10310 states and 43109 transitions. [2025-04-13 22:55:34,009 INFO L79 Accepts]: Start accepts. Automaton has 10310 states and 43109 transitions. Word has length 35 [2025-04-13 22:55:34,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:34,010 INFO L485 AbstractCegarLoop]: Abstraction has 10310 states and 43109 transitions. [2025-04-13 22:55:34,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:34,010 INFO L278 IsEmpty]: Start isEmpty. Operand 10310 states and 43109 transitions. [2025-04-13 22:55:34,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:34,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:34,028 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] [2025-04-13 22:55:34,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:55:34,029 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:55:34,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2063352286, now seen corresponding path program 7 times [2025-04-13 22:55:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:34,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820628119] [2025-04-13 22:55:34,029 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:34,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:34,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:34,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:34,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:34,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820628119] [2025-04-13 22:55:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820628119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:34,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565917350] [2025-04-13 22:55:34,287 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:34,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:34,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:34,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:55:34,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:55:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:34,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:34,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:34,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:34,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:55:34,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:34,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:55:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565917350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:34,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:55:34,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-04-13 22:55:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36025420] [2025-04-13 22:55:34,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:34,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:34,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:34,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:34,520 INFO L87 Difference]: Start difference. First operand 10310 states and 43109 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:35,861 INFO L93 Difference]: Finished difference Result 15012 states and 61167 transitions. [2025-04-13 22:55:35,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:55:35,862 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:35,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:35,925 INFO L225 Difference]: With dead ends: 15012 [2025-04-13 22:55:35,925 INFO L226 Difference]: Without dead ends: 14412 [2025-04-13 22:55:35,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:55:35,933 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 204 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:35,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 72 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:55:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14412 states. [2025-04-13 22:55:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14412 to 10082. [2025-04-13 22:55:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10082 states, 10081 states have (on average 4.18996131336177) internal successors, (42239), 10081 states have internal predecessors, (42239), 0 states have call successors, (0), 0 states have 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:55:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 42239 transitions. [2025-04-13 22:55:36,567 INFO L79 Accepts]: Start accepts. Automaton has 10082 states and 42239 transitions. Word has length 35 [2025-04-13 22:55:36,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:36,568 INFO L485 AbstractCegarLoop]: Abstraction has 10082 states and 42239 transitions. [2025-04-13 22:55:36,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:36,568 INFO L278 IsEmpty]: Start isEmpty. Operand 10082 states and 42239 transitions. [2025-04-13 22:55:36,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:36,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:36,588 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] [2025-04-13 22:55:36,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:55:36,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 22:55:36,789 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:55:36,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1604831332, now seen corresponding path program 8 times [2025-04-13 22:55:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:36,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800293983] [2025-04-13 22:55:36,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:36,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:36,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 22:55:36,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:36,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:37,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:55:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:37,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800293983] [2025-04-13 22:55:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800293983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:37,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544546656] [2025-04-13 22:55:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:37,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:37,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:37,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:37,024 INFO L87 Difference]: Start difference. First operand 10082 states and 42239 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:38,055 INFO L93 Difference]: Finished difference Result 13470 states and 56023 transitions. [2025-04-13 22:55:38,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:38,055 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:38,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:38,103 INFO L225 Difference]: With dead ends: 13470 [2025-04-13 22:55:38,103 INFO L226 Difference]: Without dead ends: 12520 [2025-04-13 22:55:38,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:38,109 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 105 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:38,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 130 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:55:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12520 states. [2025-04-13 22:55:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12520 to 10338. [2025-04-13 22:55:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10338 states, 10337 states have (on average 4.200735222985393) internal successors, (43423), 10337 states have internal predecessors, (43423), 0 states have call successors, (0), 0 states have 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:55:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10338 states to 10338 states and 43423 transitions. [2025-04-13 22:55:38,706 INFO L79 Accepts]: Start accepts. Automaton has 10338 states and 43423 transitions. Word has length 35 [2025-04-13 22:55:38,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:38,707 INFO L485 AbstractCegarLoop]: Abstraction has 10338 states and 43423 transitions. [2025-04-13 22:55:38,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:38,707 INFO L278 IsEmpty]: Start isEmpty. Operand 10338 states and 43423 transitions. [2025-04-13 22:55:38,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:38,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:38,727 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] [2025-04-13 22:55:38,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:55:38,727 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:55:38,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -71063838, now seen corresponding path program 9 times [2025-04-13 22:55:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:38,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157476366] [2025-04-13 22:55:38,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:38,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:38,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:38,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:38,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:38,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157476366] [2025-04-13 22:55:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157476366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309318603] [2025-04-13 22:55:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:38,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:38,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:38,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:38,873 INFO L87 Difference]: Start difference. First operand 10338 states and 43423 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:40,017 INFO L93 Difference]: Finished difference Result 14641 states and 61400 transitions. [2025-04-13 22:55:40,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:55:40,017 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:40,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:40,081 INFO L225 Difference]: With dead ends: 14641 [2025-04-13 22:55:40,081 INFO L226 Difference]: Without dead ends: 13459 [2025-04-13 22:55:40,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:40,090 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 137 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:40,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 92 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2025-04-13 22:55:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 10971. [2025-04-13 22:55:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10971 states, 10970 states have (on average 4.220510483135825) internal successors, (46299), 10970 states have internal predecessors, (46299), 0 states have call successors, (0), 0 states have 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:55:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10971 states to 10971 states and 46299 transitions. [2025-04-13 22:55:40,833 INFO L79 Accepts]: Start accepts. Automaton has 10971 states and 46299 transitions. Word has length 35 [2025-04-13 22:55:40,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:40,834 INFO L485 AbstractCegarLoop]: Abstraction has 10971 states and 46299 transitions. [2025-04-13 22:55:40,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:40,834 INFO L278 IsEmpty]: Start isEmpty. Operand 10971 states and 46299 transitions. [2025-04-13 22:55:40,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:40,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:40,852 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] [2025-04-13 22:55:40,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:55:40,853 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:55:40,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1604699720, now seen corresponding path program 10 times [2025-04-13 22:55:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:40,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772693917] [2025-04-13 22:55:40,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:40,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:40,859 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:40,868 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:40,868 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:40,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:40,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772693917] [2025-04-13 22:55:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772693917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561324082] [2025-04-13 22:55:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:40,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:40,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:40,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:40,976 INFO L87 Difference]: Start difference. First operand 10971 states and 46299 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:42,085 INFO L93 Difference]: Finished difference Result 14710 states and 60844 transitions. [2025-04-13 22:55:42,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:42,086 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:42,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:42,139 INFO L225 Difference]: With dead ends: 14710 [2025-04-13 22:55:42,139 INFO L226 Difference]: Without dead ends: 13506 [2025-04-13 22:55:42,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:42,146 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 143 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:42,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 68 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13506 states. [2025-04-13 22:55:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13506 to 11451. [2025-04-13 22:55:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11451 states, 11450 states have (on average 4.24410480349345) internal successors, (48595), 11450 states have internal predecessors, (48595), 0 states have call successors, (0), 0 states have 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:55:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11451 states to 11451 states and 48595 transitions. [2025-04-13 22:55:42,975 INFO L79 Accepts]: Start accepts. Automaton has 11451 states and 48595 transitions. Word has length 35 [2025-04-13 22:55:42,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:42,976 INFO L485 AbstractCegarLoop]: Abstraction has 11451 states and 48595 transitions. [2025-04-13 22:55:42,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:42,976 INFO L278 IsEmpty]: Start isEmpty. Operand 11451 states and 48595 transitions. [2025-04-13 22:55:42,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:42,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:42,995 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] [2025-04-13 22:55:42,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:55:42,996 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:55:42,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1626735612, now seen corresponding path program 11 times [2025-04-13 22:55:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:42,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817565213] [2025-04-13 22:55:42,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:55:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:43,002 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:43,009 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:43,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:43,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:43,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817565213] [2025-04-13 22:55:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817565213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104114408] [2025-04-13 22:55:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:43,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:43,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:43,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:43,232 INFO L87 Difference]: Start difference. First operand 11451 states and 48595 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:44,780 INFO L93 Difference]: Finished difference Result 13941 states and 58217 transitions. [2025-04-13 22:55:44,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:44,781 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:44,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:44,836 INFO L225 Difference]: With dead ends: 13941 [2025-04-13 22:55:44,836 INFO L226 Difference]: Without dead ends: 13755 [2025-04-13 22:55:44,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:44,842 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 91 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:44,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 65 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13755 states. [2025-04-13 22:55:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13755 to 11569. [2025-04-13 22:55:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11569 states, 11568 states have (on average 4.236514522821577) internal successors, (49008), 11568 states have internal predecessors, (49008), 0 states have call successors, (0), 0 states have 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:55:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11569 states to 11569 states and 49008 transitions. [2025-04-13 22:55:45,751 INFO L79 Accepts]: Start accepts. Automaton has 11569 states and 49008 transitions. Word has length 35 [2025-04-13 22:55:45,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:45,752 INFO L485 AbstractCegarLoop]: Abstraction has 11569 states and 49008 transitions. [2025-04-13 22:55:45,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:45,752 INFO L278 IsEmpty]: Start isEmpty. Operand 11569 states and 49008 transitions. [2025-04-13 22:55:45,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:45,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:45,772 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] [2025-04-13 22:55:45,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:55:45,772 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:55:45,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 129013760, now seen corresponding path program 12 times [2025-04-13 22:55:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:45,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925866575] [2025-04-13 22:55:45,773 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:55:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:45,778 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:45,785 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 22:55:45,785 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:55:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:45,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:55:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:45,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925866575] [2025-04-13 22:55:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925866575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002139481] [2025-04-13 22:55:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:45,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:45,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:45,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:45,927 INFO L87 Difference]: Start difference. First operand 11569 states and 49008 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:47,540 INFO L93 Difference]: Finished difference Result 16488 states and 68826 transitions. [2025-04-13 22:55:47,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:47,541 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:47,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:47,610 INFO L225 Difference]: With dead ends: 16488 [2025-04-13 22:55:47,611 INFO L226 Difference]: Without dead ends: 15078 [2025-04-13 22:55:47,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:55:47,620 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 138 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:47,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 73 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2025-04-13 22:55:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 11867. [2025-04-13 22:55:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11866 states have (on average 4.250969155570537) internal successors, (50442), 11866 states have internal predecessors, (50442), 0 states have call successors, (0), 0 states have 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:55:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 50442 transitions. [2025-04-13 22:55:48,671 INFO L79 Accepts]: Start accepts. Automaton has 11867 states and 50442 transitions. Word has length 35 [2025-04-13 22:55:48,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:48,672 INFO L485 AbstractCegarLoop]: Abstraction has 11867 states and 50442 transitions. [2025-04-13 22:55:48,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:48,672 INFO L278 IsEmpty]: Start isEmpty. Operand 11867 states and 50442 transitions. [2025-04-13 22:55:48,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:48,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:48,692 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] [2025-04-13 22:55:48,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:55:48,692 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:55:48,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1980087100, now seen corresponding path program 13 times [2025-04-13 22:55:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:48,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090294549] [2025-04-13 22:55:48,693 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:48,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:48,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090294549] [2025-04-13 22:55:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090294549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:48,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21718821] [2025-04-13 22:55:48,869 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:48,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:55:48,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:55:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:48,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:48,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:55:48,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:49,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:55:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21718821] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:55:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 18 [2025-04-13 22:55:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830512276] [2025-04-13 22:55:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:49,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:55:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:55:49,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:55:49,272 INFO L87 Difference]: Start difference. First operand 11867 states and 50442 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:52,372 INFO L93 Difference]: Finished difference Result 24434 states and 103111 transitions. [2025-04-13 22:55:52,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:55:52,373 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:52,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:52,463 INFO L225 Difference]: With dead ends: 24434 [2025-04-13 22:55:52,463 INFO L226 Difference]: Without dead ends: 23728 [2025-04-13 22:55:52,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:55:52,473 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 346 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:52,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 88 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23728 states. [2025-04-13 22:55:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23728 to 12737. [2025-04-13 22:55:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12737 states, 12736 states have (on average 4.292713567839196) internal successors, (54672), 12736 states have internal predecessors, (54672), 0 states have call successors, (0), 0 states have 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:55:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 54672 transitions. [2025-04-13 22:55:54,063 INFO L79 Accepts]: Start accepts. Automaton has 12737 states and 54672 transitions. Word has length 35 [2025-04-13 22:55:54,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:54,064 INFO L485 AbstractCegarLoop]: Abstraction has 12737 states and 54672 transitions. [2025-04-13 22:55:54,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:54,064 INFO L278 IsEmpty]: Start isEmpty. Operand 12737 states and 54672 transitions. [2025-04-13 22:55:54,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:54,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:54,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] [2025-04-13 22:55:54,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:55:54,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:55:54,293 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:55:54,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1305090482, now seen corresponding path program 14 times [2025-04-13 22:55:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:54,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023284984] [2025-04-13 22:55:54,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:54,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:54,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:54,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:54,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023284984] [2025-04-13 22:55:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023284984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:54,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493602175] [2025-04-13 22:55:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:54,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:54,471 INFO L87 Difference]: Start difference. First operand 12737 states and 54672 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:57,357 INFO L93 Difference]: Finished difference Result 18898 states and 79597 transitions. [2025-04-13 22:55:57,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:57,357 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:57,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:57,429 INFO L225 Difference]: With dead ends: 18898 [2025-04-13 22:55:57,430 INFO L226 Difference]: Without dead ends: 18261 [2025-04-13 22:55:57,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:57,437 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 108 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:57,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 64 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18261 states. [2025-04-13 22:55:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18261 to 13007. [2025-04-13 22:55:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13007 states, 13006 states have (on average 4.292557281254806) internal successors, (55829), 13006 states have internal predecessors, (55829), 0 states have call successors, (0), 0 states have 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:55:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 55829 transitions. [2025-04-13 22:55:58,932 INFO L79 Accepts]: Start accepts. Automaton has 13007 states and 55829 transitions. Word has length 35 [2025-04-13 22:55:58,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:58,933 INFO L485 AbstractCegarLoop]: Abstraction has 13007 states and 55829 transitions. [2025-04-13 22:55:58,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:58,933 INFO L278 IsEmpty]: Start isEmpty. Operand 13007 states and 55829 transitions. [2025-04-13 22:55:58,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:58,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:58,962 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] [2025-04-13 22:55:58,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:55:58,962 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:55:58,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -181556766, now seen corresponding path program 15 times [2025-04-13 22:55:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:58,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053632001] [2025-04-13 22:55:58,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:58,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:55:58,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:55:58,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:58,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:59,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:59,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053632001] [2025-04-13 22:55:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053632001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284369278] [2025-04-13 22:55:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:59,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:59,125 INFO L87 Difference]: Start difference. First operand 13007 states and 55829 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:02,280 INFO L93 Difference]: Finished difference Result 16757 states and 70500 transitions. [2025-04-13 22:56:02,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:56:02,280 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:02,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:02,354 INFO L225 Difference]: With dead ends: 16757 [2025-04-13 22:56:02,354 INFO L226 Difference]: Without dead ends: 16147 [2025-04-13 22:56:02,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:56:02,362 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 147 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:02,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 131 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16147 states. [2025-04-13 22:56:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16147 to 12877. [2025-04-13 22:56:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12877 states, 12876 states have (on average 4.299005902454178) internal successors, (55354), 12876 states have internal predecessors, (55354), 0 states have call successors, (0), 0 states have 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:56:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 55354 transitions. [2025-04-13 22:56:03,922 INFO L79 Accepts]: Start accepts. Automaton has 12877 states and 55354 transitions. Word has length 35 [2025-04-13 22:56:03,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:03,922 INFO L485 AbstractCegarLoop]: Abstraction has 12877 states and 55354 transitions. [2025-04-13 22:56:03,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:03,922 INFO L278 IsEmpty]: Start isEmpty. Operand 12877 states and 55354 transitions. [2025-04-13 22:56:03,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:03,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:03,945 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] [2025-04-13 22:56:03,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:56:03,945 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:56:03,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash 334432700, now seen corresponding path program 16 times [2025-04-13 22:56:03,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:03,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182604645] [2025-04-13 22:56:03,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:03,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:03,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:03,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:03,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:04,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182604645] [2025-04-13 22:56:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182604645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924773216] [2025-04-13 22:56:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:04,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:04,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:04,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:04,118 INFO L87 Difference]: Start difference. First operand 12877 states and 55354 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:06,905 INFO L93 Difference]: Finished difference Result 17292 states and 72854 transitions. [2025-04-13 22:56:06,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:56:06,905 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:06,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:06,979 INFO L225 Difference]: With dead ends: 17292 [2025-04-13 22:56:06,979 INFO L226 Difference]: Without dead ends: 16807 [2025-04-13 22:56:06,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:56:06,985 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:06,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 88 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16807 states. [2025-04-13 22:56:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16807 to 12901. [2025-04-13 22:56:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12901 states, 12900 states have (on average 4.306821705426357) internal successors, (55558), 12900 states have internal predecessors, (55558), 0 states have call successors, (0), 0 states have 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:56:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12901 states to 12901 states and 55558 transitions. [2025-04-13 22:56:08,648 INFO L79 Accepts]: Start accepts. Automaton has 12901 states and 55558 transitions. Word has length 35 [2025-04-13 22:56:08,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:08,649 INFO L485 AbstractCegarLoop]: Abstraction has 12901 states and 55558 transitions. [2025-04-13 22:56:08,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:08,649 INFO L278 IsEmpty]: Start isEmpty. Operand 12901 states and 55558 transitions. [2025-04-13 22:56:08,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:08,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:08,673 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] [2025-04-13 22:56:08,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:56:08,673 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:56:08,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1100106326, now seen corresponding path program 17 times [2025-04-13 22:56:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:08,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974872922] [2025-04-13 22:56:08,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:56:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:08,679 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:08,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:08,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:08,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:08,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974872922] [2025-04-13 22:56:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974872922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059393725] [2025-04-13 22:56:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:08,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:08,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:08,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:08,816 INFO L87 Difference]: Start difference. First operand 12901 states and 55558 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:11,962 INFO L93 Difference]: Finished difference Result 18147 states and 76900 transitions. [2025-04-13 22:56:11,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:56:11,963 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:11,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:12,036 INFO L225 Difference]: With dead ends: 18147 [2025-04-13 22:56:12,036 INFO L226 Difference]: Without dead ends: 17147 [2025-04-13 22:56:12,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:12,044 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 124 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:12,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 65 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17147 states. [2025-04-13 22:56:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17147 to 12837. [2025-04-13 22:56:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12837 states, 12836 states have (on average 4.300716734185104) internal successors, (55204), 12836 states have internal predecessors, (55204), 0 states have call successors, (0), 0 states have 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:56:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12837 states to 12837 states and 55204 transitions. [2025-04-13 22:56:13,794 INFO L79 Accepts]: Start accepts. Automaton has 12837 states and 55204 transitions. Word has length 35 [2025-04-13 22:56:13,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:13,795 INFO L485 AbstractCegarLoop]: Abstraction has 12837 states and 55204 transitions. [2025-04-13 22:56:13,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:13,795 INFO L278 IsEmpty]: Start isEmpty. Operand 12837 states and 55204 transitions. [2025-04-13 22:56:13,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:13,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:13,820 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] [2025-04-13 22:56:13,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:56:13,820 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:56:13,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1461950856, now seen corresponding path program 18 times [2025-04-13 22:56:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:13,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179804570] [2025-04-13 22:56:13,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:56:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:13,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:13,830 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:56:13,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:56:13,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:13,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179804570] [2025-04-13 22:56:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179804570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156994141] [2025-04-13 22:56:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:13,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:13,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:13,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:13,963 INFO L87 Difference]: Start difference. First operand 12837 states and 55204 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:16,526 INFO L93 Difference]: Finished difference Result 15315 states and 65122 transitions. [2025-04-13 22:56:16,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:16,526 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:16,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:16,593 INFO L225 Difference]: With dead ends: 15315 [2025-04-13 22:56:16,593 INFO L226 Difference]: Without dead ends: 14692 [2025-04-13 22:56:16,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:16,600 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 132 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:16,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 67 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14692 states. [2025-04-13 22:56:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14692 to 12860. [2025-04-13 22:56:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12860 states, 12859 states have (on average 4.3084221168053505) internal successors, (55402), 12859 states have internal predecessors, (55402), 0 states have call successors, (0), 0 states have 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:56:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12860 states to 12860 states and 55402 transitions. [2025-04-13 22:56:18,417 INFO L79 Accepts]: Start accepts. Automaton has 12860 states and 55402 transitions. Word has length 35 [2025-04-13 22:56:18,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:18,417 INFO L485 AbstractCegarLoop]: Abstraction has 12860 states and 55402 transitions. [2025-04-13 22:56:18,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:18,417 INFO L278 IsEmpty]: Start isEmpty. Operand 12860 states and 55402 transitions. [2025-04-13 22:56:18,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:18,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:18,441 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] [2025-04-13 22:56:18,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:56:18,441 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:56:18,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1614253240, now seen corresponding path program 19 times [2025-04-13 22:56:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:18,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511387625] [2025-04-13 22:56:18,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:56:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:18,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:56:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:18,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511387625] [2025-04-13 22:56:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511387625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:18,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637359546] [2025-04-13 22:56:18,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:56:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:18,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:56:18,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:56:18,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:56:18,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:18,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:18,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:18,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:56:18,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:18,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637359546] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:56:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 16 [2025-04-13 22:56:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896170717] [2025-04-13 22:56:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:18,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:56:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:18,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:56:18,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:56:18,833 INFO L87 Difference]: Start difference. First operand 12860 states and 55402 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:22,130 INFO L93 Difference]: Finished difference Result 17123 states and 69954 transitions. [2025-04-13 22:56:22,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:56:22,130 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:22,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:22,190 INFO L225 Difference]: With dead ends: 17123 [2025-04-13 22:56:22,190 INFO L226 Difference]: Without dead ends: 14826 [2025-04-13 22:56:22,198 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:56:22,199 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 444 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:22,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 117 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states. [2025-04-13 22:56:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 10001. [2025-04-13 22:56:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10001 states, 10000 states have (on average 4.2387) internal successors, (42387), 10000 states have internal predecessors, (42387), 0 states have call successors, (0), 0 states have 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:56:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10001 states to 10001 states and 42387 transitions. [2025-04-13 22:56:23,688 INFO L79 Accepts]: Start accepts. Automaton has 10001 states and 42387 transitions. Word has length 35 [2025-04-13 22:56:23,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:23,688 INFO L485 AbstractCegarLoop]: Abstraction has 10001 states and 42387 transitions. [2025-04-13 22:56:23,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:23,688 INFO L278 IsEmpty]: Start isEmpty. Operand 10001 states and 42387 transitions. [2025-04-13 22:56:23,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:23,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:23,705 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] [2025-04-13 22:56:23,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:56:23,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:23,905 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:56:23,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1556487562, now seen corresponding path program 20 times [2025-04-13 22:56:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:23,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791953169] [2025-04-13 22:56:23,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:23,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:23,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:56:23,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:56:23,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:24,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791953169] [2025-04-13 22:56:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791953169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:56:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936797630] [2025-04-13 22:56:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:24,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:56:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:56:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:56:24,102 INFO L87 Difference]: Start difference. First operand 10001 states and 42387 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:26,808 INFO L93 Difference]: Finished difference Result 13253 states and 55221 transitions. [2025-04-13 22:56:26,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:56:26,809 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:26,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:26,861 INFO L225 Difference]: With dead ends: 13253 [2025-04-13 22:56:26,861 INFO L226 Difference]: Without dead ends: 12809 [2025-04-13 22:56:26,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:56:26,866 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 142 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:26,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 91 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12809 states. [2025-04-13 22:56:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12809 to 9804. [2025-04-13 22:56:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9804 states, 9803 states have (on average 4.2294195654391515) internal successors, (41461), 9803 states have internal predecessors, (41461), 0 states have call successors, (0), 0 states have 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:56:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9804 states to 9804 states and 41461 transitions. [2025-04-13 22:56:28,188 INFO L79 Accepts]: Start accepts. Automaton has 9804 states and 41461 transitions. Word has length 35 [2025-04-13 22:56:28,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:28,188 INFO L485 AbstractCegarLoop]: Abstraction has 9804 states and 41461 transitions. [2025-04-13 22:56:28,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:28,189 INFO L278 IsEmpty]: Start isEmpty. Operand 9804 states and 41461 transitions. [2025-04-13 22:56:28,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:28,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:28,205 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] [2025-04-13 22:56:28,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:56:28,205 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:56:28,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 688376392, now seen corresponding path program 21 times [2025-04-13 22:56:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:28,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024495492] [2025-04-13 22:56:28,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:28,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:28,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:28,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:56:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:28,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024495492] [2025-04-13 22:56:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024495492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873426270] [2025-04-13 22:56:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:28,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:28,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:28,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:28,362 INFO L87 Difference]: Start difference. First operand 9804 states and 41461 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:30,404 INFO L93 Difference]: Finished difference Result 11442 states and 47015 transitions. [2025-04-13 22:56:30,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:30,404 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:30,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:30,448 INFO L225 Difference]: With dead ends: 11442 [2025-04-13 22:56:30,449 INFO L226 Difference]: Without dead ends: 10247 [2025-04-13 22:56:30,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:56:30,454 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 141 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:30,455 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 72 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2025-04-13 22:56:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 9298. [2025-04-13 22:56:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9298 states, 9297 states have (on average 4.281703775411423) internal successors, (39807), 9297 states have internal predecessors, (39807), 0 states have call successors, (0), 0 states have 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:56:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 39807 transitions. [2025-04-13 22:56:31,781 INFO L79 Accepts]: Start accepts. Automaton has 9298 states and 39807 transitions. Word has length 35 [2025-04-13 22:56:31,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:31,782 INFO L485 AbstractCegarLoop]: Abstraction has 9298 states and 39807 transitions. [2025-04-13 22:56:31,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:31,782 INFO L278 IsEmpty]: Start isEmpty. Operand 9298 states and 39807 transitions. [2025-04-13 22:56:31,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:31,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:31,800 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] [2025-04-13 22:56:31,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:56:31,800 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:56:31,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash 732034416, now seen corresponding path program 1 times [2025-04-13 22:56:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:31,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48830020] [2025-04-13 22:56:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:31,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:56:31,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:31,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:31,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:31,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48830020] [2025-04-13 22:56:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48830020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524886405] [2025-04-13 22:56:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:31,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:31,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:31,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:31,945 INFO L87 Difference]: Start difference. First operand 9298 states and 39807 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:34,232 INFO L93 Difference]: Finished difference Result 12706 states and 54132 transitions. [2025-04-13 22:56:34,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:34,232 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:34,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:34,279 INFO L225 Difference]: With dead ends: 12706 [2025-04-13 22:56:34,279 INFO L226 Difference]: Without dead ends: 10947 [2025-04-13 22:56:34,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:34,284 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 138 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:34,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 83 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10947 states. [2025-04-13 22:56:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10947 to 9233. [2025-04-13 22:56:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9233 states, 9232 states have (on average 4.282387348353553) internal successors, (39535), 9232 states have internal predecessors, (39535), 0 states have call successors, (0), 0 states have 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:56:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9233 states to 9233 states and 39535 transitions. [2025-04-13 22:56:35,741 INFO L79 Accepts]: Start accepts. Automaton has 9233 states and 39535 transitions. Word has length 35 [2025-04-13 22:56:35,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:35,741 INFO L485 AbstractCegarLoop]: Abstraction has 9233 states and 39535 transitions. [2025-04-13 22:56:35,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:35,741 INFO L278 IsEmpty]: Start isEmpty. Operand 9233 states and 39535 transitions. [2025-04-13 22:56:35,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:35,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:35,756 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] [2025-04-13 22:56:35,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:56:35,757 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:56:35,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1676996074, now seen corresponding path program 2 times [2025-04-13 22:56:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:35,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413666879] [2025-04-13 22:56:35,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:35,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:35,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:35,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:35,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413666879] [2025-04-13 22:56:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413666879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471334755] [2025-04-13 22:56:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:35,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:35,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:35,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:35,905 INFO L87 Difference]: Start difference. First operand 9233 states and 39535 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:38,992 INFO L93 Difference]: Finished difference Result 15638 states and 66005 transitions. [2025-04-13 22:56:38,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:38,992 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:38,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:39,063 INFO L225 Difference]: With dead ends: 15638 [2025-04-13 22:56:39,064 INFO L226 Difference]: Without dead ends: 14589 [2025-04-13 22:56:39,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:39,070 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 137 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:39,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 65 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14589 states. [2025-04-13 22:56:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14589 to 9402. [2025-04-13 22:56:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9402 states, 9401 states have (on average 4.288799063929369) internal successors, (40319), 9401 states have internal predecessors, (40319), 0 states have call successors, (0), 0 states have 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:56:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9402 states to 9402 states and 40319 transitions. [2025-04-13 22:56:40,650 INFO L79 Accepts]: Start accepts. Automaton has 9402 states and 40319 transitions. Word has length 35 [2025-04-13 22:56:40,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:40,650 INFO L485 AbstractCegarLoop]: Abstraction has 9402 states and 40319 transitions. [2025-04-13 22:56:40,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:40,650 INFO L278 IsEmpty]: Start isEmpty. Operand 9402 states and 40319 transitions. [2025-04-13 22:56:40,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:40,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:40,667 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] [2025-04-13 22:56:40,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:56:40,667 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:56:40,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1622556080, now seen corresponding path program 3 times [2025-04-13 22:56:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:40,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810363739] [2025-04-13 22:56:40,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:40,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:40,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:40,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:56:40,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:40,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810363739] [2025-04-13 22:56:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810363739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539138897] [2025-04-13 22:56:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:40,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:40,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:40,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:40,804 INFO L87 Difference]: Start difference. First operand 9402 states and 40319 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:42,989 INFO L93 Difference]: Finished difference Result 10472 states and 43826 transitions. [2025-04-13 22:56:42,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:56:42,993 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:42,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:43,040 INFO L225 Difference]: With dead ends: 10472 [2025-04-13 22:56:43,040 INFO L226 Difference]: Without dead ends: 9438 [2025-04-13 22:56:43,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:43,044 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:43,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 53 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9438 states. [2025-04-13 22:56:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9438 to 9192. [2025-04-13 22:56:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9192 states, 9191 states have (on average 4.299096942661299) internal successors, (39513), 9191 states have internal predecessors, (39513), 0 states have call successors, (0), 0 states have 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:56:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 39513 transitions. [2025-04-13 22:56:44,552 INFO L79 Accepts]: Start accepts. Automaton has 9192 states and 39513 transitions. Word has length 35 [2025-04-13 22:56:44,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:44,552 INFO L485 AbstractCegarLoop]: Abstraction has 9192 states and 39513 transitions. [2025-04-13 22:56:44,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:44,552 INFO L278 IsEmpty]: Start isEmpty. Operand 9192 states and 39513 transitions. [2025-04-13 22:56:44,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:44,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:44,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] [2025-04-13 22:56:44,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:56:44,568 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:56:44,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1121820488, now seen corresponding path program 4 times [2025-04-13 22:56:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:44,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086646521] [2025-04-13 22:56:44,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:44,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:44,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:44,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:44,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086646521] [2025-04-13 22:56:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086646521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:44,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691228354] [2025-04-13 22:56:44,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:44,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:44,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:56:44,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 22:56:44,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:56:44,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:44,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:44,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:44,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:56:44,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:45,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691228354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:56:45,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:56:45,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 9] total 22 [2025-04-13 22:56:45,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721979817] [2025-04-13 22:56:45,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:56:45,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:56:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:45,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:56:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:56:45,165 INFO L87 Difference]: Start difference. First operand 9192 states and 39513 transitions. Second operand has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:56:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:58,583 INFO L93 Difference]: Finished difference Result 49396 states and 209486 transitions. [2025-04-13 22:56:58,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2025-04-13 22:56:58,583 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:58,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:58,779 INFO L225 Difference]: With dead ends: 49396 [2025-04-13 22:56:58,779 INFO L226 Difference]: Without dead ends: 45349 [2025-04-13 22:56:58,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19224 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7017, Invalid=36873, Unknown=0, NotChecked=0, Total=43890 [2025-04-13 22:56:58,805 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 1461 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 4487 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:58,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 982 Invalid, 4593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4487 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 22:56:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45349 states. [2025-04-13 22:57:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45349 to 12709. [2025-04-13 22:57:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12709 states, 12708 states have (on average 4.455067673906201) internal successors, (56615), 12708 states have internal predecessors, (56615), 0 states have call successors, (0), 0 states have 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:57:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 56615 transitions. [2025-04-13 22:57:01,882 INFO L79 Accepts]: Start accepts. Automaton has 12709 states and 56615 transitions. Word has length 35 [2025-04-13 22:57:01,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:01,882 INFO L485 AbstractCegarLoop]: Abstraction has 12709 states and 56615 transitions. [2025-04-13 22:57:01,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:57:01,882 INFO L278 IsEmpty]: Start isEmpty. Operand 12709 states and 56615 transitions. [2025-04-13 22:57:01,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:01,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:01,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:01,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:57:02,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:57:02,106 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:57:02,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 315535794, now seen corresponding path program 5 times [2025-04-13 22:57:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:02,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528256498] [2025-04-13 22:57:02,107 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:57:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:02,114 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:02,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:02,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:57:02,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:02,245 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:57:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:02,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528256498] [2025-04-13 22:57:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528256498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282810570] [2025-04-13 22:57:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:02,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:02,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:02,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:02,246 INFO L87 Difference]: Start difference. First operand 12709 states and 56615 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:05,482 INFO L93 Difference]: Finished difference Result 13333 states and 58683 transitions. [2025-04-13 22:57:05,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:57:05,483 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:05,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:05,554 INFO L225 Difference]: With dead ends: 13333 [2025-04-13 22:57:05,554 INFO L226 Difference]: Without dead ends: 12837 [2025-04-13 22:57:05,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:57:05,560 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 61 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:05,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 76 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12837 states. [2025-04-13 22:57:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12837 to 12819. [2025-04-13 22:57:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12819 states, 12818 states have (on average 4.437665782493369) internal successors, (56882), 12818 states have internal predecessors, (56882), 0 states have call successors, (0), 0 states have 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:57:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12819 states to 12819 states and 56882 transitions. [2025-04-13 22:57:07,854 INFO L79 Accepts]: Start accepts. Automaton has 12819 states and 56882 transitions. Word has length 35 [2025-04-13 22:57:07,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:07,854 INFO L485 AbstractCegarLoop]: Abstraction has 12819 states and 56882 transitions. [2025-04-13 22:57:07,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:07,854 INFO L278 IsEmpty]: Start isEmpty. Operand 12819 states and 56882 transitions. [2025-04-13 22:57:07,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:07,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:07,883 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] [2025-04-13 22:57:07,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:57:07,883 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:57:07,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -308116240, now seen corresponding path program 6 times [2025-04-13 22:57:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:07,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778339212] [2025-04-13 22:57:07,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:57:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:07,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:07,895 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:07,895 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:57:07,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:08,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:08,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778339212] [2025-04-13 22:57:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778339212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:08,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059805556] [2025-04-13 22:57:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:08,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:08,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:08,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:08,028 INFO L87 Difference]: Start difference. First operand 12819 states and 56882 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:12,205 INFO L93 Difference]: Finished difference Result 18657 states and 80361 transitions. [2025-04-13 22:57:12,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:57:12,205 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:12,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:12,288 INFO L225 Difference]: With dead ends: 18657 [2025-04-13 22:57:12,288 INFO L226 Difference]: Without dead ends: 17466 [2025-04-13 22:57:12,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:57:12,295 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 109 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:12,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 69 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17466 states. [2025-04-13 22:57:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17466 to 12804. [2025-04-13 22:57:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12804 states, 12803 states have (on average 4.435757244395845) internal successors, (56791), 12803 states have internal predecessors, (56791), 0 states have call successors, (0), 0 states have 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:57:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 56791 transitions. [2025-04-13 22:57:14,689 INFO L79 Accepts]: Start accepts. Automaton has 12804 states and 56791 transitions. Word has length 35 [2025-04-13 22:57:14,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:14,690 INFO L485 AbstractCegarLoop]: Abstraction has 12804 states and 56791 transitions. [2025-04-13 22:57:14,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:14,690 INFO L278 IsEmpty]: Start isEmpty. Operand 12804 states and 56791 transitions. [2025-04-13 22:57:14,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:14,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:14,715 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] [2025-04-13 22:57:14,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:57:14,716 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:57:14,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1672183464, now seen corresponding path program 7 times [2025-04-13 22:57:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:14,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542334542] [2025-04-13 22:57:14,716 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:57:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:57:14,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:14,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:14,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:14,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542334542] [2025-04-13 22:57:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542334542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:14,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:14,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769903594] [2025-04-13 22:57:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:14,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:14,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:14,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:14,857 INFO L87 Difference]: Start difference. First operand 12804 states and 56791 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:18,059 INFO L93 Difference]: Finished difference Result 13673 states and 59930 transitions. [2025-04-13 22:57:18,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:57:18,060 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:18,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:18,126 INFO L225 Difference]: With dead ends: 13673 [2025-04-13 22:57:18,126 INFO L226 Difference]: Without dead ends: 13531 [2025-04-13 22:57:18,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:57:18,130 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:18,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 70 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13531 states. [2025-04-13 22:57:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13531 to 12883. [2025-04-13 22:57:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12883 states, 12882 states have (on average 4.424080111783884) internal successors, (56991), 12882 states have internal predecessors, (56991), 0 states have call successors, (0), 0 states have 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:57:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12883 states to 12883 states and 56991 transitions. [2025-04-13 22:57:20,393 INFO L79 Accepts]: Start accepts. Automaton has 12883 states and 56991 transitions. Word has length 35 [2025-04-13 22:57:20,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:20,394 INFO L485 AbstractCegarLoop]: Abstraction has 12883 states and 56991 transitions. [2025-04-13 22:57:20,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:20,394 INFO L278 IsEmpty]: Start isEmpty. Operand 12883 states and 56991 transitions. [2025-04-13 22:57:20,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:20,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:20,420 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] [2025-04-13 22:57:20,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:57:20,420 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:57:20,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 947648554, now seen corresponding path program 8 times [2025-04-13 22:57:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:20,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846894212] [2025-04-13 22:57:20,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:20,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:20,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:57:20,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:20,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:20,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846894212] [2025-04-13 22:57:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846894212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:20,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115594532] [2025-04-13 22:57:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:20,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:20,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:20,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:20,548 INFO L87 Difference]: Start difference. First operand 12883 states and 56991 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:24,691 INFO L93 Difference]: Finished difference Result 17735 states and 76823 transitions. [2025-04-13 22:57:24,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:57:24,692 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:24,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:24,773 INFO L225 Difference]: With dead ends: 17735 [2025-04-13 22:57:24,773 INFO L226 Difference]: Without dead ends: 17452 [2025-04-13 22:57:24,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:57:24,779 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 166 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:24,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 93 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:57:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17452 states. [2025-04-13 22:57:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17452 to 12760. [2025-04-13 22:57:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12760 states, 12759 states have (on average 4.439846382945372) internal successors, (56648), 12759 states have internal predecessors, (56648), 0 states have call successors, (0), 0 states have 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:57:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12760 states to 12760 states and 56648 transitions. [2025-04-13 22:57:27,276 INFO L79 Accepts]: Start accepts. Automaton has 12760 states and 56648 transitions. Word has length 35 [2025-04-13 22:57:27,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:27,276 INFO L485 AbstractCegarLoop]: Abstraction has 12760 states and 56648 transitions. [2025-04-13 22:57:27,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:27,276 INFO L278 IsEmpty]: Start isEmpty. Operand 12760 states and 56648 transitions. [2025-04-13 22:57:27,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:27,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:27,299 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] [2025-04-13 22:57:27,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:57:27,299 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:57:27,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash -276852818, now seen corresponding path program 9 times [2025-04-13 22:57:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:27,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72525402] [2025-04-13 22:57:27,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:27,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:27,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 35 statements. [2025-04-13 22:57:27,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:57:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:27,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72525402] [2025-04-13 22:57:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72525402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252023702] [2025-04-13 22:57:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:27,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:27,406 INFO L87 Difference]: Start difference. First operand 12760 states and 56648 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:30,746 INFO L93 Difference]: Finished difference Result 14079 states and 61974 transitions. [2025-04-13 22:57:30,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:57:30,747 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:30,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:30,820 INFO L225 Difference]: With dead ends: 14079 [2025-04-13 22:57:30,821 INFO L226 Difference]: Without dead ends: 13954 [2025-04-13 22:57:30,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:57:30,825 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 113 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:30,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 70 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13954 states. [2025-04-13 22:57:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13954 to 12752. [2025-04-13 22:57:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12752 states, 12751 states have (on average 4.439181240687005) internal successors, (56604), 12751 states have internal predecessors, (56604), 0 states have call successors, (0), 0 states have 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:57:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 56604 transitions. [2025-04-13 22:57:33,250 INFO L79 Accepts]: Start accepts. Automaton has 12752 states and 56604 transitions. Word has length 35 [2025-04-13 22:57:33,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:33,251 INFO L485 AbstractCegarLoop]: Abstraction has 12752 states and 56604 transitions. [2025-04-13 22:57:33,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:33,251 INFO L278 IsEmpty]: Start isEmpty. Operand 12752 states and 56604 transitions. [2025-04-13 22:57:33,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:33,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:33,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] [2025-04-13 22:57:33,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:57:33,329 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:57:33,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2075806040, now seen corresponding path program 10 times [2025-04-13 22:57:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:33,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037231815] [2025-04-13 22:57:33,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:57:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:33,334 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:33,339 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:33,339 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:57:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:33,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037231815] [2025-04-13 22:57:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037231815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802671746] [2025-04-13 22:57:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:33,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:33,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:33,503 INFO L87 Difference]: Start difference. First operand 12752 states and 56604 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:37,480 INFO L93 Difference]: Finished difference Result 14889 states and 64195 transitions. [2025-04-13 22:57:37,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:57:37,480 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:37,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:37,559 INFO L225 Difference]: With dead ends: 14889 [2025-04-13 22:57:37,559 INFO L226 Difference]: Without dead ends: 14817 [2025-04-13 22:57:37,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:57:37,566 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:37,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 87 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14817 states. [2025-04-13 22:57:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14817 to 12816. [2025-04-13 22:57:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12816 states, 12815 states have (on average 4.431525555989075) internal successors, (56790), 12815 states have internal predecessors, (56790), 0 states have call successors, (0), 0 states have 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:57:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12816 states to 12816 states and 56790 transitions. [2025-04-13 22:57:40,359 INFO L79 Accepts]: Start accepts. Automaton has 12816 states and 56790 transitions. Word has length 35 [2025-04-13 22:57:40,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:40,359 INFO L485 AbstractCegarLoop]: Abstraction has 12816 states and 56790 transitions. [2025-04-13 22:57:40,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:40,359 INFO L278 IsEmpty]: Start isEmpty. Operand 12816 states and 56790 transitions. [2025-04-13 22:57:40,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:57:40,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:40,384 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] [2025-04-13 22:57:40,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 22:57:40,384 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:57:40,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 450342016, now seen corresponding path program 11 times [2025-04-13 22:57:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:40,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586218664] [2025-04-13 22:57:40,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:57:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:40,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:57:40,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:57:40,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:57:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:40,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586218664] [2025-04-13 22:57:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586218664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:40,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:40,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604077155] [2025-04-13 22:57:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:40,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:40,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:40,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:40,515 INFO L87 Difference]: Start difference. First operand 12816 states and 56790 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:43,454 INFO L93 Difference]: Finished difference Result 13460 states and 58926 transitions. [2025-04-13 22:57:43,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:57:43,454 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:57:43,454 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:43,525 INFO L225 Difference]: With dead ends: 13460 [2025-04-13 22:57:43,525 INFO L226 Difference]: Without dead ends: 11879 [2025-04-13 22:57:43,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:57:43,531 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:43,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 100 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2025-04-13 22:57:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 11875. [2025-04-13 22:57:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11874 states have (on average 4.518106787940037) internal successors, (53648), 11874 states have internal predecessors, (53648), 0 states have call successors, (0), 0 states have 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:57:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 53648 transitions. [2025-04-13 22:57:45,700 INFO L79 Accepts]: Start accepts. Automaton has 11875 states and 53648 transitions. Word has length 35 [2025-04-13 22:57:45,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:45,700 INFO L485 AbstractCegarLoop]: Abstraction has 11875 states and 53648 transitions. [2025-04-13 22:57:45,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:45,700 INFO L278 IsEmpty]: Start isEmpty. Operand 11875 states and 53648 transitions. [2025-04-13 22:57:45,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:57:45,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:45,722 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] [2025-04-13 22:57:45,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:57:45,722 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:57:45,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 196870919, now seen corresponding path program 1 times [2025-04-13 22:57:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:45,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491962164] [2025-04-13 22:57:45,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:57:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 22:57:45,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:57:45,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:45,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:57:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:45,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491962164] [2025-04-13 22:57:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491962164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:57:45,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177470172] [2025-04-13 22:57:45,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:57:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:57:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:57:45,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:57:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 22:57:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 22:57:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:57:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:45,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:45,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:57:45,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:57:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:57:45,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:57:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:46,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177470172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:57:46,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:57:46,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2025-04-13 22:57:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341429930] [2025-04-13 22:57:46,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:57:46,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:57:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:46,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:57:46,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:57:46,059 INFO L87 Difference]: Start difference. First operand 11875 states and 53648 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:51,186 INFO L93 Difference]: Finished difference Result 21327 states and 96812 transitions. [2025-04-13 22:57:51,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:57:51,186 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:57:51,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:51,292 INFO L225 Difference]: With dead ends: 21327 [2025-04-13 22:57:51,292 INFO L226 Difference]: Without dead ends: 20350 [2025-04-13 22:57:51,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=414, Invalid=1392, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:57:51,302 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 754 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:51,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 403 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:57:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20350 states. [2025-04-13 22:57:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20350 to 11505. [2025-04-13 22:57:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11505 states, 11504 states have (on average 4.491568150208623) internal successors, (51671), 11504 states have internal predecessors, (51671), 0 states have call successors, (0), 0 states have 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:57:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11505 states to 11505 states and 51671 transitions. [2025-04-13 22:57:53,782 INFO L79 Accepts]: Start accepts. Automaton has 11505 states and 51671 transitions. Word has length 39 [2025-04-13 22:57:53,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:53,782 INFO L485 AbstractCegarLoop]: Abstraction has 11505 states and 51671 transitions. [2025-04-13 22:57:53,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:53,782 INFO L278 IsEmpty]: Start isEmpty. Operand 11505 states and 51671 transitions. [2025-04-13 22:57:53,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:57:53,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:53,805 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] [2025-04-13 22:57:53,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:57:54,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 22:57:54,009 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:57:54,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -261797723, now seen corresponding path program 1 times [2025-04-13 22:57:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:54,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822874162] [2025-04-13 22:57:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:57:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:54,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 22:57:54,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:57:54,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:54,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:57:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:54,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822874162] [2025-04-13 22:57:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822874162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:57:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969509718] [2025-04-13 22:57:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:54,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:54,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:54,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:54,191 INFO L87 Difference]: Start difference. First operand 11505 states and 51671 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:00,041 INFO L93 Difference]: Finished difference Result 21911 states and 98185 transitions. [2025-04-13 22:58:00,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:58:00,042 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:58:00,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:00,145 INFO L225 Difference]: With dead ends: 21911 [2025-04-13 22:58:00,145 INFO L226 Difference]: Without dead ends: 20876 [2025-04-13 22:58:00,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:00,154 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:00,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 46 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20876 states. [2025-04-13 22:58:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20876 to 12253. [2025-04-13 22:58:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12253 states, 12252 states have (on average 4.4549461312438785) internal successors, (54582), 12252 states have internal predecessors, (54582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12253 states to 12253 states and 54582 transitions. [2025-04-13 22:58:02,998 INFO L79 Accepts]: Start accepts. Automaton has 12253 states and 54582 transitions. Word has length 39 [2025-04-13 22:58:02,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:02,998 INFO L485 AbstractCegarLoop]: Abstraction has 12253 states and 54582 transitions. [2025-04-13 22:58:02,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:02,998 INFO L278 IsEmpty]: Start isEmpty. Operand 12253 states and 54582 transitions. [2025-04-13 22:58:03,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:58:03,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:03,020 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] [2025-04-13 22:58:03,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:58:03,020 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:58:03,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -191153365, now seen corresponding path program 2 times [2025-04-13 22:58:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:03,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819587838] [2025-04-13 22:58:03,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:58:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:03,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:03,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 39 statements. [2025-04-13 22:58:03,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:58:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:58:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:03,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819587838] [2025-04-13 22:58:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819587838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:03,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:03,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:03,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468577048] [2025-04-13 22:58:03,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:03,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:58:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:03,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:58:03,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:58:03,102 INFO L87 Difference]: Start difference. First operand 12253 states and 54582 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:08,661 INFO L93 Difference]: Finished difference Result 19419 states and 87556 transitions. [2025-04-13 22:58:08,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:58:08,661 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:58:08,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:08,741 INFO L225 Difference]: With dead ends: 19419 [2025-04-13 22:58:08,741 INFO L226 Difference]: Without dead ends: 17992 [2025-04-13 22:58:08,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:58:08,748 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:08,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 70 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17992 states. [2025-04-13 22:58:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17992 to 12083. [2025-04-13 22:58:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12083 states, 12082 states have (on average 4.457209071345804) internal successors, (53852), 12082 states have internal predecessors, (53852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12083 states to 12083 states and 53852 transitions. [2025-04-13 22:58:11,708 INFO L79 Accepts]: Start accepts. Automaton has 12083 states and 53852 transitions. Word has length 39 [2025-04-13 22:58:11,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:11,708 INFO L485 AbstractCegarLoop]: Abstraction has 12083 states and 53852 transitions. [2025-04-13 22:58:11,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:11,708 INFO L278 IsEmpty]: Start isEmpty. Operand 12083 states and 53852 transitions. [2025-04-13 22:58:11,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:58:11,733 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:11,733 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] [2025-04-13 22:58:11,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:58:11,733 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:58:11,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1965250133, now seen corresponding path program 2 times [2025-04-13 22:58:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:11,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158212705] [2025-04-13 22:58:11,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:58:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:11,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:11,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 39 statements. [2025-04-13 22:58:11,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:58:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:58:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:11,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158212705] [2025-04-13 22:58:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158212705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:11,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:58:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428714558] [2025-04-13 22:58:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:11,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:58:11,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:11,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:58:11,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:11,894 INFO L87 Difference]: Start difference. First operand 12083 states and 53852 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:15,939 INFO L93 Difference]: Finished difference Result 12724 states and 56019 transitions. [2025-04-13 22:58:15,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:58:15,939 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:58:15,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:16,001 INFO L225 Difference]: With dead ends: 12724 [2025-04-13 22:58:16,001 INFO L226 Difference]: Without dead ends: 12356 [2025-04-13 22:58:16,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:58:16,004 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:16,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2025-04-13 22:58:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 12105. [2025-04-13 22:58:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12105 states, 12104 states have (on average 4.455964970257766) internal successors, (53935), 12104 states have internal predecessors, (53935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12105 states to 12105 states and 53935 transitions. [2025-04-13 22:58:18,929 INFO L79 Accepts]: Start accepts. Automaton has 12105 states and 53935 transitions. Word has length 39 [2025-04-13 22:58:18,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:18,929 INFO L485 AbstractCegarLoop]: Abstraction has 12105 states and 53935 transitions. [2025-04-13 22:58:18,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:18,930 INFO L278 IsEmpty]: Start isEmpty. Operand 12105 states and 53935 transitions. [2025-04-13 22:58:18,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:58:18,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:18,951 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] [2025-04-13 22:58:18,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 22:58:18,951 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:18,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash -65557343, now seen corresponding path program 3 times [2025-04-13 22:58:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:18,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872574039] [2025-04-13 22:58:18,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:18,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:18,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:58:18,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:58:18,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:58:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:19,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872574039] [2025-04-13 22:58:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872574039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:19,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140002507] [2025-04-13 22:58:19,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:19,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:19,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:58:19,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:58:19,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:19,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:58:19,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:58:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:19,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:58:19,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:58:19,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140002507] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:58:19,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:58:19,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 9] total 16 [2025-04-13 22:58:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031519178] [2025-04-13 22:58:19,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:58:19,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:58:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:19,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:58:19,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:58:19,313 INFO L87 Difference]: Start difference. First operand 12105 states and 53935 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:34,711 INFO L93 Difference]: Finished difference Result 35307 states and 150740 transitions. [2025-04-13 22:58:34,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-04-13 22:58:34,711 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:58:34,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:34,864 INFO L225 Difference]: With dead ends: 35307 [2025-04-13 22:58:34,865 INFO L226 Difference]: Without dead ends: 34370 [2025-04-13 22:58:34,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2747, Invalid=12753, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 22:58:34,879 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 1255 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:34,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 334 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:58:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34370 states. [2025-04-13 22:58:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34370 to 12971. [2025-04-13 22:58:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 4.5500385505011565) internal successors, (59014), 12970 states have internal predecessors, (59014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 59014 transitions. [2025-04-13 22:58:39,023 INFO L79 Accepts]: Start accepts. Automaton has 12971 states and 59014 transitions. Word has length 39 [2025-04-13 22:58:39,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:39,023 INFO L485 AbstractCegarLoop]: Abstraction has 12971 states and 59014 transitions. [2025-04-13 22:58:39,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:39,023 INFO L278 IsEmpty]: Start isEmpty. Operand 12971 states and 59014 transitions. [2025-04-13 22:58:39,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:58:39,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:39,053 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] [2025-04-13 22:58:39,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:58:39,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:39,254 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:39,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1058707535, now seen corresponding path program 3 times [2025-04-13 22:58:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:39,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987633596] [2025-04-13 22:58:39,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:39,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:39,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 39 statements. [2025-04-13 22:58:39,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:58:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:58:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:39,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987633596] [2025-04-13 22:58:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987633596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:58:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383568565] [2025-04-13 22:58:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:39,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:58:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:58:39,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:39,375 INFO L87 Difference]: Start difference. First operand 12971 states and 59014 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:46,905 INFO L93 Difference]: Finished difference Result 19615 states and 88481 transitions. [2025-04-13 22:58:46,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:58:46,905 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:58:46,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:46,998 INFO L225 Difference]: With dead ends: 19615 [2025-04-13 22:58:46,999 INFO L226 Difference]: Without dead ends: 18807 [2025-04-13 22:58:47,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:58:47,005 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 103 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:47,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 90 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2025-04-13 22:58:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 12971. [2025-04-13 22:58:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 4.5500385505011565) internal successors, (59014), 12970 states have internal predecessors, (59014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 59014 transitions. [2025-04-13 22:58:50,961 INFO L79 Accepts]: Start accepts. Automaton has 12971 states and 59014 transitions. Word has length 39 [2025-04-13 22:58:50,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:50,962 INFO L485 AbstractCegarLoop]: Abstraction has 12971 states and 59014 transitions. [2025-04-13 22:58:50,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:50,962 INFO L278 IsEmpty]: Start isEmpty. Operand 12971 states and 59014 transitions. [2025-04-13 22:58:50,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:58:50,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:50,993 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] [2025-04-13 22:58:50,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 22:58:50,993 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:50,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1039804307, now seen corresponding path program 4 times [2025-04-13 22:58:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:50,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506822655] [2025-04-13 22:58:50,993 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:51,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:51,007 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:58:51,007 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:51,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:58:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:51,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506822655] [2025-04-13 22:58:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506822655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:51,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140898266] [2025-04-13 22:58:51,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:51,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:51,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:51,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:58:51,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:58:51,235 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:58:51,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:58:51,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:51,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:51,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:58:51,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:58:51,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140898266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:58:51,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:58:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 11] total 22 [2025-04-13 22:58:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058179658] [2025-04-13 22:58:51,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:58:51,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:58:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:51,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:58:51,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:58:51,928 INFO L87 Difference]: Start difference. First operand 12971 states and 59014 transitions. Second operand has 22 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:26,843 INFO L93 Difference]: Finished difference Result 69631 states and 307232 transitions. [2025-04-13 22:59:26,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-04-13 22:59:26,843 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:59:26,843 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:27,247 INFO L225 Difference]: With dead ends: 69631 [2025-04-13 22:59:27,247 INFO L226 Difference]: Without dead ends: 64329 [2025-04-13 22:59:27,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8559 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3729, Invalid=18621, Unknown=0, NotChecked=0, Total=22350 [2025-04-13 22:59:27,281 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 848 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 6047 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 6148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 6047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:27,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1028 Invalid, 6148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 6047 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 22:59:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64329 states. [2025-04-13 22:59:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64329 to 20430. [2025-04-13 22:59:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20430 states, 20429 states have (on average 4.694405012482256) internal successors, (95902), 20429 states have internal predecessors, (95902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20430 states to 20430 states and 95902 transitions. [2025-04-13 22:59:35,310 INFO L79 Accepts]: Start accepts. Automaton has 20430 states and 95902 transitions. Word has length 39 [2025-04-13 22:59:35,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:35,310 INFO L485 AbstractCegarLoop]: Abstraction has 20430 states and 95902 transitions. [2025-04-13 22:59:35,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:35,310 INFO L278 IsEmpty]: Start isEmpty. Operand 20430 states and 95902 transitions. [2025-04-13 22:59:35,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:59:35,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:35,356 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] [2025-04-13 22:59:35,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:59:35,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 22:59:35,556 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:35,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1379800495, now seen corresponding path program 5 times [2025-04-13 22:59:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:35,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708680075] [2025-04-13 22:59:35,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:35,567 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:59:35,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:59:35,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:59:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:35,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708680075] [2025-04-13 22:59:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708680075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:35,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:35,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:59:35,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882632886] [2025-04-13 22:59:35,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:35,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:59:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:35,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:59:35,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:59:35,669 INFO L87 Difference]: Start difference. First operand 20430 states and 95902 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:54,139 INFO L93 Difference]: Finished difference Result 41136 states and 193278 transitions. [2025-04-13 22:59:54,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:54,140 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:59:54,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:54,338 INFO L225 Difference]: With dead ends: 41136 [2025-04-13 22:59:54,338 INFO L226 Difference]: Without dead ends: 39445 [2025-04-13 22:59:54,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:59:54,352 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:54,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 61 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39445 states. [2025-04-13 23:00:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39445 to 21196. [2025-04-13 23:00:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21196 states, 21195 states have (on average 4.74899740504836) internal successors, (100655), 21195 states have internal predecessors, (100655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21196 states to 21196 states and 100655 transitions. [2025-04-13 23:00:02,684 INFO L79 Accepts]: Start accepts. Automaton has 21196 states and 100655 transitions. Word has length 39 [2025-04-13 23:00:02,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:02,684 INFO L485 AbstractCegarLoop]: Abstraction has 21196 states and 100655 transitions. [2025-04-13 23:00:02,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:02,684 INFO L278 IsEmpty]: Start isEmpty. Operand 21196 states and 100655 transitions. [2025-04-13 23:00:02,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:00:02,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:02,735 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] [2025-04-13 23:00:02,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 23:00:02,735 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:00:02,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash 470249959, now seen corresponding path program 6 times [2025-04-13 23:00:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:02,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640127773] [2025-04-13 23:00:02,735 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:02,742 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:00:02,749 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:00:02,749 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:02,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:00:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:02,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640127773] [2025-04-13 23:00:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640127773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:00:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047514866] [2025-04-13 23:00:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:02,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:00:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:00:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:00:02,872 INFO L87 Difference]: Start difference. First operand 21196 states and 100655 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:15,190 INFO L93 Difference]: Finished difference Result 27428 states and 128752 transitions. [2025-04-13 23:00:15,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:00:15,190 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:00:15,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:15,330 INFO L225 Difference]: With dead ends: 27428 [2025-04-13 23:00:15,330 INFO L226 Difference]: Without dead ends: 25680 [2025-04-13 23:00:15,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:00:15,341 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:15,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 34 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25680 states. [2025-04-13 23:00:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25680 to 21113. [2025-04-13 23:00:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21113 states, 21112 states have (on average 4.723190602500948) internal successors, (99716), 21112 states have internal predecessors, (99716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21113 states to 21113 states and 99716 transitions. [2025-04-13 23:00:22,915 INFO L79 Accepts]: Start accepts. Automaton has 21113 states and 99716 transitions. Word has length 39 [2025-04-13 23:00:22,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:22,916 INFO L485 AbstractCegarLoop]: Abstraction has 21113 states and 99716 transitions. [2025-04-13 23:00:22,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:22,916 INFO L278 IsEmpty]: Start isEmpty. Operand 21113 states and 99716 transitions. [2025-04-13 23:00:22,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:00:22,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:22,956 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] [2025-04-13 23:00:22,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 23:00:22,957 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:00:22,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2125044699, now seen corresponding path program 4 times [2025-04-13 23:00:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:22,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246428418] [2025-04-13 23:00:22,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:22,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:00:22,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:00:22,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:00:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:23,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246428418] [2025-04-13 23:00:23,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246428418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:23,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:23,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:00:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313574465] [2025-04-13 23:00:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:23,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:00:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:23,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:00:23,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:00:23,042 INFO L87 Difference]: Start difference. First operand 21113 states and 99716 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:37,839 INFO L93 Difference]: Finished difference Result 33020 states and 154524 transitions. [2025-04-13 23:00:37,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:00:37,840 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:00:37,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:37,989 INFO L225 Difference]: With dead ends: 33020 [2025-04-13 23:00:37,989 INFO L226 Difference]: Without dead ends: 31879 [2025-04-13 23:00:37,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 23:00:38,000 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:38,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 71 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31879 states. [2025-04-13 23:00:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31879 to 19285. [2025-04-13 23:00:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19285 states, 19284 states have (on average 4.698350964530181) internal successors, (90603), 19284 states have internal predecessors, (90603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19285 states to 19285 states and 90603 transitions. [2025-04-13 23:00:45,348 INFO L79 Accepts]: Start accepts. Automaton has 19285 states and 90603 transitions. Word has length 39 [2025-04-13 23:00:45,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:45,349 INFO L485 AbstractCegarLoop]: Abstraction has 19285 states and 90603 transitions. [2025-04-13 23:00:45,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,349 INFO L278 IsEmpty]: Start isEmpty. Operand 19285 states and 90603 transitions. [2025-04-13 23:00:45,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:00:45,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:45,384 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] [2025-04-13 23:00:45,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 23:00:45,384 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:00:45,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1645555401, now seen corresponding path program 5 times [2025-04-13 23:00:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:45,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954361399] [2025-04-13 23:00:45,384 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:45,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:00:45,404 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:00:45,404 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:45,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:45,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954361399] [2025-04-13 23:00:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954361399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:00:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064019780] [2025-04-13 23:00:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:45,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:00:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:00:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:00:45,503 INFO L87 Difference]: Start difference. First operand 19285 states and 90603 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:08,642 INFO L93 Difference]: Finished difference Result 46505 states and 213770 transitions. [2025-04-13 23:01:08,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:01:08,643 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:01:08,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:08,852 INFO L225 Difference]: With dead ends: 46505 [2025-04-13 23:01:08,852 INFO L226 Difference]: Without dead ends: 45752 [2025-04-13 23:01:08,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:01:08,866 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 114 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:08,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 51 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:01:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45752 states. [2025-04-13 23:01:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45752 to 19026. [2025-04-13 23:01:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19026 states, 19025 states have (on average 4.698396846254928) internal successors, (89387), 19025 states have internal predecessors, (89387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19026 states to 19026 states and 89387 transitions. [2025-04-13 23:01:16,622 INFO L79 Accepts]: Start accepts. Automaton has 19026 states and 89387 transitions. Word has length 39 [2025-04-13 23:01:16,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:16,623 INFO L485 AbstractCegarLoop]: Abstraction has 19026 states and 89387 transitions. [2025-04-13 23:01:16,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:16,623 INFO L278 IsEmpty]: Start isEmpty. Operand 19026 states and 89387 transitions. [2025-04-13 23:01:16,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:01:16,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:16,658 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] [2025-04-13 23:01:16,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 23:01:16,658 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:01:16,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 281343821, now seen corresponding path program 7 times [2025-04-13 23:01:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:16,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367115488] [2025-04-13 23:01:16,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:16,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:01:16,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:01:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:01:16,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:16,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367115488] [2025-04-13 23:01:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367115488] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:16,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124505524] [2025-04-13 23:01:16,759 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:16,761 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:01:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:01:16,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:01:16,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:16,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:16,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 23:01:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:01:16,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:01:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124505524] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:17,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 22 [2025-04-13 23:01:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596517046] [2025-04-13 23:01:17,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:17,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:01:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:17,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:01:17,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:01:17,145 INFO L87 Difference]: Start difference. First operand 19026 states and 89387 transitions. Second operand has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:02,323 INFO L93 Difference]: Finished difference Result 71553 states and 318553 transitions. [2025-04-13 23:02:02,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-04-13 23:02:02,323 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:02:02,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:02,651 INFO L225 Difference]: With dead ends: 71553 [2025-04-13 23:02:02,651 INFO L226 Difference]: Without dead ends: 69554 [2025-04-13 23:02:02,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7945 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3853, Invalid=16739, Unknown=0, NotChecked=0, Total=20592 [2025-04-13 23:02:02,676 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 849 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 3688 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:02,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 793 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3688 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 23:02:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69554 states. [2025-04-13 23:02:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69554 to 21315. [2025-04-13 23:02:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21315 states, 21314 states have (on average 4.74617622220137) internal successors, (101160), 21314 states have internal predecessors, (101160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21315 states to 21315 states and 101160 transitions. [2025-04-13 23:02:12,402 INFO L79 Accepts]: Start accepts. Automaton has 21315 states and 101160 transitions. Word has length 39 [2025-04-13 23:02:12,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:12,402 INFO L485 AbstractCegarLoop]: Abstraction has 21315 states and 101160 transitions. [2025-04-13 23:02:12,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:12,402 INFO L278 IsEmpty]: Start isEmpty. Operand 21315 states and 101160 transitions. [2025-04-13 23:02:12,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:02:12,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:12,440 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] [2025-04-13 23:02:12,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:02:12,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 23:02:12,641 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:02:12,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 631473109, now seen corresponding path program 8 times [2025-04-13 23:02:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:12,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088192137] [2025-04-13 23:02:12,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:12,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:02:12,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:02:12,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:12,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:02:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:12,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088192137] [2025-04-13 23:02:12,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088192137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:02:12,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:02:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:02:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811522996] [2025-04-13 23:02:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:12,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:02:12,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:12,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:02:12,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:02:12,790 INFO L87 Difference]: Start difference. First operand 21315 states and 101160 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:24,519 INFO L93 Difference]: Finished difference Result 22146 states and 103838 transitions. [2025-04-13 23:02:24,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:02:24,519 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:02:24,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:24,623 INFO L225 Difference]: With dead ends: 22146 [2025-04-13 23:02:24,623 INFO L226 Difference]: Without dead ends: 21427 [2025-04-13 23:02:24,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:02:24,630 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:24,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:02:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21427 states. [2025-04-13 23:02:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21427 to 21303. [2025-04-13 23:02:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21303 states, 21302 states have (on average 4.745751572622289) internal successors, (101094), 21302 states have internal predecessors, (101094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21303 states to 21303 states and 101094 transitions. [2025-04-13 23:02:33,667 INFO L79 Accepts]: Start accepts. Automaton has 21303 states and 101094 transitions. Word has length 39 [2025-04-13 23:02:33,667 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:33,667 INFO L485 AbstractCegarLoop]: Abstraction has 21303 states and 101094 transitions. [2025-04-13 23:02:33,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:33,667 INFO L278 IsEmpty]: Start isEmpty. Operand 21303 states and 101094 transitions. [2025-04-13 23:02:33,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:02:33,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:33,709 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] [2025-04-13 23:02:33,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 23:02:33,709 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:02:33,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash -105631895, now seen corresponding path program 9 times [2025-04-13 23:02:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:33,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758284492] [2025-04-13 23:02:33,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:33,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:02:33,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:02:33,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:33,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:02:33,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:33,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758284492] [2025-04-13 23:02:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758284492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:02:33,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:02:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:02:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766910581] [2025-04-13 23:02:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:33,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:02:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:33,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:02:33,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:02:33,795 INFO L87 Difference]: Start difference. First operand 21303 states and 101094 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:45,813 INFO L93 Difference]: Finished difference Result 23391 states and 108776 transitions. [2025-04-13 23:02:45,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:02:45,813 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:02:45,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:45,919 INFO L225 Difference]: With dead ends: 23391 [2025-04-13 23:02:45,919 INFO L226 Difference]: Without dead ends: 21664 [2025-04-13 23:02:45,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:02:45,927 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:45,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 46 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:02:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21664 states. [2025-04-13 23:02:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21664 to 20562. [2025-04-13 23:02:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20562 states, 20561 states have (on average 4.7726764262438595) internal successors, (98131), 20561 states have internal predecessors, (98131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20562 states to 20562 states and 98131 transitions. [2025-04-13 23:02:54,610 INFO L79 Accepts]: Start accepts. Automaton has 20562 states and 98131 transitions. Word has length 39 [2025-04-13 23:02:54,611 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:54,611 INFO L485 AbstractCegarLoop]: Abstraction has 20562 states and 98131 transitions. [2025-04-13 23:02:54,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:54,611 INFO L278 IsEmpty]: Start isEmpty. Operand 20562 states and 98131 transitions. [2025-04-13 23:02:54,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 23:02:54,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:54,652 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] [2025-04-13 23:02:54,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 23:02:54,652 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:02:54,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1333416201, now seen corresponding path program 10 times [2025-04-13 23:02:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:54,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662885048] [2025-04-13 23:02:54,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:54,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 23:02:54,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:02:54,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:54,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:54,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662885048] [2025-04-13 23:02:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662885048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:02:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:02:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:02:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95728680] [2025-04-13 23:02:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:54,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:02:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:54,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:02:54,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:02:54,750 INFO L87 Difference]: Start difference. First operand 20562 states and 98131 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:08,647 INFO L93 Difference]: Finished difference Result 25491 states and 117484 transitions. [2025-04-13 23:03:08,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:03:08,647 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 23:03:08,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:08,768 INFO L225 Difference]: With dead ends: 25491 [2025-04-13 23:03:08,769 INFO L226 Difference]: Without dead ends: 24287 [2025-04-13 23:03:08,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:03:08,777 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:08,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24287 states. [2025-04-13 23:03:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24287 to 18316. [2025-04-13 23:03:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18316 states, 18315 states have (on average 4.772590772590773) internal successors, (87410), 18315 states have internal predecessors, (87410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18316 states to 18316 states and 87410 transitions. [2025-04-13 23:03:16,635 INFO L79 Accepts]: Start accepts. Automaton has 18316 states and 87410 transitions. Word has length 39 [2025-04-13 23:03:16,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:16,636 INFO L485 AbstractCegarLoop]: Abstraction has 18316 states and 87410 transitions. [2025-04-13 23:03:16,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:16,636 INFO L278 IsEmpty]: Start isEmpty. Operand 18316 states and 87410 transitions. [2025-04-13 23:03:16,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:03:16,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:16,670 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] [2025-04-13 23:03:16,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 23:03:16,670 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:03:16,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1723322657, now seen corresponding path program 1 times [2025-04-13 23:03:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:16,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938237070] [2025-04-13 23:03:16,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:16,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:03:16,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:03:16,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:16,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:17,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938237070] [2025-04-13 23:03:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938237070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:17,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600596486] [2025-04-13 23:03:17,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:17,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:17,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:03:17,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 23:03:17,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:03:17,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:17,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:17,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 23:03:17,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:17,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:03:17,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:17,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 23:03:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:17,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:18,130 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:18,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 164 [2025-04-13 23:03:18,171 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:18,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2025-04-13 23:03:18,212 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:18,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 285 treesize of output 293 [2025-04-13 23:03:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600596486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:19,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-04-13 23:03:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936354843] [2025-04-13 23:03:19,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:19,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:03:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:19,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:03:19,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:03:19,952 INFO L87 Difference]: Start difference. First operand 18316 states and 87410 transitions. Second operand has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:29,412 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:03:55,127 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:04:16,690 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:05:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:11,166 INFO L93 Difference]: Finished difference Result 144631 states and 688398 transitions. [2025-04-13 23:05:11,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:05:11,166 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 23:05:11,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:11,899 INFO L225 Difference]: With dead ends: 144631 [2025-04-13 23:05:11,899 INFO L226 Difference]: Without dead ends: 139998 [2025-04-13 23:05:11,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=826, Invalid=4576, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:05:11,948 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 1163 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 3713 mSolverCounterSat, 116 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3713 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:11,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1150 Invalid, 3831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3713 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2025-04-13 23:05:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139998 states. [2025-04-13 23:05:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139998 to 48101. [2025-04-13 23:05:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48101 states, 48100 states have (on average 4.9019334719334715) internal successors, (235783), 48100 states have internal predecessors, (235783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48101 states to 48101 states and 235783 transitions. [2025-04-13 23:05:40,991 INFO L79 Accepts]: Start accepts. Automaton has 48101 states and 235783 transitions. Word has length 42 [2025-04-13 23:05:40,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:40,991 INFO L485 AbstractCegarLoop]: Abstraction has 48101 states and 235783 transitions. [2025-04-13 23:05:40,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:40,991 INFO L278 IsEmpty]: Start isEmpty. Operand 48101 states and 235783 transitions. [2025-04-13 23:05:41,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 23:05:41,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:41,123 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] [2025-04-13 23:05:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:05:41,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-13 23:05:41,324 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:05:41,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1551620173, now seen corresponding path program 2 times [2025-04-13 23:05:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:41,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088761511] [2025-04-13 23:05:41,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:41,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 23:05:41,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:05:41,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:42,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:42,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088761511] [2025-04-13 23:05:42,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088761511] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:42,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462709175] [2025-04-13 23:05:42,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:42,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:42,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:42,247 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:42,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:05:42,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 23:05:42,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 23:05:42,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:42,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 23:05:42,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:42,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 23:05:42,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:05:42,444 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 23:05:42,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 23:05:42,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:05:43,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 23:05:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:43,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:45,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:45,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 210 [2025-04-13 23:05:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462709175] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:45,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 23:05:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799298222] [2025-04-13 23:05:45,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:45,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:05:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:05:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:05:45,466 INFO L87 Difference]: Start difference. First operand 48101 states and 235783 transitions. Second operand has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:57,990 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:14,758 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:27,747 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:31,786 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:47,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:49,717 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:06:58,343 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:07:02,381 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:07:12,197 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:07:24,802 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:08:08,989 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:08:13,015 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:08:18,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-13 23:08:37,599 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:08:37,599 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:08:37,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:08:37,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=598, Invalid=3051, Unknown=11, NotChecked=0, Total=3660 [2025-04-13 23:08:37,603 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 1092 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 136 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:37,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 844 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2274 Invalid, 10 Unknown, 0 Unchecked, 55.9s Time] [2025-04-13 23:08:37,607 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 23:08:37,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:37,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-13 23:08:37,809 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). [2025-04-13 23:08:37,811 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 23:08:37,811 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 23:08:37,811 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 23:08:37,811 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 23:08:37,821 INFO L422 BasicCegarLoop]: Path program histogram: [21, 11, 10, 5, 2, 1, 1, 1, 1, 1] [2025-04-13 23:08:37,832 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:08:37,832 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:08:37,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:08:37 BasicIcfg [2025-04-13 23:08:37,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:08:37,838 INFO L158 Benchmark]: Toolchain (without parser) took 800097.41ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 99.2MB in the beginning and 595.9MB in the end (delta: -496.7MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 23:08:37,838 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:08:37,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.59ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 82.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:08:37,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.51ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:08:37,840 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.5MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:08:37,840 INFO L158 Benchmark]: IcfgBuilder took 807.69ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 44.8MB in the end (delta: 32.7MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-13 23:08:37,840 INFO L158 Benchmark]: TraceAbstraction took 798891.11ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 44.1MB in the beginning and 595.9MB in the end (delta: -551.8MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 23:08:37,841 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.59ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 82.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.51ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.5MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 807.69ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 44.8MB in the end (delta: 32.7MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 798891.11ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 44.1MB in the beginning and 595.9MB in the end (delta: -551.8MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (48101states) and FLOYD_HOARE automaton (currently 40 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (78695 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 70 locations, 79 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 798.8s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 1.5s, AutomataDifference: 605.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 12611 SdHoareTripleChecker+Valid, 85.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12611 mSDsluCounter, 8738 SdHoareTripleChecker+Invalid, 81.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7306 mSDsCounter, 813 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35778 IncrementalHoareTripleChecker+Invalid, 36603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 813 mSolverCounterUnsat, 1432 mSDtfsCounter, 35778 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2052 GetRequests, 883 SyntacticMatches, 3 SemanticMatches, 1166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45189 ImplicationChecksByTransitivity, 67.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48101occurred in iteration=53, InterpolantAutomatonStates: 1084, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 168.7s AutomataMinimizationTime, 53 MinimizatonAttempts, 420555 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2362 NumberOfCodeBlocks, 2299 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 2633 ConstructedInterpolants, 45 QuantifiedInterpolants, 26576 SizeOfPredicates, 110 NumberOfNonLiveVariables, 3216 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 74 InterpolantComputations, 47 PerfectInterpolantSequences, 174/222 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown