/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:07:09,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:07:09,294 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 18:07:09,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:07:09,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:07:09,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:07:09,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:07:09,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:07:09,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:07:09,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:07:09,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:07:09,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:07:09,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:07:09,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:07:09,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:07:09,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:07:09,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:07:09,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:07:09,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:07:09,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:07:09,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:07:09,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:07:09,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:07:09,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:07:09,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:07:09,543 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:07:09,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-13 18:07:10,934 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8ac7b08/db37dd4299104b1f91f62b4062e1a60d/FLAG20ff620f2 [2025-04-13 18:07:11,153 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:07:11,155 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-13 18:07:11,161 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8ac7b08/db37dd4299104b1f91f62b4062e1a60d/FLAG20ff620f2 [2025-04-13 18:07:11,985 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8ac7b08/db37dd4299104b1f91f62b4062e1a60d [2025-04-13 18:07:11,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:07:11,988 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:07:11,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:07:11,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:07:11,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:07:11,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:07:11" (1/1) ... [2025-04-13 18:07:11,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f826035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:11, skipping insertion in model container [2025-04-13 18:07:11,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:07:11" (1/1) ... [2025-04-13 18:07:12,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:07:12,140 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/parallel-ticket-4.wvr.c[2554,2567] [2025-04-13 18:07:12,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:07:12,150 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:07:12,175 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/parallel-ticket-4.wvr.c[2554,2567] [2025-04-13 18:07:12,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:07:12,189 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:07:12,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12 WrapperNode [2025-04-13 18:07:12,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:07:12,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:07:12,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:07:12,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:07:12,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,215 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-04-13 18:07:12,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:07:12,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:07:12,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:07:12,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:07:12,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,243 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 18:07:12,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:07:12,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:07:12,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:07:12,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:07:12,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (1/1) ... [2025-04-13 18:07:12,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:07:12,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:12,282 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 18:07:12,287 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 18:07:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:07:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:07:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:07:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:07:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:07:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:07:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:07:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:07:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:07:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:07:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:07:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:07:12,305 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:07:12,367 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:07:12,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:07:12,552 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:07:12,553 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:07:12,553 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:07:12,700 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:07:12,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:07:12 BoogieIcfgContainer [2025-04-13 18:07:12,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:07:12,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:07:12,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:07:12,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:07:12,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:07:11" (1/3) ... [2025-04-13 18:07:12,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277d9361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:07:12, skipping insertion in model container [2025-04-13 18:07:12,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:07:12" (2/3) ... [2025-04-13 18:07:12,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277d9361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:07:12, skipping insertion in model container [2025-04-13 18:07:12,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:07:12" (3/3) ... [2025-04-13 18:07:12,707 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-04-13 18:07:12,717 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:07:12,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 53 locations, 51 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 18:07:12,718 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:07:12,765 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:07:12,787 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 55 transitions, 138 flow [2025-04-13 18:07:13,091 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:13,118 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:07:13,130 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;@8a9776d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:07:13,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:07:13,166 INFO L278 IsEmpty]: Start isEmpty. Operand has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:13,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:07:13,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:13,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:13,235 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 18:07:13,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash -369386776, now seen corresponding path program 1 times [2025-04-13 18:07:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:13,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36470059] [2025-04-13 18:07:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:07:13,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:07:13,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:13,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:13,552 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 18:07:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:13,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36470059] [2025-04-13 18:07:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36470059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:07:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771287559] [2025-04-13 18:07:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:13,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:07:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:13,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:07:13,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:07:13,602 INFO L87 Difference]: Start difference. First operand has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 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 22.0) internal successors, (44), 3 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 18:07:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:13,904 INFO L93 Difference]: Finished difference Result 12188 states and 50978 transitions. [2025-04-13 18:07:13,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:07:13,906 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:07:13,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:14,077 INFO L225 Difference]: With dead ends: 12188 [2025-04-13 18:07:14,078 INFO L226 Difference]: Without dead ends: 11715 [2025-04-13 18:07:14,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:07:14,091 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:14,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11715 states. [2025-04-13 18:07:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11715 to 10075. [2025-04-13 18:07:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10075 states, 10074 states have (on average 4.195056581298392) internal successors, (42261), 10074 states have internal predecessors, (42261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10075 states to 10075 states and 42261 transitions. [2025-04-13 18:07:14,706 INFO L79 Accepts]: Start accepts. Automaton has 10075 states and 42261 transitions. Word has length 44 [2025-04-13 18:07:14,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:14,708 INFO L485 AbstractCegarLoop]: Abstraction has 10075 states and 42261 transitions. [2025-04-13 18:07:14,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 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 18:07:14,709 INFO L278 IsEmpty]: Start isEmpty. Operand 10075 states and 42261 transitions. [2025-04-13 18:07:14,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:14,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:14,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:14,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:07:14,748 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 18:07:14,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:14,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1144445206, now seen corresponding path program 1 times [2025-04-13 18:07:14,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:14,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795377493] [2025-04-13 18:07:14,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:14,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:14,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:14,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:14,856 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 18:07:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:14,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795377493] [2025-04-13 18:07:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795377493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:07:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897606808] [2025-04-13 18:07:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:14,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:07:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:14,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:07:14,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:07:14,859 INFO L87 Difference]: Start difference. First operand 10075 states and 42261 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 18:07:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:15,048 INFO L93 Difference]: Finished difference Result 13329 states and 55421 transitions. [2025-04-13 18:07:15,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:07:15,049 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:15,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:15,097 INFO L225 Difference]: With dead ends: 13329 [2025-04-13 18:07:15,097 INFO L226 Difference]: Without dead ends: 5584 [2025-04-13 18:07:15,115 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 18:07:15,116 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:15,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2025-04-13 18:07:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5584. [2025-04-13 18:07:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 3.757836288733656) internal successors, (20980), 5583 states have internal predecessors, (20980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 20980 transitions. [2025-04-13 18:07:15,437 INFO L79 Accepts]: Start accepts. Automaton has 5584 states and 20980 transitions. Word has length 45 [2025-04-13 18:07:15,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:15,438 INFO L485 AbstractCegarLoop]: Abstraction has 5584 states and 20980 transitions. [2025-04-13 18:07:15,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 18:07:15,439 INFO L278 IsEmpty]: Start isEmpty. Operand 5584 states and 20980 transitions. [2025-04-13 18:07:15,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:15,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:15,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:15,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:07:15,460 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 18:07:15,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 51768466, now seen corresponding path program 1 times [2025-04-13 18:07:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:15,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438958651] [2025-04-13 18:07:15,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:15,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:15,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:15,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:15,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:15,776 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 18:07:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:15,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438958651] [2025-04-13 18:07:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438958651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624030598] [2025-04-13 18:07:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:15,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:15,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:15,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:15,777 INFO L87 Difference]: Start difference. First operand 5584 states and 20980 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:16,126 INFO L93 Difference]: Finished difference Result 11805 states and 43295 transitions. [2025-04-13 18:07:16,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:07:16,126 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:16,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:16,184 INFO L225 Difference]: With dead ends: 11805 [2025-04-13 18:07:16,184 INFO L226 Difference]: Without dead ends: 9653 [2025-04-13 18:07:16,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:16,194 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:16,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 77 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2025-04-13 18:07:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 6253. [2025-04-13 18:07:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6253 states, 6252 states have (on average 3.740722968650032) internal successors, (23387), 6252 states have internal predecessors, (23387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 23387 transitions. [2025-04-13 18:07:16,467 INFO L79 Accepts]: Start accepts. Automaton has 6253 states and 23387 transitions. Word has length 45 [2025-04-13 18:07:16,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:16,467 INFO L485 AbstractCegarLoop]: Abstraction has 6253 states and 23387 transitions. [2025-04-13 18:07:16,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:16,468 INFO L278 IsEmpty]: Start isEmpty. Operand 6253 states and 23387 transitions. [2025-04-13 18:07:16,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:16,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:16,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:07:16,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:07:16,488 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 18:07:16,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash 889469056, now seen corresponding path program 2 times [2025-04-13 18:07:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:16,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361678045] [2025-04-13 18:07:16,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:16,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:16,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:16,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:16,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:16,676 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 18:07:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:16,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361678045] [2025-04-13 18:07:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361678045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:07:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391045579] [2025-04-13 18:07:16,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:16,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:07:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:07:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:07:16,678 INFO L87 Difference]: Start difference. First operand 6253 states and 23387 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:16,931 INFO L93 Difference]: Finished difference Result 14007 states and 51317 transitions. [2025-04-13 18:07:16,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:07:16,932 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:16,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:16,991 INFO L225 Difference]: With dead ends: 14007 [2025-04-13 18:07:16,991 INFO L226 Difference]: Without dead ends: 10421 [2025-04-13 18:07:17,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:17,005 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:17,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 60 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2025-04-13 18:07:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 7212. [2025-04-13 18:07:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7212 states, 7211 states have (on average 3.698516155872972) internal successors, (26670), 7211 states have internal predecessors, (26670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 26670 transitions. [2025-04-13 18:07:17,241 INFO L79 Accepts]: Start accepts. Automaton has 7212 states and 26670 transitions. Word has length 45 [2025-04-13 18:07:17,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:17,242 INFO L485 AbstractCegarLoop]: Abstraction has 7212 states and 26670 transitions. [2025-04-13 18:07:17,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:17,242 INFO L278 IsEmpty]: Start isEmpty. Operand 7212 states and 26670 transitions. [2025-04-13 18:07:17,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:17,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:17,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:17,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:07:17,258 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 18:07:17,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1204336612, now seen corresponding path program 2 times [2025-04-13 18:07:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:17,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561893094] [2025-04-13 18:07:17,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:17,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:17,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:17,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:17,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:17,410 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 18:07:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:17,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561893094] [2025-04-13 18:07:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561893094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:17,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:17,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923069139] [2025-04-13 18:07:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:17,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:17,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:17,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:17,412 INFO L87 Difference]: Start difference. First operand 7212 states and 26670 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:17,806 INFO L93 Difference]: Finished difference Result 13109 states and 47302 transitions. [2025-04-13 18:07:17,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:07:17,806 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:17,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:17,856 INFO L225 Difference]: With dead ends: 13109 [2025-04-13 18:07:17,856 INFO L226 Difference]: Without dead ends: 10444 [2025-04-13 18:07:17,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:17,869 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 110 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:17,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 79 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10444 states. [2025-04-13 18:07:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10444 to 7568. [2025-04-13 18:07:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7568 states, 7567 states have (on average 3.6622175234571164) internal successors, (27712), 7567 states have internal predecessors, (27712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7568 states to 7568 states and 27712 transitions. [2025-04-13 18:07:18,076 INFO L79 Accepts]: Start accepts. Automaton has 7568 states and 27712 transitions. Word has length 45 [2025-04-13 18:07:18,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:18,077 INFO L485 AbstractCegarLoop]: Abstraction has 7568 states and 27712 transitions. [2025-04-13 18:07:18,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:18,078 INFO L278 IsEmpty]: Start isEmpty. Operand 7568 states and 27712 transitions. [2025-04-13 18:07:18,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:18,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:18,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:18,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:07:18,094 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:18,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash -916791277, now seen corresponding path program 1 times [2025-04-13 18:07:18,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:18,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114288673] [2025-04-13 18:07:18,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:07:18,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:18,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:18,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:18,190 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 18:07:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:18,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114288673] [2025-04-13 18:07:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114288673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:07:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215607607] [2025-04-13 18:07:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:18,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:07:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:18,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:07:18,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:07:18,192 INFO L87 Difference]: Start difference. First operand 7568 states and 27712 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:18,407 INFO L93 Difference]: Finished difference Result 14352 states and 51555 transitions. [2025-04-13 18:07:18,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:07:18,407 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:18,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:18,458 INFO L225 Difference]: With dead ends: 14352 [2025-04-13 18:07:18,458 INFO L226 Difference]: Without dead ends: 10405 [2025-04-13 18:07:18,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:18,471 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 71 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:18,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 62 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10405 states. [2025-04-13 18:07:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10405 to 7468. [2025-04-13 18:07:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7468 states, 7467 states have (on average 3.6212669077273336) internal successors, (27040), 7467 states have internal predecessors, (27040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7468 states to 7468 states and 27040 transitions. [2025-04-13 18:07:18,704 INFO L79 Accepts]: Start accepts. Automaton has 7468 states and 27040 transitions. Word has length 45 [2025-04-13 18:07:18,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:18,705 INFO L485 AbstractCegarLoop]: Abstraction has 7468 states and 27040 transitions. [2025-04-13 18:07:18,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:18,705 INFO L278 IsEmpty]: Start isEmpty. Operand 7468 states and 27040 transitions. [2025-04-13 18:07:18,723 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:18,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:18,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:07:18,723 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 18:07:18,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1952350667, now seen corresponding path program 2 times [2025-04-13 18:07:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:18,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529726644] [2025-04-13 18:07:18,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:18,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:18,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:18,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:18,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:18,828 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 18:07:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:18,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529726644] [2025-04-13 18:07:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529726644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:07:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967061047] [2025-04-13 18:07:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:18,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:07:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:18,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:07:18,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:07:18,829 INFO L87 Difference]: Start difference. First operand 7468 states and 27040 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:19,070 INFO L93 Difference]: Finished difference Result 13297 states and 47449 transitions. [2025-04-13 18:07:19,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:07:19,071 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:19,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:19,124 INFO L225 Difference]: With dead ends: 13297 [2025-04-13 18:07:19,124 INFO L226 Difference]: Without dead ends: 9647 [2025-04-13 18:07:19,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:19,133 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:19,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 62 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2025-04-13 18:07:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 6958. [2025-04-13 18:07:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6958 states, 6957 states have (on average 3.5866034210148054) internal successors, (24952), 6957 states have internal predecessors, (24952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 24952 transitions. [2025-04-13 18:07:19,405 INFO L79 Accepts]: Start accepts. Automaton has 6958 states and 24952 transitions. Word has length 45 [2025-04-13 18:07:19,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:19,406 INFO L485 AbstractCegarLoop]: Abstraction has 6958 states and 24952 transitions. [2025-04-13 18:07:19,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:19,406 INFO L278 IsEmpty]: Start isEmpty. Operand 6958 states and 24952 transitions. [2025-04-13 18:07:19,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:19,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:19,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:19,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:07:19,421 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 18:07:19,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1102511780, now seen corresponding path program 3 times [2025-04-13 18:07:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:19,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586233519] [2025-04-13 18:07:19,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:19,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:19,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:19,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:19,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:19,553 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 18:07:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:19,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586233519] [2025-04-13 18:07:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586233519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641035857] [2025-04-13 18:07:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:19,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:19,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:19,554 INFO L87 Difference]: Start difference. First operand 6958 states and 24952 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:19,832 INFO L93 Difference]: Finished difference Result 12271 states and 43026 transitions. [2025-04-13 18:07:19,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:19,832 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:19,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:19,875 INFO L225 Difference]: With dead ends: 12271 [2025-04-13 18:07:19,875 INFO L226 Difference]: Without dead ends: 10368 [2025-04-13 18:07:19,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:07:19,883 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 136 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:19,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 114 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2025-04-13 18:07:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 7376. [2025-04-13 18:07:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7376 states, 7375 states have (on average 3.495728813559322) internal successors, (25781), 7375 states have internal predecessors, (25781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 25781 transitions. [2025-04-13 18:07:20,088 INFO L79 Accepts]: Start accepts. Automaton has 7376 states and 25781 transitions. Word has length 45 [2025-04-13 18:07:20,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:20,088 INFO L485 AbstractCegarLoop]: Abstraction has 7376 states and 25781 transitions. [2025-04-13 18:07:20,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:20,089 INFO L278 IsEmpty]: Start isEmpty. Operand 7376 states and 25781 transitions. [2025-04-13 18:07:20,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:20,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:20,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:20,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:07:20,104 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 18:07:20,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash -798040369, now seen corresponding path program 3 times [2025-04-13 18:07:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:20,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590034292] [2025-04-13 18:07:20,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:20,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:20,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:20,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:20,200 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 18:07:20,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:20,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590034292] [2025-04-13 18:07:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590034292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:07:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816144093] [2025-04-13 18:07:20,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:20,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:07:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:20,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:07:20,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:07:20,201 INFO L87 Difference]: Start difference. First operand 7376 states and 25781 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:20,362 INFO L93 Difference]: Finished difference Result 12838 states and 44119 transitions. [2025-04-13 18:07:20,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:07:20,362 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:20,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:20,395 INFO L225 Difference]: With dead ends: 12838 [2025-04-13 18:07:20,395 INFO L226 Difference]: Without dead ends: 7100 [2025-04-13 18:07:20,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:20,406 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:20,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 62 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states. [2025-04-13 18:07:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 5173. [2025-04-13 18:07:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5172 states have (on average 3.3605955143078114) internal successors, (17381), 5172 states have internal predecessors, (17381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 17381 transitions. [2025-04-13 18:07:20,530 INFO L79 Accepts]: Start accepts. Automaton has 5173 states and 17381 transitions. Word has length 45 [2025-04-13 18:07:20,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:20,530 INFO L485 AbstractCegarLoop]: Abstraction has 5173 states and 17381 transitions. [2025-04-13 18:07:20,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,530 INFO L278 IsEmpty]: Start isEmpty. Operand 5173 states and 17381 transitions. [2025-04-13 18:07:20,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:20,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:20,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:20,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:07:20,538 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 18:07:20,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1022757404, now seen corresponding path program 4 times [2025-04-13 18:07:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:20,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561783113] [2025-04-13 18:07:20,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:20,545 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:07:20,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:20,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:20,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:20,773 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 18:07:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:20,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561783113] [2025-04-13 18:07:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561783113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:20,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:20,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578961179] [2025-04-13 18:07:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:20,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:20,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:20,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:20,775 INFO L87 Difference]: Start difference. First operand 5173 states and 17381 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:21,054 INFO L93 Difference]: Finished difference Result 9565 states and 31579 transitions. [2025-04-13 18:07:21,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:21,055 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:21,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:21,085 INFO L225 Difference]: With dead ends: 9565 [2025-04-13 18:07:21,085 INFO L226 Difference]: Without dead ends: 6078 [2025-04-13 18:07:21,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:07:21,093 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:21,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 102 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2025-04-13 18:07:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 4161. [2025-04-13 18:07:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 4160 states have (on average 3.234375) internal successors, (13455), 4160 states have internal predecessors, (13455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 13455 transitions. [2025-04-13 18:07:21,217 INFO L79 Accepts]: Start accepts. Automaton has 4161 states and 13455 transitions. Word has length 45 [2025-04-13 18:07:21,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:21,217 INFO L485 AbstractCegarLoop]: Abstraction has 4161 states and 13455 transitions. [2025-04-13 18:07:21,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:21,217 INFO L278 IsEmpty]: Start isEmpty. Operand 4161 states and 13455 transitions. [2025-04-13 18:07:21,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:21,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:21,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:07:21,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:07:21,225 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 18:07:21,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 306442385, now seen corresponding path program 4 times [2025-04-13 18:07:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:21,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501732715] [2025-04-13 18:07:21,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:21,234 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:07:21,242 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:21,242 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:21,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501732715] [2025-04-13 18:07:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501732715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70186411] [2025-04-13 18:07:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:21,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:21,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:07:21,401 INFO L87 Difference]: Start difference. First operand 4161 states and 13455 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:21,597 INFO L93 Difference]: Finished difference Result 6643 states and 21272 transitions. [2025-04-13 18:07:21,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:07:21,598 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:21,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:21,626 INFO L225 Difference]: With dead ends: 6643 [2025-04-13 18:07:21,626 INFO L226 Difference]: Without dead ends: 5190 [2025-04-13 18:07:21,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:21,631 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:21,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 82 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2025-04-13 18:07:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 3767. [2025-04-13 18:07:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3766 states have (on average 3.2089750398300585) internal successors, (12085), 3766 states have internal predecessors, (12085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 12085 transitions. [2025-04-13 18:07:21,739 INFO L79 Accepts]: Start accepts. Automaton has 3767 states and 12085 transitions. Word has length 45 [2025-04-13 18:07:21,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:21,740 INFO L485 AbstractCegarLoop]: Abstraction has 3767 states and 12085 transitions. [2025-04-13 18:07:21,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 18:07:21,740 INFO L278 IsEmpty]: Start isEmpty. Operand 3767 states and 12085 transitions. [2025-04-13 18:07:21,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:21,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:21,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:21,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:07:21,747 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 18:07:21,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -273775693, now seen corresponding path program 5 times [2025-04-13 18:07:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:21,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578001882] [2025-04-13 18:07:21,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:21,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:21,755 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:21,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:21,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:21,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:21,861 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 18:07:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:21,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578001882] [2025-04-13 18:07:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578001882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615896275] [2025-04-13 18:07:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:21,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:21,862 INFO L87 Difference]: Start difference. First operand 3767 states and 12085 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:22,108 INFO L93 Difference]: Finished difference Result 5721 states and 17952 transitions. [2025-04-13 18:07:22,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:22,108 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:22,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:22,138 INFO L225 Difference]: With dead ends: 5721 [2025-04-13 18:07:22,138 INFO L226 Difference]: Without dead ends: 4162 [2025-04-13 18:07:22,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:07:22,143 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 128 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:22,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-04-13 18:07:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2975. [2025-04-13 18:07:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 3.1160053799596503) internal successors, (9267), 2974 states have internal predecessors, (9267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 9267 transitions. [2025-04-13 18:07:22,236 INFO L79 Accepts]: Start accepts. Automaton has 2975 states and 9267 transitions. Word has length 45 [2025-04-13 18:07:22,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:22,237 INFO L485 AbstractCegarLoop]: Abstraction has 2975 states and 9267 transitions. [2025-04-13 18:07:22,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:22,237 INFO L278 IsEmpty]: Start isEmpty. Operand 2975 states and 9267 transitions. [2025-04-13 18:07:22,242 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:22,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:22,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:22,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:07:22,242 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 18:07:22,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1260181914, now seen corresponding path program 5 times [2025-04-13 18:07:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:22,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48694666] [2025-04-13 18:07:22,243 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:22,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:22,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:22,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:22,369 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 18:07:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:22,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48694666] [2025-04-13 18:07:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48694666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:07:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305650732] [2025-04-13 18:07:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:22,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:22,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:22,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:22,370 INFO L87 Difference]: Start difference. First operand 2975 states and 9267 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:22,629 INFO L93 Difference]: Finished difference Result 3988 states and 12279 transitions. [2025-04-13 18:07:22,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:07:22,630 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:22,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:22,658 INFO L225 Difference]: With dead ends: 3988 [2025-04-13 18:07:22,658 INFO L226 Difference]: Without dead ends: 3562 [2025-04-13 18:07:22,661 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:22,661 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 156 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:22,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 134 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2025-04-13 18:07:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2631. [2025-04-13 18:07:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 3.082509505703422) internal successors, (8107), 2630 states have internal predecessors, (8107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 8107 transitions. [2025-04-13 18:07:22,739 INFO L79 Accepts]: Start accepts. Automaton has 2631 states and 8107 transitions. Word has length 45 [2025-04-13 18:07:22,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:22,740 INFO L485 AbstractCegarLoop]: Abstraction has 2631 states and 8107 transitions. [2025-04-13 18:07:22,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:22,740 INFO L278 IsEmpty]: Start isEmpty. Operand 2631 states and 8107 transitions. [2025-04-13 18:07:22,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:22,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:22,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:22,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:07:22,745 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 18:07:22,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash 942252670, now seen corresponding path program 6 times [2025-04-13 18:07:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:22,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898069339] [2025-04-13 18:07:22,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:22,753 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:22,757 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:22,757 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:22,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:22,895 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 18:07:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:22,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898069339] [2025-04-13 18:07:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898069339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:22,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:07:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738058570] [2025-04-13 18:07:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:22,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:22,896 INFO L87 Difference]: Start difference. First operand 2631 states and 8107 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 18:07:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:23,213 INFO L93 Difference]: Finished difference Result 3656 states and 11137 transitions. [2025-04-13 18:07:23,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:07:23,213 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:23,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:23,238 INFO L225 Difference]: With dead ends: 3656 [2025-04-13 18:07:23,238 INFO L226 Difference]: Without dead ends: 3354 [2025-04-13 18:07:23,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:07:23,240 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:23,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 135 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2025-04-13 18:07:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 2611. [2025-04-13 18:07:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 3.082375478927203) internal successors, (8045), 2610 states have internal predecessors, (8045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 8045 transitions. [2025-04-13 18:07:23,317 INFO L79 Accepts]: Start accepts. Automaton has 2611 states and 8045 transitions. Word has length 45 [2025-04-13 18:07:23,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:23,317 INFO L485 AbstractCegarLoop]: Abstraction has 2611 states and 8045 transitions. [2025-04-13 18:07:23,318 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 18:07:23,318 INFO L278 IsEmpty]: Start isEmpty. Operand 2611 states and 8045 transitions. [2025-04-13 18:07:23,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:23,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:07:23,322 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 18:07:23,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -927751528, now seen corresponding path program 7 times [2025-04-13 18:07:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:23,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343424493] [2025-04-13 18:07:23,323 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:23,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:23,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:23,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:23,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:23,447 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 18:07:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:23,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343424493] [2025-04-13 18:07:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343424493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:07:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732859622] [2025-04-13 18:07:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:23,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:23,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:23,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:23,448 INFO L87 Difference]: Start difference. First operand 2611 states and 8045 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:23,713 INFO L93 Difference]: Finished difference Result 3752 states and 11381 transitions. [2025-04-13 18:07:23,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:07:23,714 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:23,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:23,738 INFO L225 Difference]: With dead ends: 3752 [2025-04-13 18:07:23,738 INFO L226 Difference]: Without dead ends: 3182 [2025-04-13 18:07:23,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:23,740 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 140 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:23,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 134 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2025-04-13 18:07:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 2467. [2025-04-13 18:07:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 3.080697485806975) internal successors, (7597), 2466 states have internal predecessors, (7597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 7597 transitions. [2025-04-13 18:07:23,809 INFO L79 Accepts]: Start accepts. Automaton has 2467 states and 7597 transitions. Word has length 45 [2025-04-13 18:07:23,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:23,809 INFO L485 AbstractCegarLoop]: Abstraction has 2467 states and 7597 transitions. [2025-04-13 18:07:23,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:23,810 INFO L278 IsEmpty]: Start isEmpty. Operand 2467 states and 7597 transitions. [2025-04-13 18:07:23,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:23,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:23,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:23,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:07:23,814 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 18:07:23,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 622525144, now seen corresponding path program 8 times [2025-04-13 18:07:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:23,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145028651] [2025-04-13 18:07:23,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:23,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:23,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:23,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:23,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:23,939 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 18:07:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:23,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145028651] [2025-04-13 18:07:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145028651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:07:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678311871] [2025-04-13 18:07:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:23,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:23,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:23,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:23,940 INFO L87 Difference]: Start difference. First operand 2467 states and 7597 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 18:07:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:24,213 INFO L93 Difference]: Finished difference Result 3612 states and 10933 transitions. [2025-04-13 18:07:24,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:07:24,214 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:24,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:24,236 INFO L225 Difference]: With dead ends: 3612 [2025-04-13 18:07:24,236 INFO L226 Difference]: Without dead ends: 3066 [2025-04-13 18:07:24,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:07:24,238 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:24,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 106 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-04-13 18:07:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 2351. [2025-04-13 18:07:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 2350 states have (on average 3.0948936170212766) internal successors, (7273), 2350 states have internal predecessors, (7273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 7273 transitions. [2025-04-13 18:07:24,299 INFO L79 Accepts]: Start accepts. Automaton has 2351 states and 7273 transitions. Word has length 45 [2025-04-13 18:07:24,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:24,299 INFO L485 AbstractCegarLoop]: Abstraction has 2351 states and 7273 transitions. [2025-04-13 18:07:24,299 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 18:07:24,299 INFO L278 IsEmpty]: Start isEmpty. Operand 2351 states and 7273 transitions. [2025-04-13 18:07:24,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:24,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:24,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:24,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:07:24,305 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 18:07:24,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash 741795759, now seen corresponding path program 6 times [2025-04-13 18:07:24,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:24,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149555320] [2025-04-13 18:07:24,305 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:24,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:24,312 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:24,316 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:24,316 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:24,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:24,402 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 18:07:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:24,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149555320] [2025-04-13 18:07:24,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149555320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:24,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:24,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152464168] [2025-04-13 18:07:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:24,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:24,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:24,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:24,404 INFO L87 Difference]: Start difference. First operand 2351 states and 7273 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:24,625 INFO L93 Difference]: Finished difference Result 3422 states and 10445 transitions. [2025-04-13 18:07:24,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:24,626 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:24,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:24,650 INFO L225 Difference]: With dead ends: 3422 [2025-04-13 18:07:24,650 INFO L226 Difference]: Without dead ends: 3134 [2025-04-13 18:07:24,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:24,652 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 104 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:24,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 110 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2025-04-13 18:07:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2231. [2025-04-13 18:07:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 3.0623318385650222) internal successors, (6829), 2230 states have internal predecessors, (6829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 6829 transitions. [2025-04-13 18:07:24,716 INFO L79 Accepts]: Start accepts. Automaton has 2231 states and 6829 transitions. Word has length 45 [2025-04-13 18:07:24,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:24,716 INFO L485 AbstractCegarLoop]: Abstraction has 2231 states and 6829 transitions. [2025-04-13 18:07:24,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:24,716 INFO L278 IsEmpty]: Start isEmpty. Operand 2231 states and 6829 transitions. [2025-04-13 18:07:24,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:24,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:24,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:24,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:07:24,721 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 18:07:24,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash 327762799, now seen corresponding path program 7 times [2025-04-13 18:07:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:24,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412439731] [2025-04-13 18:07:24,722 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:24,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:24,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:24,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:24,811 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 18:07:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:24,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412439731] [2025-04-13 18:07:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412439731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:07:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718992145] [2025-04-13 18:07:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:24,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:07:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:24,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:07:24,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:24,812 INFO L87 Difference]: Start difference. First operand 2231 states and 6829 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:25,039 INFO L93 Difference]: Finished difference Result 3270 states and 9919 transitions. [2025-04-13 18:07:25,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:07:25,040 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:25,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:25,065 INFO L225 Difference]: With dead ends: 3270 [2025-04-13 18:07:25,066 INFO L226 Difference]: Without dead ends: 2946 [2025-04-13 18:07:25,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:25,067 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 127 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:25,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 128 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2025-04-13 18:07:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2119. [2025-04-13 18:07:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 3.046742209631728) internal successors, (6453), 2118 states have internal predecessors, (6453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 6453 transitions. [2025-04-13 18:07:25,114 INFO L79 Accepts]: Start accepts. Automaton has 2119 states and 6453 transitions. Word has length 45 [2025-04-13 18:07:25,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:25,114 INFO L485 AbstractCegarLoop]: Abstraction has 2119 states and 6453 transitions. [2025-04-13 18:07:25,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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 18:07:25,114 INFO L278 IsEmpty]: Start isEmpty. Operand 2119 states and 6453 transitions. [2025-04-13 18:07:25,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:25,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:25,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:25,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:07:25,117 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 18:07:25,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash 127238449, now seen corresponding path program 8 times [2025-04-13 18:07:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:25,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390285217] [2025-04-13 18:07:25,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:25,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:25,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:25,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:25,237 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 18:07:25,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:25,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390285217] [2025-04-13 18:07:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390285217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:25,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:07:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149622611] [2025-04-13 18:07:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:25,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:25,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:25,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:25,238 INFO L87 Difference]: Start difference. First operand 2119 states and 6453 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 18:07:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:25,499 INFO L93 Difference]: Finished difference Result 3146 states and 9517 transitions. [2025-04-13 18:07:25,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:07:25,500 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:25,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:25,520 INFO L225 Difference]: With dead ends: 3146 [2025-04-13 18:07:25,521 INFO L226 Difference]: Without dead ends: 2766 [2025-04-13 18:07:25,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:07:25,523 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 133 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:25,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 123 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2025-04-13 18:07:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 1999. [2025-04-13 18:07:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1998 states have (on average 3.0605605605605604) internal successors, (6115), 1998 states have internal predecessors, (6115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 6115 transitions. [2025-04-13 18:07:25,571 INFO L79 Accepts]: Start accepts. Automaton has 1999 states and 6115 transitions. Word has length 45 [2025-04-13 18:07:25,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:25,571 INFO L485 AbstractCegarLoop]: Abstraction has 1999 states and 6115 transitions. [2025-04-13 18:07:25,571 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 18:07:25,571 INFO L278 IsEmpty]: Start isEmpty. Operand 1999 states and 6115 transitions. [2025-04-13 18:07:25,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:25,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:25,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:25,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:07:25,574 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 18:07:25,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1161377276, now seen corresponding path program 3 times [2025-04-13 18:07:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:25,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189419178] [2025-04-13 18:07:25,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:25,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:07:25,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:25,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:25,646 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 18:07:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:25,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189419178] [2025-04-13 18:07:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189419178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:07:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148611341] [2025-04-13 18:07:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:25,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:25,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:25,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:25,647 INFO L87 Difference]: Start difference. First operand 1999 states and 6115 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:25,849 INFO L93 Difference]: Finished difference Result 2523 states and 7614 transitions. [2025-04-13 18:07:25,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:25,849 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:25,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:25,862 INFO L225 Difference]: With dead ends: 2523 [2025-04-13 18:07:25,862 INFO L226 Difference]: Without dead ends: 622 [2025-04-13 18:07:25,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:07:25,865 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:25,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 100 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-04-13 18:07:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 478. [2025-04-13 18:07:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 2.80293501048218) internal successors, (1337), 477 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1337 transitions. [2025-04-13 18:07:25,885 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 1337 transitions. Word has length 45 [2025-04-13 18:07:25,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:25,886 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 1337 transitions. [2025-04-13 18:07:25,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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 18:07:25,886 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 1337 transitions. [2025-04-13 18:07:25,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:07:25,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:25,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:25,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:07:25,887 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 18:07:25,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -298286576, now seen corresponding path program 4 times [2025-04-13 18:07:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:25,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206941378] [2025-04-13 18:07:25,887 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:25,893 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:07:25,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:07:25,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:26,007 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 18:07:26,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:26,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206941378] [2025-04-13 18:07:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206941378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:26,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:26,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:07:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773637145] [2025-04-13 18:07:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:26,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:07:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:26,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:07:26,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:07:26,008 INFO L87 Difference]: Start difference. First operand 478 states and 1337 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 18:07:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:26,136 INFO L93 Difference]: Finished difference Result 518 states and 1429 transitions. [2025-04-13 18:07:26,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:07:26,137 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:07:26,137 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:26,149 INFO L225 Difference]: With dead ends: 518 [2025-04-13 18:07:26,149 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:07:26,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:07:26,150 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:26,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 70 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:07:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:07:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:07:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:07:26,164 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-04-13 18:07:26,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:26,164 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:07:26,164 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 18:07:26,164 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:07:26,164 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:07:26,168 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 18:07:26,169 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 18:07:26,169 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 18:07:26,169 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 18:07:26,169 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 18:07:26,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:07:26,171 INFO L422 BasicCegarLoop]: Path program histogram: [8, 8, 4, 1] [2025-04-13 18:07:26,173 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:07:26,173 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:07:26,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:07:26 BasicIcfg [2025-04-13 18:07:26,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:07:26,175 INFO L158 Benchmark]: Toolchain (without parser) took 14187.06ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 99.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 389.7MB. Max. memory is 8.0GB. [2025-04-13 18:07:26,176 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:07:26,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.74ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 85.0MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 18:07:26,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:07:26,177 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:07:26,177 INFO L158 Benchmark]: RCFGBuilder took 445.42ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 38.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 18:07:26,177 INFO L158 Benchmark]: TraceAbstraction took 13472.57ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 331.0MB. Max. memory is 8.0GB. [2025-04-13 18:07:26,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 104.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.74ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 85.0MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 445.42ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 38.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 13472.57ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 331.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 86 locations, 91 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.3s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2084 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2084 mSDsluCounter, 1886 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1294 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6122 IncrementalHoareTripleChecker+Invalid, 6532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 592 mSDtfsCounter, 6122 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10075occurred in iteration=1, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 31942 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 2421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 18:07:26,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...