/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-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:08:03,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:08:03,507 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 23:08:03,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:08:03,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:08:03,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:08:03,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:08:03,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:08:03,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:08:03,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:08:03,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:08:03,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:08:03,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:08:03,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:08:03,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:08:03,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:08:03,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:03,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:03,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:08:03,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:08:03,536 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 23:08:03,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:08:03,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:08:03,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:08:03,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:08:03,757 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:08:03,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 23:08:05,080 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5b17799/f3e7bab8626c4f779dabe8ab8721ddf1/FLAG040ffd140 [2025-04-13 23:08:05,294 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:08:05,295 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 23:08:05,305 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5b17799/f3e7bab8626c4f779dabe8ab8721ddf1/FLAG040ffd140 [2025-04-13 23:08:06,281 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5b17799/f3e7bab8626c4f779dabe8ab8721ddf1 [2025-04-13 23:08:06,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:08:06,285 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:08:06,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:08:06,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:08:06,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:08:06,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c69263b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06, skipping insertion in model container [2025-04-13 23:08:06,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:08:06,442 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-mult-4.wvr.c[2664,2677] [2025-04-13 23:08:06,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:08:06,452 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:08:06,479 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-mult-4.wvr.c[2664,2677] [2025-04-13 23:08:06,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:08:06,493 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:08:06,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06 WrapperNode [2025-04-13 23:08:06,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:08:06,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:08:06,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:08:06,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:08:06,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,518 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2025-04-13 23:08:06,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:08:06,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:08:06,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:08:06,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:08:06,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:08:06,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:08:06,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:08:06,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:08:06,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:08:06,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (1/1) ... [2025-04-13 23:08:06,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:06,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:06,570 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 23:08:06,575 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 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:08:06,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:08:06,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:08:06,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 23:08:06,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:08:06,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:08:06,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:08:06,594 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 23:08:06,667 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:08:06,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:08:06,850 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:08:06,850 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:08:06,850 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:08:06,993 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:08:07,001 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:08:07,004 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:08:07,008 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:08:07,012 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:08:07,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:08:07 BoogieIcfgContainer [2025-04-13 23:08:07,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:08:07,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:08:07,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:08:07,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:08:07,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:08:06" (1/3) ... [2025-04-13 23:08:07,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e934993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:08:07, skipping insertion in model container [2025-04-13 23:08:07,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:06" (2/3) ... [2025-04-13 23:08:07,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e934993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:08:07, skipping insertion in model container [2025-04-13 23:08:07,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:08:07" (3/3) ... [2025-04-13 23:08:07,018 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-04-13 23:08:07,028 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:08:07,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 32 locations, 35 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 23:08:07,029 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:08:07,083 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 23:08:07,106 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 23:08:07,175 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:07,196 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:08:07,203 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;@33c26eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:08:07,203 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:08:07,207 INFO L278 IsEmpty]: Start isEmpty. Operand has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:07,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:08:07,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:07,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:07,219 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 23:08:07,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 710062987, now seen corresponding path program 1 times [2025-04-13 23:08:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:07,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176830874] [2025-04-13 23:08:07,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:07,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:07,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:08:07,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:08:07,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:07,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:07,565 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 23:08:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:07,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176830874] [2025-04-13 23:08:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176830874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:08:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049643992] [2025-04-13 23:08:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:07,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:08:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:07,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:08:07,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:07,593 INFO L87 Difference]: Start difference. First operand has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 0 states have call successors, (0), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:07,748 INFO L93 Difference]: Finished difference Result 1680 states and 8215 transitions. [2025-04-13 23:08:07,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:08:07,750 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:08:07,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:07,775 INFO L225 Difference]: With dead ends: 1680 [2025-04-13 23:08:07,775 INFO L226 Difference]: Without dead ends: 958 [2025-04-13 23:08:07,779 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 23:08:07,783 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:07,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-04-13 23:08:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 946. [2025-04-13 23:08:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.706878306878306) internal successors, (4448), 945 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 4448 transitions. [2025-04-13 23:08:07,872 INFO L79 Accepts]: Start accepts. Automaton has 946 states and 4448 transitions. Word has length 18 [2025-04-13 23:08:07,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:07,872 INFO L485 AbstractCegarLoop]: Abstraction has 946 states and 4448 transitions. [2025-04-13 23:08:07,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:07,874 INFO L278 IsEmpty]: Start isEmpty. Operand 946 states and 4448 transitions. [2025-04-13 23:08:07,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:08:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:07,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:07,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:08:07,879 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 23:08:07,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 438752264, now seen corresponding path program 1 times [2025-04-13 23:08:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:07,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998969868] [2025-04-13 23:08:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:07,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:08:07,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:08:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:07,959 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 23:08:07,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:07,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998969868] [2025-04-13 23:08:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998969868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:08:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256922313] [2025-04-13 23:08:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:07,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:08:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:07,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:08:07,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:07,961 INFO L87 Difference]: Start difference. First operand 946 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:08,105 INFO L93 Difference]: Finished difference Result 1954 states and 8638 transitions. [2025-04-13 23:08:08,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:08:08,106 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:08:08,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:08,116 INFO L225 Difference]: With dead ends: 1954 [2025-04-13 23:08:08,116 INFO L226 Difference]: Without dead ends: 1307 [2025-04-13 23:08:08,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:08,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:08,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-04-13 23:08:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1256. [2025-04-13 23:08:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1255 states have (on average 4.165737051792829) internal successors, (5228), 1255 states have internal predecessors, (5228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 5228 transitions. [2025-04-13 23:08:08,158 INFO L79 Accepts]: Start accepts. Automaton has 1256 states and 5228 transitions. Word has length 20 [2025-04-13 23:08:08,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:08,158 INFO L485 AbstractCegarLoop]: Abstraction has 1256 states and 5228 transitions. [2025-04-13 23:08:08,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,159 INFO L278 IsEmpty]: Start isEmpty. Operand 1256 states and 5228 transitions. [2025-04-13 23:08:08,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:08:08,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:08,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:08,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:08:08,163 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 23:08:08,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1015151000, now seen corresponding path program 2 times [2025-04-13 23:08:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:08,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594176820] [2025-04-13 23:08:08,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:08,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:08:08,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:08:08,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:08:08,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:08,216 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 23:08:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:08,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594176820] [2025-04-13 23:08:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594176820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:08:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668746029] [2025-04-13 23:08:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:08,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:08:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:08:08,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:08,217 INFO L87 Difference]: Start difference. First operand 1256 states and 5228 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:08,286 INFO L93 Difference]: Finished difference Result 1263 states and 5234 transitions. [2025-04-13 23:08:08,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:08:08,286 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:08:08,286 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:08,293 INFO L225 Difference]: With dead ends: 1263 [2025-04-13 23:08:08,294 INFO L226 Difference]: Without dead ends: 778 [2025-04-13 23:08:08,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:08,297 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:08,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-04-13 23:08:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2025-04-13 23:08:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 4.164736164736165) internal successors, (3236), 777 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3236 transitions. [2025-04-13 23:08:08,319 INFO L79 Accepts]: Start accepts. Automaton has 778 states and 3236 transitions. Word has length 20 [2025-04-13 23:08:08,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:08,319 INFO L485 AbstractCegarLoop]: Abstraction has 778 states and 3236 transitions. [2025-04-13 23:08:08,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,320 INFO L278 IsEmpty]: Start isEmpty. Operand 778 states and 3236 transitions. [2025-04-13 23:08:08,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:08,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:08,322 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] [2025-04-13 23:08:08,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:08:08,322 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 23:08:08,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1473607639, now seen corresponding path program 1 times [2025-04-13 23:08:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:08,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333248617] [2025-04-13 23:08:08,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:08,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:08:08,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:08,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:08,480 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 23:08:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:08,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333248617] [2025-04-13 23:08:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333248617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:08,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:08:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619128025] [2025-04-13 23:08:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:08,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:08:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:08,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:08:08,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:08:08,481 INFO L87 Difference]: Start difference. First operand 778 states and 3236 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:08,600 INFO L93 Difference]: Finished difference Result 2755 states and 11672 transitions. [2025-04-13 23:08:08,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:08:08,601 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:08:08,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:08,614 INFO L225 Difference]: With dead ends: 2755 [2025-04-13 23:08:08,614 INFO L226 Difference]: Without dead ends: 2012 [2025-04-13 23:08:08,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 23:08:08,619 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:08,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2025-04-13 23:08:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1919. [2025-04-13 23:08:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1918 states have (on average 4.1616266944734095) internal successors, (7982), 1918 states have internal predecessors, (7982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 7982 transitions. [2025-04-13 23:08:08,673 INFO L79 Accepts]: Start accepts. Automaton has 1919 states and 7982 transitions. Word has length 26 [2025-04-13 23:08:08,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:08,673 INFO L485 AbstractCegarLoop]: Abstraction has 1919 states and 7982 transitions. [2025-04-13 23:08:08,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:08,674 INFO L278 IsEmpty]: Start isEmpty. Operand 1919 states and 7982 transitions. [2025-04-13 23:08:08,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:08,679 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] [2025-04-13 23:08:08,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:08:08,679 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 23:08:08,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1217873817, now seen corresponding path program 2 times [2025-04-13 23:08:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:08,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034949403] [2025-04-13 23:08:08,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:08,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:08:08,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:08,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:08:08,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:08,873 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 23:08:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:08,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034949403] [2025-04-13 23:08:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034949403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:08,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:08:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293566268] [2025-04-13 23:08:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:08,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:08,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:08,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:08,875 INFO L87 Difference]: Start difference. First operand 1919 states and 7982 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:09,068 INFO L93 Difference]: Finished difference Result 4554 states and 19231 transitions. [2025-04-13 23:08:09,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:09,069 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:08:09,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:09,094 INFO L225 Difference]: With dead ends: 4554 [2025-04-13 23:08:09,094 INFO L226 Difference]: Without dead ends: 3795 [2025-04-13 23:08:09,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:09,097 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:09,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2025-04-13 23:08:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 2578. [2025-04-13 23:08:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 4.207993791230113) internal successors, (10844), 2577 states have internal predecessors, (10844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 10844 transitions. [2025-04-13 23:08:09,213 INFO L79 Accepts]: Start accepts. Automaton has 2578 states and 10844 transitions. Word has length 26 [2025-04-13 23:08:09,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:09,213 INFO L485 AbstractCegarLoop]: Abstraction has 2578 states and 10844 transitions. [2025-04-13 23:08:09,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:09,214 INFO L278 IsEmpty]: Start isEmpty. Operand 2578 states and 10844 transitions. [2025-04-13 23:08:09,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:09,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:09,223 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:09,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:08:09,223 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 23:08:09,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1101659210, now seen corresponding path program 1 times [2025-04-13 23:08:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:09,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646180060] [2025-04-13 23:08:09,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:09,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:09,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:09,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:09,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:09,401 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 23:08:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:09,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646180060] [2025-04-13 23:08:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646180060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656014799] [2025-04-13 23:08:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:09,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:09,403 INFO L87 Difference]: Start difference. First operand 2578 states and 10844 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:09,596 INFO L93 Difference]: Finished difference Result 5031 states and 21815 transitions. [2025-04-13 23:08:09,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:09,597 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:09,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:09,631 INFO L225 Difference]: With dead ends: 5031 [2025-04-13 23:08:09,631 INFO L226 Difference]: Without dead ends: 4573 [2025-04-13 23:08:09,634 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:09,634 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:09,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2025-04-13 23:08:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3630. [2025-04-13 23:08:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 4.317167263709011) internal successors, (15667), 3629 states have internal predecessors, (15667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 15667 transitions. [2025-04-13 23:08:09,761 INFO L79 Accepts]: Start accepts. Automaton has 3630 states and 15667 transitions. Word has length 28 [2025-04-13 23:08:09,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:09,761 INFO L485 AbstractCegarLoop]: Abstraction has 3630 states and 15667 transitions. [2025-04-13 23:08:09,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:09,761 INFO L278 IsEmpty]: Start isEmpty. Operand 3630 states and 15667 transitions. [2025-04-13 23:08:09,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:09,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:09,773 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:09,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:08:09,773 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 23:08:09,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1625510888, now seen corresponding path program 1 times [2025-04-13 23:08:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:09,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974414139] [2025-04-13 23:08:09,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:09,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:09,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:09,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:09,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:09,919 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 23:08:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:09,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974414139] [2025-04-13 23:08:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974414139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210823576] [2025-04-13 23:08:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:09,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:09,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:09,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:09,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:09,920 INFO L87 Difference]: Start difference. First operand 3630 states and 15667 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:10,127 INFO L93 Difference]: Finished difference Result 6216 states and 25877 transitions. [2025-04-13 23:08:10,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:10,128 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:10,152 INFO L225 Difference]: With dead ends: 6216 [2025-04-13 23:08:10,152 INFO L226 Difference]: Without dead ends: 5532 [2025-04-13 23:08:10,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:10,158 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:10,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2025-04-13 23:08:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5042. [2025-04-13 23:08:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5042 states, 5041 states have (on average 4.311247768299941) internal successors, (21733), 5041 states have internal predecessors, (21733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 21733 transitions. [2025-04-13 23:08:10,295 INFO L79 Accepts]: Start accepts. Automaton has 5042 states and 21733 transitions. Word has length 28 [2025-04-13 23:08:10,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:10,296 INFO L485 AbstractCegarLoop]: Abstraction has 5042 states and 21733 transitions. [2025-04-13 23:08:10,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,296 INFO L278 IsEmpty]: Start isEmpty. Operand 5042 states and 21733 transitions. [2025-04-13 23:08:10,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:10,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:10,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:10,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:08:10,309 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 23:08:10,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 290065602, now seen corresponding path program 2 times [2025-04-13 23:08:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:10,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111776177] [2025-04-13 23:08:10,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:10,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:10,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:10,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:08:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:10,485 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 23:08:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:10,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111776177] [2025-04-13 23:08:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111776177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207386464] [2025-04-13 23:08:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:10,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:10,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:10,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:10,486 INFO L87 Difference]: Start difference. First operand 5042 states and 21733 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:10,633 INFO L93 Difference]: Finished difference Result 6405 states and 27401 transitions. [2025-04-13 23:08:10,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:10,633 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:10,661 INFO L225 Difference]: With dead ends: 6405 [2025-04-13 23:08:10,663 INFO L226 Difference]: Without dead ends: 5813 [2025-04-13 23:08:10,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:08:10,667 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:10,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2025-04-13 23:08:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 5546. [2025-04-13 23:08:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5546 states, 5545 states have (on average 4.339585211902615) internal successors, (24063), 5545 states have internal predecessors, (24063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 24063 transitions. [2025-04-13 23:08:10,797 INFO L79 Accepts]: Start accepts. Automaton has 5546 states and 24063 transitions. Word has length 28 [2025-04-13 23:08:10,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:10,797 INFO L485 AbstractCegarLoop]: Abstraction has 5546 states and 24063 transitions. [2025-04-13 23:08:10,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:10,798 INFO L278 IsEmpty]: Start isEmpty. Operand 5546 states and 24063 transitions. [2025-04-13 23:08:10,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:10,810 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:10,810 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:10,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:08:10,810 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 23:08:10,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1359569276, now seen corresponding path program 3 times [2025-04-13 23:08:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:10,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950273263] [2025-04-13 23:08:10,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:10,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:10,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:10,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:11,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950273263] [2025-04-13 23:08:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950273263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:11,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960507858] [2025-04-13 23:08:11,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:11,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:11,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:11,017 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 23:08:11,018 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 23:08:11,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:11,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:11,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:11,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:11,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:11,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:11,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960507858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:11,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 23:08:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31968016] [2025-04-13 23:08:11,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:11,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:08:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:08:11,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:08:11,193 INFO L87 Difference]: Start difference. First operand 5546 states and 24063 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:11,498 INFO L93 Difference]: Finished difference Result 8266 states and 36517 transitions. [2025-04-13 23:08:11,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:11,498 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:11,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:11,530 INFO L225 Difference]: With dead ends: 8266 [2025-04-13 23:08:11,530 INFO L226 Difference]: Without dead ends: 7706 [2025-04-13 23:08:11,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:08:11,536 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:11,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2025-04-13 23:08:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 6618. [2025-04-13 23:08:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6618 states, 6617 states have (on average 4.3870333988212185) internal successors, (29029), 6617 states have internal predecessors, (29029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 29029 transitions. [2025-04-13 23:08:11,755 INFO L79 Accepts]: Start accepts. Automaton has 6618 states and 29029 transitions. Word has length 28 [2025-04-13 23:08:11,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:11,756 INFO L485 AbstractCegarLoop]: Abstraction has 6618 states and 29029 transitions. [2025-04-13 23:08:11,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,756 INFO L278 IsEmpty]: Start isEmpty. Operand 6618 states and 29029 transitions. [2025-04-13 23:08:11,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:11,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:11,775 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:11,782 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 23:08:11,975 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 23:08:11,976 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 23:08:11,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1200454518, now seen corresponding path program 2 times [2025-04-13 23:08:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:11,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681067979] [2025-04-13 23:08:11,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:11,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:12,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:12,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,145 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 23:08:12,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:12,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681067979] [2025-04-13 23:08:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681067979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:08:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546293825] [2025-04-13 23:08:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:12,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:12,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:12,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:12,146 INFO L87 Difference]: Start difference. First operand 6618 states and 29029 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:12,391 INFO L93 Difference]: Finished difference Result 7544 states and 32142 transitions. [2025-04-13 23:08:12,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:08:12,392 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:12,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:12,428 INFO L225 Difference]: With dead ends: 7544 [2025-04-13 23:08:12,428 INFO L226 Difference]: Without dead ends: 6970 [2025-04-13 23:08:12,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:12,432 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:12,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2025-04-13 23:08:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6823. [2025-04-13 23:08:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6823 states, 6822 states have (on average 4.3523893286426265) internal successors, (29692), 6822 states have internal predecessors, (29692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6823 states to 6823 states and 29692 transitions. [2025-04-13 23:08:12,583 INFO L79 Accepts]: Start accepts. Automaton has 6823 states and 29692 transitions. Word has length 28 [2025-04-13 23:08:12,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:12,584 INFO L485 AbstractCegarLoop]: Abstraction has 6823 states and 29692 transitions. [2025-04-13 23:08:12,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:12,584 INFO L278 IsEmpty]: Start isEmpty. Operand 6823 states and 29692 transitions. [2025-04-13 23:08:12,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:12,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:12,639 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:12,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:08:12,641 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 23:08:12,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 110982868, now seen corresponding path program 3 times [2025-04-13 23:08:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:12,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200899240] [2025-04-13 23:08:12,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:12,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:12,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:12,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,757 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 23:08:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:12,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200899240] [2025-04-13 23:08:12,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200899240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:12,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:08:12,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898868224] [2025-04-13 23:08:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:12,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:08:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:12,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:08:12,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:12,758 INFO L87 Difference]: Start difference. First operand 6823 states and 29692 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:13,000 INFO L93 Difference]: Finished difference Result 7403 states and 31444 transitions. [2025-04-13 23:08:13,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:13,001 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:13,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:13,027 INFO L225 Difference]: With dead ends: 7403 [2025-04-13 23:08:13,027 INFO L226 Difference]: Without dead ends: 7009 [2025-04-13 23:08:13,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:08:13,030 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:13,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7009 states. [2025-04-13 23:08:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7009 to 6839. [2025-04-13 23:08:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6839 states, 6838 states have (on average 4.355367066393683) internal successors, (29782), 6838 states have internal predecessors, (29782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6839 states to 6839 states and 29782 transitions. [2025-04-13 23:08:13,192 INFO L79 Accepts]: Start accepts. Automaton has 6839 states and 29782 transitions. Word has length 28 [2025-04-13 23:08:13,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:13,192 INFO L485 AbstractCegarLoop]: Abstraction has 6839 states and 29782 transitions. [2025-04-13 23:08:13,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:13,192 INFO L278 IsEmpty]: Start isEmpty. Operand 6839 states and 29782 transitions. [2025-04-13 23:08:13,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:13,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:13,208 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:13,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:08:13,208 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 23:08:13,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1484094908, now seen corresponding path program 4 times [2025-04-13 23:08:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:13,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804132149] [2025-04-13 23:08:13,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:13,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:13,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:13,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:13,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:13,399 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 23:08:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:13,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804132149] [2025-04-13 23:08:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804132149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:08:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702969287] [2025-04-13 23:08:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:13,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:13,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:13,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:13,400 INFO L87 Difference]: Start difference. First operand 6839 states and 29782 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:13,658 INFO L93 Difference]: Finished difference Result 9914 states and 44743 transitions. [2025-04-13 23:08:13,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:08:13,658 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:13,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:13,694 INFO L225 Difference]: With dead ends: 9914 [2025-04-13 23:08:13,694 INFO L226 Difference]: Without dead ends: 9176 [2025-04-13 23:08:13,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:13,699 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:13,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2025-04-13 23:08:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 8023. [2025-04-13 23:08:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8022 states have (on average 4.474694589877836) internal successors, (35896), 8022 states have internal predecessors, (35896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 35896 transitions. [2025-04-13 23:08:13,898 INFO L79 Accepts]: Start accepts. Automaton has 8023 states and 35896 transitions. Word has length 28 [2025-04-13 23:08:13,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:13,899 INFO L485 AbstractCegarLoop]: Abstraction has 8023 states and 35896 transitions. [2025-04-13 23:08:13,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:13,899 INFO L278 IsEmpty]: Start isEmpty. Operand 8023 states and 35896 transitions. [2025-04-13 23:08:13,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:13,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:13,919 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:13,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:08:13,919 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 23:08:13,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -294895714, now seen corresponding path program 5 times [2025-04-13 23:08:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:13,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458394828] [2025-04-13 23:08:13,920 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:13,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:13,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:13,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:13,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:13,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458394828] [2025-04-13 23:08:13,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458394828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:13,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395516102] [2025-04-13 23:08:13,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:13,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:13,992 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 23:08:13,993 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 23:08:14,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:14,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:14,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:14,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:14,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395516102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:14,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 23:08:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852557714] [2025-04-13 23:08:14,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:14,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:08:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:08:14,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:14,167 INFO L87 Difference]: Start difference. First operand 8023 states and 35896 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:14,523 INFO L93 Difference]: Finished difference Result 17274 states and 81533 transitions. [2025-04-13 23:08:14,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:14,523 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:14,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:14,580 INFO L225 Difference]: With dead ends: 17274 [2025-04-13 23:08:14,581 INFO L226 Difference]: Without dead ends: 16117 [2025-04-13 23:08:14,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:08:14,588 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:14,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2025-04-13 23:08:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 12356. [2025-04-13 23:08:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12356 states, 12355 states have (on average 4.654876568191016) internal successors, (57511), 12355 states have internal predecessors, (57511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12356 states to 12356 states and 57511 transitions. [2025-04-13 23:08:15,005 INFO L79 Accepts]: Start accepts. Automaton has 12356 states and 57511 transitions. Word has length 28 [2025-04-13 23:08:15,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:15,006 INFO L485 AbstractCegarLoop]: Abstraction has 12356 states and 57511 transitions. [2025-04-13 23:08:15,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:15,006 INFO L278 IsEmpty]: Start isEmpty. Operand 12356 states and 57511 transitions. [2025-04-13 23:08:15,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:15,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:15,045 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:15,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:15,250 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,SelfDestructingSolverStorable12 [2025-04-13 23:08:15,250 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 23:08:15,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash -835645068, now seen corresponding path program 6 times [2025-04-13 23:08:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:15,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956489692] [2025-04-13 23:08:15,250 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:15,258 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:15,269 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:15,269 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:15,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:15,406 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 23:08:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:15,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956489692] [2025-04-13 23:08:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956489692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:15,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:15,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:08:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769923538] [2025-04-13 23:08:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:15,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:08:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:15,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:08:15,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:15,409 INFO L87 Difference]: Start difference. First operand 12356 states and 57511 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:15,725 INFO L93 Difference]: Finished difference Result 15405 states and 72853 transitions. [2025-04-13 23:08:15,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:15,726 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:15,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:15,793 INFO L225 Difference]: With dead ends: 15405 [2025-04-13 23:08:15,793 INFO L226 Difference]: Without dead ends: 15157 [2025-04-13 23:08:15,799 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:15,800 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:15,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15157 states. [2025-04-13 23:08:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15157 to 12392. [2025-04-13 23:08:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12392 states, 12391 states have (on average 4.655072229844242) internal successors, (57681), 12391 states have internal predecessors, (57681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 57681 transitions. [2025-04-13 23:08:16,206 INFO L79 Accepts]: Start accepts. Automaton has 12392 states and 57681 transitions. Word has length 28 [2025-04-13 23:08:16,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:16,207 INFO L485 AbstractCegarLoop]: Abstraction has 12392 states and 57681 transitions. [2025-04-13 23:08:16,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:16,207 INFO L278 IsEmpty]: Start isEmpty. Operand 12392 states and 57681 transitions. [2025-04-13 23:08:16,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:16,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:16,232 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:16,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:08:16,233 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 23:08:16,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2011135712, now seen corresponding path program 7 times [2025-04-13 23:08:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:16,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366415722] [2025-04-13 23:08:16,233 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:16,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:16,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:16,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:16,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:16,309 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 23:08:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:16,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366415722] [2025-04-13 23:08:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366415722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:16,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147360576] [2025-04-13 23:08:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:16,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:16,310 INFO L87 Difference]: Start difference. First operand 12392 states and 57681 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:16,534 INFO L93 Difference]: Finished difference Result 17740 states and 82785 transitions. [2025-04-13 23:08:16,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:16,535 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:16,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:16,605 INFO L225 Difference]: With dead ends: 17740 [2025-04-13 23:08:16,605 INFO L226 Difference]: Without dead ends: 16737 [2025-04-13 23:08:16,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:16,613 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:16,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16737 states. [2025-04-13 23:08:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16737 to 15024. [2025-04-13 23:08:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15024 states, 15023 states have (on average 4.803168475004992) internal successors, (72158), 15023 states have internal predecessors, (72158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15024 states to 15024 states and 72158 transitions. [2025-04-13 23:08:17,066 INFO L79 Accepts]: Start accepts. Automaton has 15024 states and 72158 transitions. Word has length 28 [2025-04-13 23:08:17,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:17,066 INFO L485 AbstractCegarLoop]: Abstraction has 15024 states and 72158 transitions. [2025-04-13 23:08:17,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:17,067 INFO L278 IsEmpty]: Start isEmpty. Operand 15024 states and 72158 transitions. [2025-04-13 23:08:17,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:17,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:17,193 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:17,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:08:17,193 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 23:08:17,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1834914122, now seen corresponding path program 8 times [2025-04-13 23:08:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:17,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501476648] [2025-04-13 23:08:17,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:17,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:17,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:17,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:17,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:17,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501476648] [2025-04-13 23:08:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501476648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:17,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138360577] [2025-04-13 23:08:17,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:17,293 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 23:08:17,294 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 23:08:17,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:17,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:17,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:17,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:17,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:17,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:17,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138360577] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 23:08:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93087185] [2025-04-13 23:08:17,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:17,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:08:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:08:17,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:17,431 INFO L87 Difference]: Start difference. First operand 15024 states and 72158 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:18,057 INFO L93 Difference]: Finished difference Result 25526 states and 123626 transitions. [2025-04-13 23:08:18,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:18,058 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:18,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:18,199 INFO L225 Difference]: With dead ends: 25526 [2025-04-13 23:08:18,200 INFO L226 Difference]: Without dead ends: 23407 [2025-04-13 23:08:18,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:08:18,214 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:18,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23407 states. [2025-04-13 23:08:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23407 to 17027. [2025-04-13 23:08:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17027 states, 17026 states have (on average 4.849348055914484) internal successors, (82565), 17026 states have internal predecessors, (82565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 82565 transitions. [2025-04-13 23:08:18,697 INFO L79 Accepts]: Start accepts. Automaton has 17027 states and 82565 transitions. Word has length 28 [2025-04-13 23:08:18,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:18,698 INFO L485 AbstractCegarLoop]: Abstraction has 17027 states and 82565 transitions. [2025-04-13 23:08:18,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:18,698 INFO L278 IsEmpty]: Start isEmpty. Operand 17027 states and 82565 transitions. [2025-04-13 23:08:18,735 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:18,735 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:18,736 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:18,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:18,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:18,936 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 23:08:18,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash 418593910, now seen corresponding path program 4 times [2025-04-13 23:08:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:18,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056536471] [2025-04-13 23:08:18,937 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:18,942 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:18,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:18,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:19,128 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 23:08:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:19,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056536471] [2025-04-13 23:08:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056536471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:19,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:08:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103275726] [2025-04-13 23:08:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:19,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:08:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:19,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:08:19,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:19,129 INFO L87 Difference]: Start difference. First operand 17027 states and 82565 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:19,435 INFO L93 Difference]: Finished difference Result 20746 states and 96789 transitions. [2025-04-13 23:08:19,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:19,435 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:19,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:19,509 INFO L225 Difference]: With dead ends: 20746 [2025-04-13 23:08:19,509 INFO L226 Difference]: Without dead ends: 19066 [2025-04-13 23:08:19,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:19,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:19,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19066 states. [2025-04-13 23:08:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19066 to 18031. [2025-04-13 23:08:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 18030 states have (on average 4.801109262340543) internal successors, (86564), 18030 states have internal predecessors, (86564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 86564 transitions. [2025-04-13 23:08:20,009 INFO L79 Accepts]: Start accepts. Automaton has 18031 states and 86564 transitions. Word has length 28 [2025-04-13 23:08:20,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:20,009 INFO L485 AbstractCegarLoop]: Abstraction has 18031 states and 86564 transitions. [2025-04-13 23:08:20,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:20,009 INFO L278 IsEmpty]: Start isEmpty. Operand 18031 states and 86564 transitions. [2025-04-13 23:08:20,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:20,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:20,054 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:20,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:08:20,054 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 23:08:20,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1700756804, now seen corresponding path program 5 times [2025-04-13 23:08:20,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:20,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728125851] [2025-04-13 23:08:20,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:20,058 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:20,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:20,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:20,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:20,105 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 23:08:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:20,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728125851] [2025-04-13 23:08:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728125851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601471809] [2025-04-13 23:08:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:20,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:20,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:20,106 INFO L87 Difference]: Start difference. First operand 18031 states and 86564 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:20,360 INFO L93 Difference]: Finished difference Result 23372 states and 111753 transitions. [2025-04-13 23:08:20,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:20,361 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:20,361 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:20,613 INFO L225 Difference]: With dead ends: 23372 [2025-04-13 23:08:20,614 INFO L226 Difference]: Without dead ends: 22449 [2025-04-13 23:08:20,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:20,619 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:20,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22449 states. [2025-04-13 23:08:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22449 to 19495. [2025-04-13 23:08:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19495 states, 19494 states have (on average 4.852005745357546) internal successors, (94585), 19494 states have internal predecessors, (94585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 94585 transitions. [2025-04-13 23:08:21,136 INFO L79 Accepts]: Start accepts. Automaton has 19495 states and 94585 transitions. Word has length 28 [2025-04-13 23:08:21,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:21,136 INFO L485 AbstractCegarLoop]: Abstraction has 19495 states and 94585 transitions. [2025-04-13 23:08:21,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:21,136 INFO L278 IsEmpty]: Start isEmpty. Operand 19495 states and 94585 transitions. [2025-04-13 23:08:21,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:21,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:21,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:21,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:08:21,202 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 23:08:21,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2132369414, now seen corresponding path program 6 times [2025-04-13 23:08:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:21,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957217262] [2025-04-13 23:08:21,202 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:21,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:21,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:21,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:08:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:21,308 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 23:08:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:21,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957217262] [2025-04-13 23:08:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957217262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:21,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587648559] [2025-04-13 23:08:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:21,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:21,309 INFO L87 Difference]: Start difference. First operand 19495 states and 94585 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:21,674 INFO L93 Difference]: Finished difference Result 24591 states and 118916 transitions. [2025-04-13 23:08:21,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:21,675 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:21,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:21,769 INFO L225 Difference]: With dead ends: 24591 [2025-04-13 23:08:21,769 INFO L226 Difference]: Without dead ends: 23705 [2025-04-13 23:08:21,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:21,777 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:21,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23705 states. [2025-04-13 23:08:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23705 to 20513. [2025-04-13 23:08:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20513 states, 20512 states have (on average 4.857108034321373) internal successors, (99629), 20512 states have internal predecessors, (99629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 99629 transitions. [2025-04-13 23:08:22,387 INFO L79 Accepts]: Start accepts. Automaton has 20513 states and 99629 transitions. Word has length 28 [2025-04-13 23:08:22,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:22,387 INFO L485 AbstractCegarLoop]: Abstraction has 20513 states and 99629 transitions. [2025-04-13 23:08:22,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:22,387 INFO L278 IsEmpty]: Start isEmpty. Operand 20513 states and 99629 transitions. [2025-04-13 23:08:22,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:22,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:22,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:22,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:08:22,445 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 23:08:22,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1834126560, now seen corresponding path program 7 times [2025-04-13 23:08:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:22,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945899272] [2025-04-13 23:08:22,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:22,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:22,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:22,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:22,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945899272] [2025-04-13 23:08:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945899272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:22,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224906825] [2025-04-13 23:08:22,544 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:22,545 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 23:08:22,547 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 23:08:22,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:22,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:22,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:22,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:22,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:22,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:22,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224906825] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:22,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 23:08:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697467927] [2025-04-13 23:08:22,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:22,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:08:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:22,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:08:22,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:08:22,699 INFO L87 Difference]: Start difference. First operand 20513 states and 99629 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:23,217 INFO L93 Difference]: Finished difference Result 28973 states and 137917 transitions. [2025-04-13 23:08:23,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:08:23,218 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:23,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:23,522 INFO L225 Difference]: With dead ends: 28973 [2025-04-13 23:08:23,522 INFO L226 Difference]: Without dead ends: 27892 [2025-04-13 23:08:23,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:08:23,528 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:23,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2025-04-13 23:08:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 17064. [2025-04-13 23:08:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17064 states, 17063 states have (on average 4.764285295668992) internal successors, (81293), 17063 states have internal predecessors, (81293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17064 states to 17064 states and 81293 transitions. [2025-04-13 23:08:24,034 INFO L79 Accepts]: Start accepts. Automaton has 17064 states and 81293 transitions. Word has length 28 [2025-04-13 23:08:24,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:24,034 INFO L485 AbstractCegarLoop]: Abstraction has 17064 states and 81293 transitions. [2025-04-13 23:08:24,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:24,034 INFO L278 IsEmpty]: Start isEmpty. Operand 17064 states and 81293 transitions. [2025-04-13 23:08:24,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:24,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:24,071 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:24,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:24,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:24,272 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 23:08:24,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1980293980, now seen corresponding path program 8 times [2025-04-13 23:08:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:24,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401341088] [2025-04-13 23:08:24,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:24,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:24,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:24,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:24,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401341088] [2025-04-13 23:08:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401341088] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:24,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391789089] [2025-04-13 23:08:24,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:24,398 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 23:08:24,400 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 23:08:24,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:24,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:24,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:24,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:24,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:24,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:24,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391789089] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:24,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 23:08:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401852557] [2025-04-13 23:08:24,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:24,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:08:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:24,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:08:24,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:24,513 INFO L87 Difference]: Start difference. First operand 17064 states and 81293 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:24,900 INFO L93 Difference]: Finished difference Result 23177 states and 107977 transitions. [2025-04-13 23:08:24,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:24,900 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:24,900 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:24,992 INFO L225 Difference]: With dead ends: 23177 [2025-04-13 23:08:24,992 INFO L226 Difference]: Without dead ends: 22135 [2025-04-13 23:08:25,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:08:25,002 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:25,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22135 states. [2025-04-13 23:08:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22135 to 14291. [2025-04-13 23:08:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14291 states, 14290 states have (on average 4.656822953114066) internal successors, (66546), 14290 states have internal predecessors, (66546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14291 states to 14291 states and 66546 transitions. [2025-04-13 23:08:25,500 INFO L79 Accepts]: Start accepts. Automaton has 14291 states and 66546 transitions. Word has length 28 [2025-04-13 23:08:25,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:25,501 INFO L485 AbstractCegarLoop]: Abstraction has 14291 states and 66546 transitions. [2025-04-13 23:08:25,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:25,501 INFO L278 IsEmpty]: Start isEmpty. Operand 14291 states and 66546 transitions. [2025-04-13 23:08:25,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:25,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:25,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:25,535 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 23:08:25,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:25,732 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 23:08:25,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -132231630, now seen corresponding path program 9 times [2025-04-13 23:08:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:25,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39505238] [2025-04-13 23:08:25,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:25,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:25,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:25,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:25,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:25,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39505238] [2025-04-13 23:08:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39505238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779702164] [2025-04-13 23:08:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:25,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:25,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:25,807 INFO L87 Difference]: Start difference. First operand 14291 states and 66546 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:26,063 INFO L93 Difference]: Finished difference Result 20869 states and 93715 transitions. [2025-04-13 23:08:26,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:26,064 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:26,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:26,298 INFO L225 Difference]: With dead ends: 20869 [2025-04-13 23:08:26,299 INFO L226 Difference]: Without dead ends: 18433 [2025-04-13 23:08:26,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:26,306 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:26,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18433 states. [2025-04-13 23:08:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18433 to 15985. [2025-04-13 23:08:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15985 states, 15984 states have (on average 4.70432932932933) internal successors, (75194), 15984 states have internal predecessors, (75194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15985 states to 15985 states and 75194 transitions. [2025-04-13 23:08:26,835 INFO L79 Accepts]: Start accepts. Automaton has 15985 states and 75194 transitions. Word has length 28 [2025-04-13 23:08:26,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:26,836 INFO L485 AbstractCegarLoop]: Abstraction has 15985 states and 75194 transitions. [2025-04-13 23:08:26,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:26,836 INFO L278 IsEmpty]: Start isEmpty. Operand 15985 states and 75194 transitions. [2025-04-13 23:08:26,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:26,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:26,877 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:26,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 23:08:26,877 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 23:08:26,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash 183378400, now seen corresponding path program 10 times [2025-04-13 23:08:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:26,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540804925] [2025-04-13 23:08:26,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:26,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:26,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:26,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:26,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:26,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540804925] [2025-04-13 23:08:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540804925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:08:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464130216] [2025-04-13 23:08:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:26,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:26,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:26,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:26,990 INFO L87 Difference]: Start difference. First operand 15985 states and 75194 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:27,417 INFO L93 Difference]: Finished difference Result 21557 states and 100303 transitions. [2025-04-13 23:08:27,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:08:27,418 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:27,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:27,509 INFO L225 Difference]: With dead ends: 21557 [2025-04-13 23:08:27,509 INFO L226 Difference]: Without dead ends: 20451 [2025-04-13 23:08:27,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:27,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:27,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20451 states. [2025-04-13 23:08:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20451 to 18477. [2025-04-13 23:08:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18477 states, 18476 states have (on average 4.745074691491665) internal successors, (87670), 18476 states have internal predecessors, (87670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18477 states to 18477 states and 87670 transitions. [2025-04-13 23:08:28,153 INFO L79 Accepts]: Start accepts. Automaton has 18477 states and 87670 transitions. Word has length 28 [2025-04-13 23:08:28,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:28,153 INFO L485 AbstractCegarLoop]: Abstraction has 18477 states and 87670 transitions. [2025-04-13 23:08:28,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:28,153 INFO L278 IsEmpty]: Start isEmpty. Operand 18477 states and 87670 transitions. [2025-04-13 23:08:28,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:28,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:28,193 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:28,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:08:28,193 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 23:08:28,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -608223602, now seen corresponding path program 11 times [2025-04-13 23:08:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:28,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634384313] [2025-04-13 23:08:28,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:28,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:28,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:28,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:28,246 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 23:08:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:28,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634384313] [2025-04-13 23:08:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634384313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910899300] [2025-04-13 23:08:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:28,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:28,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:28,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:28,247 INFO L87 Difference]: Start difference. First operand 18477 states and 87670 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:28,587 INFO L93 Difference]: Finished difference Result 24278 states and 110292 transitions. [2025-04-13 23:08:28,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:28,588 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:28,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:28,695 INFO L225 Difference]: With dead ends: 24278 [2025-04-13 23:08:28,695 INFO L226 Difference]: Without dead ends: 22650 [2025-04-13 23:08:28,706 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:28,706 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:28,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states. [2025-04-13 23:08:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 19687. [2025-04-13 23:08:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 19686 states have (on average 4.706339530630905) internal successors, (92649), 19686 states have internal predecessors, (92649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 92649 transitions. [2025-04-13 23:08:29,341 INFO L79 Accepts]: Start accepts. Automaton has 19687 states and 92649 transitions. Word has length 28 [2025-04-13 23:08:29,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:29,341 INFO L485 AbstractCegarLoop]: Abstraction has 19687 states and 92649 transitions. [2025-04-13 23:08:29,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:29,342 INFO L278 IsEmpty]: Start isEmpty. Operand 19687 states and 92649 transitions. [2025-04-13 23:08:29,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:29,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:29,382 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:29,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 23:08:29,382 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 23:08:29,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -99335972, now seen corresponding path program 12 times [2025-04-13 23:08:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:29,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069703601] [2025-04-13 23:08:29,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:29,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:29,394 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:29,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:29,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:29,475 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 23:08:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:29,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069703601] [2025-04-13 23:08:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069703601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:08:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238051023] [2025-04-13 23:08:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:29,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:29,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:29,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:29,476 INFO L87 Difference]: Start difference. First operand 19687 states and 92649 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:29,862 INFO L93 Difference]: Finished difference Result 22465 states and 104739 transitions. [2025-04-13 23:08:29,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:08:29,862 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:29,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:29,972 INFO L225 Difference]: With dead ends: 22465 [2025-04-13 23:08:29,972 INFO L226 Difference]: Without dead ends: 22379 [2025-04-13 23:08:29,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:29,983 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:29,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22379 states. [2025-04-13 23:08:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22379 to 19711. [2025-04-13 23:08:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19711 states, 19710 states have (on average 4.703450025367833) internal successors, (92705), 19710 states have internal predecessors, (92705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19711 states to 19711 states and 92705 transitions. [2025-04-13 23:08:30,726 INFO L79 Accepts]: Start accepts. Automaton has 19711 states and 92705 transitions. Word has length 28 [2025-04-13 23:08:30,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:30,726 INFO L485 AbstractCegarLoop]: Abstraction has 19711 states and 92705 transitions. [2025-04-13 23:08:30,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 23:08:30,726 INFO L278 IsEmpty]: Start isEmpty. Operand 19711 states and 92705 transitions. [2025-04-13 23:08:30,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:30,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:30,767 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:30,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 23:08:30,767 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 23:08:30,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash -890937974, now seen corresponding path program 13 times [2025-04-13 23:08:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:30,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268959141] [2025-04-13 23:08:30,767 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:30,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:30,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:30,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:30,856 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 23:08:30,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:30,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268959141] [2025-04-13 23:08:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268959141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:08:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510726620] [2025-04-13 23:08:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:30,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:08:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:30,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:08:30,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:30,857 INFO L87 Difference]: Start difference. First operand 19711 states and 92705 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:31,155 INFO L93 Difference]: Finished difference Result 22423 states and 104601 transitions. [2025-04-13 23:08:31,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:31,155 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:31,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:31,248 INFO L225 Difference]: With dead ends: 22423 [2025-04-13 23:08:31,249 INFO L226 Difference]: Without dead ends: 22363 [2025-04-13 23:08:31,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:31,257 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:31,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22363 states. [2025-04-13 23:08:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22363 to 19695. [2025-04-13 23:08:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19695 states, 19694 states have (on average 4.704529298263431) internal successors, (92651), 19694 states have internal predecessors, (92651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19695 states to 19695 states and 92651 transitions. [2025-04-13 23:08:31,863 INFO L79 Accepts]: Start accepts. Automaton has 19695 states and 92651 transitions. Word has length 28 [2025-04-13 23:08:31,864 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:31,864 INFO L485 AbstractCegarLoop]: Abstraction has 19695 states and 92651 transitions. [2025-04-13 23:08:31,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:31,864 INFO L278 IsEmpty]: Start isEmpty. Operand 19695 states and 92651 transitions. [2025-04-13 23:08:32,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:32,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:32,024 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:32,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 23:08:32,024 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 23:08:32,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1548938404, now seen corresponding path program 14 times [2025-04-13 23:08:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:32,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025675809] [2025-04-13 23:08:32,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:32,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:32,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:32,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:32,112 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 23:08:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:32,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025675809] [2025-04-13 23:08:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025675809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:08:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708875713] [2025-04-13 23:08:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:32,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:08:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:08:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:32,113 INFO L87 Difference]: Start difference. First operand 19695 states and 92651 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:32,432 INFO L93 Difference]: Finished difference Result 27069 states and 126827 transitions. [2025-04-13 23:08:32,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:32,433 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:32,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:32,544 INFO L225 Difference]: With dead ends: 27069 [2025-04-13 23:08:32,544 INFO L226 Difference]: Without dead ends: 25989 [2025-04-13 23:08:32,556 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:32,556 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:32,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25989 states. [2025-04-13 23:08:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25989 to 23447. [2025-04-13 23:08:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23447 states, 23446 states have (on average 4.798856947880235) internal successors, (112514), 23446 states have internal predecessors, (112514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23447 states to 23447 states and 112514 transitions. [2025-04-13 23:08:33,346 INFO L79 Accepts]: Start accepts. Automaton has 23447 states and 112514 transitions. Word has length 28 [2025-04-13 23:08:33,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:33,346 INFO L485 AbstractCegarLoop]: Abstraction has 23447 states and 112514 transitions. [2025-04-13 23:08:33,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 23:08:33,346 INFO L278 IsEmpty]: Start isEmpty. Operand 23447 states and 112514 transitions. [2025-04-13 23:08:33,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:33,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:33,409 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:33,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 23:08:33,409 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 23:08:33,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash -17924814, now seen corresponding path program 15 times [2025-04-13 23:08:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:33,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612306832] [2025-04-13 23:08:33,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:33,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:33,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:33,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:33,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:33,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:33,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612306832] [2025-04-13 23:08:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612306832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:33,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175591026] [2025-04-13 23:08:33,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:33,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:33,520 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 23:08:33,521 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 23:08:33,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:33,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:33,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:33,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:33,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:33,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:33,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175591026] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:33,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-04-13 23:08:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161613147] [2025-04-13 23:08:33,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:33,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:08:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:33,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:08:33,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:08:33,666 INFO L87 Difference]: Start difference. First operand 23447 states and 112514 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:34,315 INFO L93 Difference]: Finished difference Result 36798 states and 174701 transitions. [2025-04-13 23:08:34,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:08:34,315 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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 23:08:34,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:34,464 INFO L225 Difference]: With dead ends: 36798 [2025-04-13 23:08:34,465 INFO L226 Difference]: Without dead ends: 33398 [2025-04-13 23:08:34,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:08:34,483 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:34,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:08:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33398 states. [2025-04-13 23:08:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33398 to 24718. [2025-04-13 23:08:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24718 states, 24717 states have (on average 4.7614192660921635) internal successors, (117688), 24717 states have internal predecessors, (117688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24718 states to 24718 states and 117688 transitions. [2025-04-13 23:08:35,266 INFO L79 Accepts]: Start accepts. Automaton has 24718 states and 117688 transitions. Word has length 28 [2025-04-13 23:08:35,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:35,267 INFO L485 AbstractCegarLoop]: Abstraction has 24718 states and 117688 transitions. [2025-04-13 23:08:35,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:35,267 INFO L278 IsEmpty]: Start isEmpty. Operand 24718 states and 117688 transitions. [2025-04-13 23:08:35,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:35,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:35,325 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:35,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:35,526 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,SelfDestructingSolverStorable27 [2025-04-13 23:08:35,526 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 23:08:35,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1359388640, now seen corresponding path program 16 times [2025-04-13 23:08:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:35,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701692601] [2025-04-13 23:08:35,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:35,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:35,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:35,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:35,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:35,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:35,590 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 23:08:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:35,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701692601] [2025-04-13 23:08:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701692601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648133477] [2025-04-13 23:08:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:35,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:35,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:35,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:35,591 INFO L87 Difference]: Start difference. First operand 24718 states and 117688 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:36,045 INFO L93 Difference]: Finished difference Result 29731 states and 139866 transitions. [2025-04-13 23:08:36,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:36,045 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:36,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:36,179 INFO L225 Difference]: With dead ends: 29731 [2025-04-13 23:08:36,179 INFO L226 Difference]: Without dead ends: 29225 [2025-04-13 23:08:36,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:36,192 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:36,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29225 states. [2025-04-13 23:08:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29225 to 24816. [2025-04-13 23:08:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24816 states, 24815 states have (on average 4.771347975015112) internal successors, (118401), 24815 states have internal predecessors, (118401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24816 states to 24816 states and 118401 transitions. [2025-04-13 23:08:37,066 INFO L79 Accepts]: Start accepts. Automaton has 24816 states and 118401 transitions. Word has length 28 [2025-04-13 23:08:37,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:37,067 INFO L485 AbstractCegarLoop]: Abstraction has 24816 states and 118401 transitions. [2025-04-13 23:08:37,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:37,067 INFO L278 IsEmpty]: Start isEmpty. Operand 24816 states and 118401 transitions. [2025-04-13 23:08:37,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:37,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:37,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:37,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 23:08:37,140 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 23:08:37,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -522297682, now seen corresponding path program 17 times [2025-04-13 23:08:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:37,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048118692] [2025-04-13 23:08:37,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:37,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:37,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:37,147 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:37,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048118692] [2025-04-13 23:08:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048118692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:37,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438145429] [2025-04-13 23:08:37,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:37,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:37,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:37,204 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 23:08:37,206 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 23:08:37,237 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:37,253 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:37,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:37,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:37,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:37,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:37,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438145429] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:37,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-13 23:08:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124662621] [2025-04-13 23:08:37,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:37,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:08:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:37,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:08:37,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:37,308 INFO L87 Difference]: Start difference. First operand 24816 states and 118401 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:37,904 INFO L93 Difference]: Finished difference Result 33141 states and 154045 transitions. [2025-04-13 23:08:37,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:37,905 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:08:37,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:38,036 INFO L225 Difference]: With dead ends: 33141 [2025-04-13 23:08:38,037 INFO L226 Difference]: Without dead ends: 31364 [2025-04-13 23:08:38,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:38,051 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:38,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2025-04-13 23:08:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 20950. [2025-04-13 23:08:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20950 states, 20949 states have (on average 4.648479641032985) internal successors, (97381), 20949 states have internal predecessors, (97381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20950 states to 20950 states and 97381 transitions. [2025-04-13 23:08:38,704 INFO L79 Accepts]: Start accepts. Automaton has 20950 states and 97381 transitions. Word has length 28 [2025-04-13 23:08:38,704 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:38,704 INFO L485 AbstractCegarLoop]: Abstraction has 20950 states and 97381 transitions. [2025-04-13 23:08:38,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:38,704 INFO L278 IsEmpty]: Start isEmpty. Operand 20950 states and 97381 transitions. [2025-04-13 23:08:38,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:38,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:38,748 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:38,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:38,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:38,949 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 23:08:38,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash 203168372, now seen corresponding path program 18 times [2025-04-13 23:08:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:38,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70792497] [2025-04-13 23:08:38,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:38,952 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:38,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:38,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:39,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70792497] [2025-04-13 23:08:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70792497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:39,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201162046] [2025-04-13 23:08:39,000 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:39,002 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 23:08:39,003 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 23:08:39,031 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:08:39,044 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:39,044 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:39,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:39,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:39,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:39,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:39,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201162046] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:39,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 23:08:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912704834] [2025-04-13 23:08:39,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:39,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:08:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:39,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:08:39,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:08:39,107 INFO L87 Difference]: Start difference. First operand 20950 states and 97381 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:39,432 INFO L93 Difference]: Finished difference Result 30608 states and 140875 transitions. [2025-04-13 23:08:39,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:08:39,433 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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 23:08:39,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:39,760 INFO L225 Difference]: With dead ends: 30608 [2025-04-13 23:08:39,760 INFO L226 Difference]: Without dead ends: 29699 [2025-04-13 23:08:39,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:39,767 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:39,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29699 states. [2025-04-13 23:08:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29699 to 19239. [2025-04-13 23:08:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19239 states, 19238 states have (on average 4.621426343694771) internal successors, (88907), 19238 states have internal predecessors, (88907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19239 states to 19239 states and 88907 transitions. [2025-04-13 23:08:40,414 INFO L79 Accepts]: Start accepts. Automaton has 19239 states and 88907 transitions. Word has length 28 [2025-04-13 23:08:40,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:40,414 INFO L485 AbstractCegarLoop]: Abstraction has 19239 states and 88907 transitions. [2025-04-13 23:08:40,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:40,414 INFO L278 IsEmpty]: Start isEmpty. Operand 19239 states and 88907 transitions. [2025-04-13 23:08:40,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:08:40,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:40,466 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:40,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:40,666 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,SelfDestructingSolverStorable30 [2025-04-13 23:08:40,666 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 23:08:40,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 412193970, now seen corresponding path program 19 times [2025-04-13 23:08:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:40,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250412600] [2025-04-13 23:08:40,667 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:40,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:08:40,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:08:40,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:40,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:40,731 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 23:08:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:40,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250412600] [2025-04-13 23:08:40,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250412600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:40,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:40,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790633487] [2025-04-13 23:08:40,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:40,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:40,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:40,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:40,732 INFO L87 Difference]: Start difference. First operand 19239 states and 88907 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:41,020 INFO L93 Difference]: Finished difference Result 22597 states and 104597 transitions. [2025-04-13 23:08:41,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:41,020 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:41,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:41,140 INFO L225 Difference]: With dead ends: 22597 [2025-04-13 23:08:41,140 INFO L226 Difference]: Without dead ends: 22337 [2025-04-13 23:08:41,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:08:41,150 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:41,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22337 states. [2025-04-13 23:08:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22337 to 19047. [2025-04-13 23:08:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19047 states, 19046 states have (on average 4.630158563477895) internal successors, (88186), 19046 states have internal predecessors, (88186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19047 states to 19047 states and 88186 transitions. [2025-04-13 23:08:41,784 INFO L79 Accepts]: Start accepts. Automaton has 19047 states and 88186 transitions. Word has length 28 [2025-04-13 23:08:41,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:41,784 INFO L485 AbstractCegarLoop]: Abstraction has 19047 states and 88186 transitions. [2025-04-13 23:08:41,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 23:08:41,785 INFO L278 IsEmpty]: Start isEmpty. Operand 19047 states and 88186 transitions. [2025-04-13 23:08:41,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:08:41,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:41,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:41,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 23:08:41,824 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 23:08:41,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash -356247031, now seen corresponding path program 1 times [2025-04-13 23:08:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:41,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198387460] [2025-04-13 23:08:41,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:41,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:08:41,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:08:41,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:41,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:41,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198387460] [2025-04-13 23:08:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198387460] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:41,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593644498] [2025-04-13 23:08:41,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:41,889 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:08:41,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:08:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:08:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:08:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:41,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:41,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:41,981 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:08:41,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:08:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593644498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:08:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-04-13 23:08:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98499088] [2025-04-13 23:08:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:41,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:41,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:41,982 INFO L87 Difference]: Start difference. First operand 19047 states and 88186 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:42,368 INFO L93 Difference]: Finished difference Result 23122 states and 105787 transitions. [2025-04-13 23:08:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:42,368 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:08:42,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:42,459 INFO L225 Difference]: With dead ends: 23122 [2025-04-13 23:08:42,459 INFO L226 Difference]: Without dead ends: 21212 [2025-04-13 23:08:42,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:42,468 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:42,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21212 states. [2025-04-13 23:08:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21212 to 20581. [2025-04-13 23:08:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20581 states, 20580 states have (on average 4.628134110787172) internal successors, (95247), 20580 states have internal predecessors, (95247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20581 states to 20581 states and 95247 transitions. [2025-04-13 23:08:43,052 INFO L79 Accepts]: Start accepts. Automaton has 20581 states and 95247 transitions. Word has length 30 [2025-04-13 23:08:43,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:43,052 INFO L485 AbstractCegarLoop]: Abstraction has 20581 states and 95247 transitions. [2025-04-13 23:08:43,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:43,052 INFO L278 IsEmpty]: Start isEmpty. Operand 20581 states and 95247 transitions. [2025-04-13 23:08:43,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:08:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:43,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:43,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:43,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:43,296 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 23:08:43,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1104030697, now seen corresponding path program 2 times [2025-04-13 23:08:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:43,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091837810] [2025-04-13 23:08:43,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:43,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:08:43,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:08:43,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:43,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:43,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091837810] [2025-04-13 23:08:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091837810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:43,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606396693] [2025-04-13 23:08:43,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:43,366 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:08:43,367 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:08:43,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:08:43,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:08:43,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:43,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:43,455 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 23:08:43,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:43,518 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 23:08:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606396693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 23:08:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345980807] [2025-04-13 23:08:43,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:43,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:08:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:43,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:08:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:08:43,519 INFO L87 Difference]: Start difference. First operand 20581 states and 95247 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:45,591 INFO L93 Difference]: Finished difference Result 70179 states and 336745 transitions. [2025-04-13 23:08:45,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:08:45,592 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:08:45,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:45,959 INFO L225 Difference]: With dead ends: 70179 [2025-04-13 23:08:45,959 INFO L226 Difference]: Without dead ends: 64338 [2025-04-13 23:08:45,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1944, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 23:08:46,000 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2947 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:46,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 0 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2947 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:08:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64338 states. [2025-04-13 23:08:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64338 to 26394. [2025-04-13 23:08:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26394 states, 26393 states have (on average 4.759368014246202) internal successors, (125614), 26393 states have internal predecessors, (125614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26394 states to 26394 states and 125614 transitions. [2025-04-13 23:08:47,228 INFO L79 Accepts]: Start accepts. Automaton has 26394 states and 125614 transitions. Word has length 30 [2025-04-13 23:08:47,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:47,228 INFO L485 AbstractCegarLoop]: Abstraction has 26394 states and 125614 transitions. [2025-04-13 23:08:47,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,228 INFO L278 IsEmpty]: Start isEmpty. Operand 26394 states and 125614 transitions. [2025-04-13 23:08:47,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:08:47,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:47,289 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:08:47,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:47,489 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,SelfDestructingSolverStorable33 [2025-04-13 23:08:47,489 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 23:08:47,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1161875080, now seen corresponding path program 3 times [2025-04-13 23:08:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:47,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831438196] [2025-04-13 23:08:47,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:47,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:08:47,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 32 statements. [2025-04-13 23:08:47,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:47,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:47,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831438196] [2025-04-13 23:08:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831438196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:47,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604827434] [2025-04-13 23:08:47,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:47,562 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:08:47,564 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:08:47,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:08:47,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 32 statements. [2025-04-13 23:08:47,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:47,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:47,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:08:47,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:08:47,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:08:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604827434] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:47,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-13 23:08:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233293351] [2025-04-13 23:08:47,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:47,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:08:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:47,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:08:47,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:47,796 INFO L87 Difference]: Start difference. First operand 26394 states and 125614 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:48,428 INFO L93 Difference]: Finished difference Result 34110 states and 160319 transitions. [2025-04-13 23:08:48,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:48,428 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:08:48,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:48,577 INFO L225 Difference]: With dead ends: 34110 [2025-04-13 23:08:48,577 INFO L226 Difference]: Without dead ends: 33086 [2025-04-13 23:08:48,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:08:48,588 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:48,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33086 states. [2025-04-13 23:08:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33086 to 26482. [2025-04-13 23:08:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26482 states, 26481 states have (on average 4.753030474679959) internal successors, (125865), 26481 states have internal predecessors, (125865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26482 states to 26482 states and 125865 transitions. [2025-04-13 23:08:49,369 INFO L79 Accepts]: Start accepts. Automaton has 26482 states and 125865 transitions. Word has length 32 [2025-04-13 23:08:49,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:49,369 INFO L485 AbstractCegarLoop]: Abstraction has 26482 states and 125865 transitions. [2025-04-13 23:08:49,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,369 INFO L278 IsEmpty]: Start isEmpty. Operand 26482 states and 125865 transitions. [2025-04-13 23:08:49,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:08:49,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:49,430 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:08:49,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:08:49,630 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,SelfDestructingSolverStorable34 [2025-04-13 23:08:49,630 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 23:08:49,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1433597340, now seen corresponding path program 4 times [2025-04-13 23:08:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:49,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579953214] [2025-04-13 23:08:49,631 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:49,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:49,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:08:49,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:08:49,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:49,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:49,679 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 23:08:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:49,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579953214] [2025-04-13 23:08:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579953214] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:49,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502326269] [2025-04-13 23:08:49,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:49,681 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:49,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:08:49,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:08:49,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:08:49,725 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:49,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:49,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:08:49,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:49,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502326269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:49,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-04-13 23:08:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889293655] [2025-04-13 23:08:49,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:49,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:49,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:49,869 INFO L87 Difference]: Start difference. First operand 26482 states and 125865 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:51,470 INFO L93 Difference]: Finished difference Result 58326 states and 280667 transitions. [2025-04-13 23:08:51,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:08:51,471 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:08:51,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:51,973 INFO L225 Difference]: With dead ends: 58326 [2025-04-13 23:08:51,973 INFO L226 Difference]: Without dead ends: 54943 [2025-04-13 23:08:51,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:08:51,988 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 475 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:51,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 0 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:08:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54943 states. [2025-04-13 23:08:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54943 to 33224. [2025-04-13 23:08:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33224 states, 33223 states have (on average 4.772055503717304) internal successors, (158542), 33223 states have internal predecessors, (158542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33224 states to 33224 states and 158542 transitions. [2025-04-13 23:08:53,017 INFO L79 Accepts]: Start accepts. Automaton has 33224 states and 158542 transitions. Word has length 32 [2025-04-13 23:08:53,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:53,017 INFO L485 AbstractCegarLoop]: Abstraction has 33224 states and 158542 transitions. [2025-04-13 23:08:53,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:53,017 INFO L278 IsEmpty]: Start isEmpty. Operand 33224 states and 158542 transitions. [2025-04-13 23:08:53,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:08:53,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:53,098 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:08:53,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:08:53,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 23:08:53,299 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 23:08:53,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -59843552, now seen corresponding path program 5 times [2025-04-13 23:08:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:53,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555892421] [2025-04-13 23:08:53,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:53,302 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:08:53,306 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:08:53,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:08:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:53,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555892421] [2025-04-13 23:08:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555892421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:53,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873737973] [2025-04-13 23:08:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:53,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:53,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:53,346 INFO L87 Difference]: Start difference. First operand 33224 states and 158542 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:53,704 INFO L93 Difference]: Finished difference Result 41320 states and 192638 transitions. [2025-04-13 23:08:53,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:53,704 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:08:53,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:54,153 INFO L225 Difference]: With dead ends: 41320 [2025-04-13 23:08:54,153 INFO L226 Difference]: Without dead ends: 37301 [2025-04-13 23:08:54,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:54,164 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:54,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37301 states. [2025-04-13 23:08:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37301 to 34389. [2025-04-13 23:08:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34389 states, 34388 states have (on average 4.739705711294637) internal successors, (162989), 34388 states have internal predecessors, (162989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34389 states to 34389 states and 162989 transitions. [2025-04-13 23:08:55,216 INFO L79 Accepts]: Start accepts. Automaton has 34389 states and 162989 transitions. Word has length 32 [2025-04-13 23:08:55,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:55,216 INFO L485 AbstractCegarLoop]: Abstraction has 34389 states and 162989 transitions. [2025-04-13 23:08:55,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,216 INFO L278 IsEmpty]: Start isEmpty. Operand 34389 states and 162989 transitions. [2025-04-13 23:08:55,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:08:55,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:55,294 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:08:55,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 23:08:55,294 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 23:08:55,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1850968276, now seen corresponding path program 6 times [2025-04-13 23:08:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:55,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454905056] [2025-04-13 23:08:55,295 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:55,298 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:08:55,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:08:55,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:55,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:55,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454905056] [2025-04-13 23:08:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454905056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:55,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021425629] [2025-04-13 23:08:55,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:55,388 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:55,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:08:55,417 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:08:55,430 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:08:55,431 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:55,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:08:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:55,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021425629] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:55,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 23:08:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509219806] [2025-04-13 23:08:55,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:55,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:08:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:55,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:08:55,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:08:55,567 INFO L87 Difference]: Start difference. First operand 34389 states and 162989 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:58,204 INFO L93 Difference]: Finished difference Result 79874 states and 383736 transitions. [2025-04-13 23:08:58,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:08:58,204 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:08:58,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:58,629 INFO L225 Difference]: With dead ends: 79874 [2025-04-13 23:08:58,629 INFO L226 Difference]: Without dead ends: 77230 [2025-04-13 23:08:58,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:08:58,659 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:58,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:08:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77230 states. [2025-04-13 23:09:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77230 to 38944. [2025-04-13 23:09:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38944 states, 38943 states have (on average 4.765195285417148) internal successors, (185571), 38943 states have internal predecessors, (185571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38944 states to 38944 states and 185571 transitions. [2025-04-13 23:09:00,296 INFO L79 Accepts]: Start accepts. Automaton has 38944 states and 185571 transitions. Word has length 32 [2025-04-13 23:09:00,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:00,297 INFO L485 AbstractCegarLoop]: Abstraction has 38944 states and 185571 transitions. [2025-04-13 23:09:00,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:00,297 INFO L278 IsEmpty]: Start isEmpty. Operand 38944 states and 185571 transitions. [2025-04-13 23:09:00,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:00,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:00,386 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:00,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:09:00,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 23:09:00,586 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 23:09:00,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1997374744, now seen corresponding path program 7 times [2025-04-13 23:09:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:00,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033259458] [2025-04-13 23:09:00,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 23:09:00,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:00,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:00,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:09:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:00,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033259458] [2025-04-13 23:09:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033259458] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:00,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130976443] [2025-04-13 23:09:00,651 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:00,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:00,655 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:00,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:09:00,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 23:09:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:00,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:09:00,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:00,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130976443] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:00,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-04-13 23:09:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768347199] [2025-04-13 23:09:00,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:00,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:00,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:00,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:00,817 INFO L87 Difference]: Start difference. First operand 38944 states and 185571 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:03,642 INFO L93 Difference]: Finished difference Result 95849 states and 459441 transitions. [2025-04-13 23:09:03,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:09:03,642 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:09:03,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:04,107 INFO L225 Difference]: With dead ends: 95849 [2025-04-13 23:09:04,108 INFO L226 Difference]: Without dead ends: 90051 [2025-04-13 23:09:04,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=602, Invalid=2820, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:09:04,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 525 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:04,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 0 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:09:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90051 states. [2025-04-13 23:09:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90051 to 48817. [2025-04-13 23:09:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48817 states, 48816 states have (on average 4.784373975745657) internal successors, (233554), 48816 states have internal predecessors, (233554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48817 states to 48817 states and 233554 transitions. [2025-04-13 23:09:06,381 INFO L79 Accepts]: Start accepts. Automaton has 48817 states and 233554 transitions. Word has length 32 [2025-04-13 23:09:06,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:06,381 INFO L485 AbstractCegarLoop]: Abstraction has 48817 states and 233554 transitions. [2025-04-13 23:09:06,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:06,381 INFO L278 IsEmpty]: Start isEmpty. Operand 48817 states and 233554 transitions. [2025-04-13 23:09:06,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:06,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:06,504 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:06,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:06,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:06,705 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 23:09:06,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1949385244, now seen corresponding path program 8 times [2025-04-13 23:09:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:06,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454137840] [2025-04-13 23:09:06,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:06,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:09:06,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:06,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:06,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:06,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454137840] [2025-04-13 23:09:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454137840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:06,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210805245] [2025-04-13 23:09:06,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:06,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:06,788 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:06,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:09:06,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:09:06,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:06,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:06,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:06,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:09:06,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:06,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210805245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:06,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:06,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 23:09:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199201313] [2025-04-13 23:09:06,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:06,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:09:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:06,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:09:06,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:09:06,956 INFO L87 Difference]: Start difference. First operand 48817 states and 233554 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:11,793 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:16,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:17,836 INFO L93 Difference]: Finished difference Result 84740 states and 407740 transitions. [2025-04-13 23:09:17,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 23:09:17,837 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:09:17,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:18,269 INFO L225 Difference]: With dead ends: 84740 [2025-04-13 23:09:18,269 INFO L226 Difference]: Without dead ends: 81093 [2025-04-13 23:09:18,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 23:09:18,298 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 357 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:18,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 0 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2262 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-04-13 23:09:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81093 states. [2025-04-13 23:09:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81093 to 61984. [2025-04-13 23:09:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61984 states, 61983 states have (on average 4.8183695529419355) internal successors, (298657), 61983 states have internal predecessors, (298657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61984 states to 61984 states and 298657 transitions. [2025-04-13 23:09:20,629 INFO L79 Accepts]: Start accepts. Automaton has 61984 states and 298657 transitions. Word has length 32 [2025-04-13 23:09:20,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:20,630 INFO L485 AbstractCegarLoop]: Abstraction has 61984 states and 298657 transitions. [2025-04-13 23:09:20,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:20,630 INFO L278 IsEmpty]: Start isEmpty. Operand 61984 states and 298657 transitions. [2025-04-13 23:09:20,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:20,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:20,795 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:20,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:20,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 23:09:20,996 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 23:09:20,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1430743326, now seen corresponding path program 9 times [2025-04-13 23:09:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:20,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674176218] [2025-04-13 23:09:20,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:20,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:09:21,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:09:21,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:21,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:21,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674176218] [2025-04-13 23:09:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674176218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:21,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655962309] [2025-04-13 23:09:21,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:21,044 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:21,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:09:21,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:09:21,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:09:21,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:21,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:09:21,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:21,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655962309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:21,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 23:09:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147570721] [2025-04-13 23:09:21,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:21,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:09:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:21,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:09:21,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:09:21,366 INFO L87 Difference]: Start difference. First operand 61984 states and 298657 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:22,213 INFO L93 Difference]: Finished difference Result 81463 states and 388670 transitions. [2025-04-13 23:09:22,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:09:22,213 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:09:22,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:22,618 INFO L225 Difference]: With dead ends: 81463 [2025-04-13 23:09:22,618 INFO L226 Difference]: Without dead ends: 78450 [2025-04-13 23:09:22,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:09:22,642 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:22,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:09:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78450 states. [2025-04-13 23:09:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78450 to 45588. [2025-04-13 23:09:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45588 states, 45587 states have (on average 4.653673196305965) internal successors, (212147), 45587 states have internal predecessors, (212147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45588 states to 45588 states and 212147 transitions. [2025-04-13 23:09:24,250 INFO L79 Accepts]: Start accepts. Automaton has 45588 states and 212147 transitions. Word has length 32 [2025-04-13 23:09:24,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:24,251 INFO L485 AbstractCegarLoop]: Abstraction has 45588 states and 212147 transitions. [2025-04-13 23:09:24,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:24,251 INFO L278 IsEmpty]: Start isEmpty. Operand 45588 states and 212147 transitions. [2025-04-13 23:09:24,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:24,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:24,355 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:24,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 23:09:24,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:24,555 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 23:09:24,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 68047448, now seen corresponding path program 10 times [2025-04-13 23:09:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:24,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540658001] [2025-04-13 23:09:24,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:24,558 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:09:24,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:24,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:24,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:24,639 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 23:09:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:24,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540658001] [2025-04-13 23:09:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540658001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:24,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684776927] [2025-04-13 23:09:24,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:24,641 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:24,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:09:24,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:09:24,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:24,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:24,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:09:24,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:24,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684776927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:24,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-13 23:09:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735735916] [2025-04-13 23:09:24,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:24,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:09:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:09:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:09:24,839 INFO L87 Difference]: Start difference. First operand 45588 states and 212147 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:27,126 INFO L93 Difference]: Finished difference Result 75357 states and 352833 transitions. [2025-04-13 23:09:27,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:09:27,127 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:09:27,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:27,504 INFO L225 Difference]: With dead ends: 75357 [2025-04-13 23:09:27,505 INFO L226 Difference]: Without dead ends: 71386 [2025-04-13 23:09:27,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:09:27,538 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 344 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:27,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 0 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:09:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71386 states. [2025-04-13 23:09:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71386 to 54945. [2025-04-13 23:09:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54945 states, 54944 states have (on average 4.726539749563192) internal successors, (259695), 54944 states have internal predecessors, (259695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54945 states to 54945 states and 259695 transitions. [2025-04-13 23:09:29,405 INFO L79 Accepts]: Start accepts. Automaton has 54945 states and 259695 transitions. Word has length 32 [2025-04-13 23:09:29,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:29,405 INFO L485 AbstractCegarLoop]: Abstraction has 54945 states and 259695 transitions. [2025-04-13 23:09:29,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:29,405 INFO L278 IsEmpty]: Start isEmpty. Operand 54945 states and 259695 transitions. [2025-04-13 23:09:29,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:29,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:29,544 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:29,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:29,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:29,746 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 23:09:29,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -401502312, now seen corresponding path program 11 times [2025-04-13 23:09:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:29,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296019258] [2025-04-13 23:09:29,746 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:29,749 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:09:29,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:09:29,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:29,795 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 23:09:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:29,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296019258] [2025-04-13 23:09:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296019258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:09:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492235192] [2025-04-13 23:09:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:29,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:09:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:29,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:09:29,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:09:29,796 INFO L87 Difference]: Start difference. First operand 54945 states and 259695 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 23:09:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:30,548 INFO L93 Difference]: Finished difference Result 61961 states and 289952 transitions. [2025-04-13 23:09:30,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:09:30,549 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 32 [2025-04-13 23:09:30,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:31,109 INFO L225 Difference]: With dead ends: 61961 [2025-04-13 23:09:31,110 INFO L226 Difference]: Without dead ends: 58053 [2025-04-13 23:09:31,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:09:31,128 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:31,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:09:31,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58053 states. [2025-04-13 23:09:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58053 to 53588. [2025-04-13 23:09:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53588 states, 53587 states have (on average 4.748203855412694) internal successors, (254442), 53587 states have internal predecessors, (254442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53588 states to 53588 states and 254442 transitions. [2025-04-13 23:09:32,797 INFO L79 Accepts]: Start accepts. Automaton has 53588 states and 254442 transitions. Word has length 32 [2025-04-13 23:09:32,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:32,798 INFO L485 AbstractCegarLoop]: Abstraction has 53588 states and 254442 transitions. [2025-04-13 23:09:32,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 23:09:32,798 INFO L278 IsEmpty]: Start isEmpty. Operand 53588 states and 254442 transitions. [2025-04-13 23:09:32,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:09:32,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:32,942 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 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:09:32,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 23:09:32,942 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 23:09:32,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1093728296, now seen corresponding path program 12 times [2025-04-13 23:09:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:32,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734982077] [2025-04-13 23:09:32,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:32,951 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:09:32,958 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:09:32,958 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:32,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:33,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734982077] [2025-04-13 23:09:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734982077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:09:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006654942] [2025-04-13 23:09:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:33,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:09:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:33,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:09:33,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:09:33,003 INFO L87 Difference]: Start difference. First operand 53588 states and 254442 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 23:09:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:33,693 INFO L93 Difference]: Finished difference Result 55940 states and 262098 transitions. [2025-04-13 23:09:33,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:09:33,693 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 32 [2025-04-13 23:09:33,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:33,965 INFO L225 Difference]: With dead ends: 55940 [2025-04-13 23:09:33,965 INFO L226 Difference]: Without dead ends: 52084 [2025-04-13 23:09:33,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:09:33,994 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:33,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:09:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52084 states.