/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/pthread-wmm/safe008_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:22:41,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:22:42,008 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 17:22:42,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:22:42,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:22:42,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:22:42,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:22:42,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:22:42,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:22:42,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:22:42,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:22:42,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:22:42,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:22:42,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:22:42,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:22:42,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:22:42,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:42,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:42,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:22:42,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:22:42,034 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 17:22:42,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:22:42,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:22:42,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:22:42,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:22:42,398 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:22:42,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_tso.i [2025-04-13 17:22:43,732 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b067e8a63/aa7b4f04ed1a4576b96f319a51f9604a/FLAGae5021b1d [2025-04-13 17:22:43,961 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:22:43,961 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_tso.i [2025-04-13 17:22:43,971 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b067e8a63/aa7b4f04ed1a4576b96f319a51f9604a/FLAGae5021b1d [2025-04-13 17:22:44,933 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b067e8a63/aa7b4f04ed1a4576b96f319a51f9604a [2025-04-13 17:22:44,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:22:44,935 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:22:44,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:22:44,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:22:44,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:22:44,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:22:44" (1/1) ... [2025-04-13 17:22:44,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:44, skipping insertion in model container [2025-04-13 17:22:44,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:22:44" (1/1) ... [2025-04-13 17:22:44,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:22:45,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_tso.i[945,958] [2025-04-13 17:22:45,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:22:45,195 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:22:45,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_tso.i[945,958] [2025-04-13 17:22:45,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:22:45,267 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:22:45,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45 WrapperNode [2025-04-13 17:22:45,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:22:45,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:22:45,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:22:45,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:22:45,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,304 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 17:22:45,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:22:45,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:22:45,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:22:45,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:22:45,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,336 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 17:22:45,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:22:45,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:22:45,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:22:45,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:22:45,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (1/1) ... [2025-04-13 17:22:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:45,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:22:45,385 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 17:22:45,387 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 17:22:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:22:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:22:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 17:22:45,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 17:22:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 17:22:45,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 17:22:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 17:22:45,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 17:22:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:22:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:22:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:22:45,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:22:45,407 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 17:22:45,499 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:22:45,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:22:45,629 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:22:45,630 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:22:45,630 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:22:45,719 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:22:45,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:22:45 BoogieIcfgContainer [2025-04-13 17:22:45,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:22:45,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:22:45,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:22:45,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:22:45,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:22:44" (1/3) ... [2025-04-13 17:22:45,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46399682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:22:45, skipping insertion in model container [2025-04-13 17:22:45,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:45" (2/3) ... [2025-04-13 17:22:45,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46399682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:22:45, skipping insertion in model container [2025-04-13 17:22:45,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:22:45" (3/3) ... [2025-04-13 17:22:45,731 INFO L128 eAbstractionObserver]: Analyzing ICFG safe008_tso.i [2025-04-13 17:22:45,740 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:22:45,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe008_tso.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 17:22:45,741 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:22:45,775 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:22:45,800 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 17:22:45,930 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:45,951 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:22:45,959 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;@52dc4b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:22:45,960 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:22:45,967 INFO L278 IsEmpty]: Start isEmpty. Operand has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:45,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:22:45,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:45,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:45,976 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:45,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 250654454, now seen corresponding path program 1 times [2025-04-13 17:22:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:45,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188789195] [2025-04-13 17:22:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:22:46,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:22:46,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:46,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:46,377 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 17:22:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:46,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188789195] [2025-04-13 17:22:46,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188789195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:46,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:46,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:22:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557585675] [2025-04-13 17:22:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:46,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:22:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:46,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:22:46,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:22:46,405 INFO L87 Difference]: Start difference. First operand has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 0 states have call successors, (0), 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 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:46,575 INFO L93 Difference]: Finished difference Result 4625 states and 15349 transitions. [2025-04-13 17:22:46,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:46,577 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 17:22:46,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:46,618 INFO L225 Difference]: With dead ends: 4625 [2025-04-13 17:22:46,618 INFO L226 Difference]: Without dead ends: 3259 [2025-04-13 17:22:46,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:46,663 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:46,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 91 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2025-04-13 17:22:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2899. [2025-04-13 17:22:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2898 states have (on average 3.33367839889579) internal successors, (9661), 2898 states have internal predecessors, (9661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 9661 transitions. [2025-04-13 17:22:46,814 INFO L79 Accepts]: Start accepts. Automaton has 2899 states and 9661 transitions. Word has length 12 [2025-04-13 17:22:46,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:46,815 INFO L485 AbstractCegarLoop]: Abstraction has 2899 states and 9661 transitions. [2025-04-13 17:22:46,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:46,815 INFO L278 IsEmpty]: Start isEmpty. Operand 2899 states and 9661 transitions. [2025-04-13 17:22:46,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:22:46,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:46,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:46,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:22:46,820 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:46,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 301282679, now seen corresponding path program 1 times [2025-04-13 17:22:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:46,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767829416] [2025-04-13 17:22:46,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:46,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:22:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:22:46,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:46,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:46,970 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 17:22:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:46,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767829416] [2025-04-13 17:22:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767829416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:46,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:46,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:22:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776241813] [2025-04-13 17:22:46,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:46,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:22:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:46,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:22:46,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:22:46,971 INFO L87 Difference]: Start difference. First operand 2899 states and 9661 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:47,077 INFO L93 Difference]: Finished difference Result 3349 states and 11006 transitions. [2025-04-13 17:22:47,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:47,078 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 17:22:47,078 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:47,100 INFO L225 Difference]: With dead ends: 3349 [2025-04-13 17:22:47,100 INFO L226 Difference]: Without dead ends: 2719 [2025-04-13 17:22:47,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:47,104 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:47,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-04-13 17:22:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2519. [2025-04-13 17:22:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2518 states have (on average 3.313343923749007) internal successors, (8343), 2518 states have internal predecessors, (8343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 8343 transitions. [2025-04-13 17:22:47,171 INFO L79 Accepts]: Start accepts. Automaton has 2519 states and 8343 transitions. Word has length 14 [2025-04-13 17:22:47,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:47,171 INFO L485 AbstractCegarLoop]: Abstraction has 2519 states and 8343 transitions. [2025-04-13 17:22:47,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,172 INFO L278 IsEmpty]: Start isEmpty. Operand 2519 states and 8343 transitions. [2025-04-13 17:22:47,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:22:47,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:47,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:47,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:22:47,174 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:47,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2064841463, now seen corresponding path program 1 times [2025-04-13 17:22:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:47,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422774651] [2025-04-13 17:22:47,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:22:47,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:22:47,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:47,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:47,371 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 17:22:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:47,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422774651] [2025-04-13 17:22:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422774651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:47,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:22:47,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959198688] [2025-04-13 17:22:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:47,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:47,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:47,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:47,372 INFO L87 Difference]: Start difference. First operand 2519 states and 8343 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:47,501 INFO L93 Difference]: Finished difference Result 3449 states and 11197 transitions. [2025-04-13 17:22:47,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:22:47,502 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 17:22:47,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:47,520 INFO L225 Difference]: With dead ends: 3449 [2025-04-13 17:22:47,520 INFO L226 Difference]: Without dead ends: 2859 [2025-04-13 17:22:47,523 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 17:22:47,524 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:47,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 99 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-04-13 17:22:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2459. [2025-04-13 17:22:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2458 states have (on average 3.30146460537022) internal successors, (8115), 2458 states have internal predecessors, (8115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 8115 transitions. [2025-04-13 17:22:47,600 INFO L79 Accepts]: Start accepts. Automaton has 2459 states and 8115 transitions. Word has length 14 [2025-04-13 17:22:47,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:47,600 INFO L485 AbstractCegarLoop]: Abstraction has 2459 states and 8115 transitions. [2025-04-13 17:22:47,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,600 INFO L278 IsEmpty]: Start isEmpty. Operand 2459 states and 8115 transitions. [2025-04-13 17:22:47,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:22:47,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:47,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:47,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:22:47,603 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:47,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -821041864, now seen corresponding path program 1 times [2025-04-13 17:22:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:47,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384454718] [2025-04-13 17:22:47,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:47,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:22:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:22:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:47,730 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 17:22:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:47,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384454718] [2025-04-13 17:22:47,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384454718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:47,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:47,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:22:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356743539] [2025-04-13 17:22:47,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:47,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:22:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:47,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:22:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:22:47,732 INFO L87 Difference]: Start difference. First operand 2459 states and 8115 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:47,793 INFO L93 Difference]: Finished difference Result 2709 states and 8840 transitions. [2025-04-13 17:22:47,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:47,795 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 17:22:47,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:47,811 INFO L225 Difference]: With dead ends: 2709 [2025-04-13 17:22:47,812 INFO L226 Difference]: Without dead ends: 2359 [2025-04-13 17:22:47,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:47,817 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:47,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 69 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2025-04-13 17:22:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2359. [2025-04-13 17:22:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 3.2888040712468194) internal successors, (7755), 2358 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 7755 transitions. [2025-04-13 17:22:47,897 INFO L79 Accepts]: Start accepts. Automaton has 2359 states and 7755 transitions. Word has length 16 [2025-04-13 17:22:47,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:47,897 INFO L485 AbstractCegarLoop]: Abstraction has 2359 states and 7755 transitions. [2025-04-13 17:22:47,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:47,898 INFO L278 IsEmpty]: Start isEmpty. Operand 2359 states and 7755 transitions. [2025-04-13 17:22:47,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:22:47,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:47,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:47,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:22:47,904 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:47,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 716247128, now seen corresponding path program 1 times [2025-04-13 17:22:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:47,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251341724] [2025-04-13 17:22:47,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:22:47,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:22:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:48,026 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 17:22:48,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:48,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251341724] [2025-04-13 17:22:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251341724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:48,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:22:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724898611] [2025-04-13 17:22:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:48,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:48,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:48,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:48,028 INFO L87 Difference]: Start difference. First operand 2359 states and 7755 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:48,120 INFO L93 Difference]: Finished difference Result 3259 states and 10570 transitions. [2025-04-13 17:22:48,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:22:48,121 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 17:22:48,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:48,132 INFO L225 Difference]: With dead ends: 3259 [2025-04-13 17:22:48,132 INFO L226 Difference]: Without dead ends: 1504 [2025-04-13 17:22:48,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:22:48,136 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:48,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 81 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-04-13 17:22:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2025-04-13 17:22:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 3.1443779108449768) internal successors, (4726), 1503 states have internal predecessors, (4726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4726 transitions. [2025-04-13 17:22:48,175 INFO L79 Accepts]: Start accepts. Automaton has 1504 states and 4726 transitions. Word has length 17 [2025-04-13 17:22:48,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:48,176 INFO L485 AbstractCegarLoop]: Abstraction has 1504 states and 4726 transitions. [2025-04-13 17:22:48,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,176 INFO L278 IsEmpty]: Start isEmpty. Operand 1504 states and 4726 transitions. [2025-04-13 17:22:48,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:22:48,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:48,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:48,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:22:48,181 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:48,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1498000865, now seen corresponding path program 1 times [2025-04-13 17:22:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:48,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014529165] [2025-04-13 17:22:48,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:48,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:22:48,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:22:48,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:48,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:48,321 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 17:22:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:48,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014529165] [2025-04-13 17:22:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014529165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:48,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:22:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480421421] [2025-04-13 17:22:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:48,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:22:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:48,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:22:48,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:22:48,322 INFO L87 Difference]: Start difference. First operand 1504 states and 4726 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:48,407 INFO L93 Difference]: Finished difference Result 1984 states and 6126 transitions. [2025-04-13 17:22:48,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:22:48,409 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:22:48,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:48,416 INFO L225 Difference]: With dead ends: 1984 [2025-04-13 17:22:48,416 INFO L226 Difference]: Without dead ends: 664 [2025-04-13 17:22:48,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:22:48,419 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 113 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:48,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 80 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-04-13 17:22:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2025-04-13 17:22:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 2.8868778280542986) internal successors, (1914), 663 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1914 transitions. [2025-04-13 17:22:48,436 INFO L79 Accepts]: Start accepts. Automaton has 664 states and 1914 transitions. Word has length 19 [2025-04-13 17:22:48,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:48,436 INFO L485 AbstractCegarLoop]: Abstraction has 664 states and 1914 transitions. [2025-04-13 17:22:48,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,437 INFO L278 IsEmpty]: Start isEmpty. Operand 664 states and 1914 transitions. [2025-04-13 17:22:48,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:22:48,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:48,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:48,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:22:48,438 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:48,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1593901473, now seen corresponding path program 1 times [2025-04-13 17:22:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:48,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828743050] [2025-04-13 17:22:48,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:48,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:22:48,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:22:48,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:48,534 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 17:22:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:48,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828743050] [2025-04-13 17:22:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828743050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:22:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979740631] [2025-04-13 17:22:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:48,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:22:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:48,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:22:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:22:48,537 INFO L87 Difference]: Start difference. First operand 664 states and 1914 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:48,576 INFO L93 Difference]: Finished difference Result 928 states and 2626 transitions. [2025-04-13 17:22:48,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:22:48,576 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:22:48,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:48,582 INFO L225 Difference]: With dead ends: 928 [2025-04-13 17:22:48,582 INFO L226 Difference]: Without dead ends: 516 [2025-04-13 17:22:48,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:48,584 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:48,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 40 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-13 17:22:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-04-13 17:22:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 2.741747572815534) internal successors, (1412), 515 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1412 transitions. [2025-04-13 17:22:48,608 INFO L79 Accepts]: Start accepts. Automaton has 516 states and 1412 transitions. Word has length 20 [2025-04-13 17:22:48,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:48,608 INFO L485 AbstractCegarLoop]: Abstraction has 516 states and 1412 transitions. [2025-04-13 17:22:48,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,609 INFO L278 IsEmpty]: Start isEmpty. Operand 516 states and 1412 transitions. [2025-04-13 17:22:48,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:22:48,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:48,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:48,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:22:48,610 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:48,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1808354528, now seen corresponding path program 1 times [2025-04-13 17:22:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:48,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221911942] [2025-04-13 17:22:48,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:22:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:22:48,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:48,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:48,682 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 17:22:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:48,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221911942] [2025-04-13 17:22:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221911942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:48,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:22:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422074678] [2025-04-13 17:22:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:48,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:48,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:48,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:48,683 INFO L87 Difference]: Start difference. First operand 516 states and 1412 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:48,732 INFO L93 Difference]: Finished difference Result 592 states and 1592 transitions. [2025-04-13 17:22:48,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:48,733 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:22:48,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:48,738 INFO L225 Difference]: With dead ends: 592 [2025-04-13 17:22:48,738 INFO L226 Difference]: Without dead ends: 328 [2025-04-13 17:22:48,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:22:48,739 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:48,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-13 17:22:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-04-13 17:22:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.581039755351682) internal successors, (844), 327 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 844 transitions. [2025-04-13 17:22:48,745 INFO L79 Accepts]: Start accepts. Automaton has 328 states and 844 transitions. Word has length 22 [2025-04-13 17:22:48,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:48,745 INFO L485 AbstractCegarLoop]: Abstraction has 328 states and 844 transitions. [2025-04-13 17:22:48,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,745 INFO L278 IsEmpty]: Start isEmpty. Operand 328 states and 844 transitions. [2025-04-13 17:22:48,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:22:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:48,746 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] [2025-04-13 17:22:48,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:22:48,746 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:48,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1738066687, now seen corresponding path program 1 times [2025-04-13 17:22:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:48,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510336059] [2025-04-13 17:22:48,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:48,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:22:48,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:22:48,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:48,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:48,819 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 17:22:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:48,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510336059] [2025-04-13 17:22:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510336059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:22:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555959313] [2025-04-13 17:22:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:48,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:22:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:48,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:22:48,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:22:48,821 INFO L87 Difference]: Start difference. First operand 328 states and 844 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:48,868 INFO L93 Difference]: Finished difference Result 328 states and 844 transitions. [2025-04-13 17:22:48,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:48,868 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:22:48,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:48,870 INFO L225 Difference]: With dead ends: 328 [2025-04-13 17:22:48,870 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:22:48,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:22:48,871 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:48,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:22:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:22:48,871 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 17:22:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:22:48,872 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-04-13 17:22:48,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:48,872 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:22:48,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:48,872 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:22:48,872 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:22:48,874 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 17:22:48,874 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 17:22:48,874 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 17:22:48,874 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 17:22:48,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:22:48,876 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:48,878 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:22:48,878 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:22:48,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:22:48 BasicIcfg [2025-04-13 17:22:48,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:22:48,880 INFO L158 Benchmark]: Toolchain (without parser) took 3944.92ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 106.0MB in the beginning and 255.5MB in the end (delta: -149.5MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2025-04-13 17:22:48,880 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:22:48,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.74ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 83.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:22:48,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:22:48,881 INFO L158 Benchmark]: Boogie Preprocessor took 50.50ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:22:48,881 INFO L158 Benchmark]: RCFGBuilder took 364.31ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 57.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:22:48,881 INFO L158 Benchmark]: TraceAbstraction took 3158.58ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 56.5MB in the beginning and 255.5MB in the end (delta: -199.0MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2025-04-13 17:22:48,882 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.15ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.74ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 83.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.50ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 364.31ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 57.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3158.58ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 56.5MB in the beginning and 255.5MB in the end (delta: -199.0MB). Peak memory consumption was 12.7MB. 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: 18]: 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 7 procedures, 59 locations, 55 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 531 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 531 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 231 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2899occurred in iteration=1, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 960 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 17:22:48,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...