/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-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:01:48,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:01:48,873 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 19:01:48,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:01:48,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:01:48,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:01:48,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:01:48,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:01:48,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:01:48,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:01:48,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:01:48,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:01:48,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:01:48,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:01:48,901 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:01:48,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:01:48,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:01:48,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:48,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:48,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:01:48,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:01:48,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:01:48,904 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 19:01:49,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:01:49,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:01:49,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:01:49,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:01:49,125 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:01:49,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 19:01:50,466 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906c873e3/994ca124363c4608ab0ee89b08733610/FLAG9976fdc28 [2025-04-13 19:01:50,722 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:01:50,722 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2025-04-13 19:01:50,738 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906c873e3/994ca124363c4608ab0ee89b08733610/FLAG9976fdc28 [2025-04-13 19:01:51,517 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906c873e3/994ca124363c4608ab0ee89b08733610 [2025-04-13 19:01:51,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:01:51,520 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:01:51,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:01:51,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:01:51,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:01:51,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed2960d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51, skipping insertion in model container [2025-04-13 19:01:51,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:01:51,778 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-theta/unwind2-100.i[33026,33039] [2025-04-13 19:01:51,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:01:51,801 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:01:51,849 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-theta/unwind2-100.i[33026,33039] [2025-04-13 19:01:51,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:01:51,882 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:01:51,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51 WrapperNode [2025-04-13 19:01:51,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:01:51,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:01:51,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:01:51,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:01:51,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,914 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-13 19:01:51,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:01:51,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:01:51,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:01:51,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:01:51,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,936 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 19:01:51,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:01:51,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:01:51,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:01:51,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:01:51,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (1/1) ... [2025-04-13 19:01:51,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:51,969 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 19:01:51,971 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 19:01:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:01:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 19:01:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 19:01:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 19:01:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 19:01:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:01:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:01:51,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:01:51,988 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 19:01:52,064 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:01:52,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:01:52,147 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:01:52,148 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:01:52,148 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:01:52,221 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:01:52,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:01:52 BoogieIcfgContainer [2025-04-13 19:01:52,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:01:52,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:01:52,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:01:52,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:01:52,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:01:51" (1/3) ... [2025-04-13 19:01:52,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec1bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:01:52, skipping insertion in model container [2025-04-13 19:01:52,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:51" (2/3) ... [2025-04-13 19:01:52,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec1bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:01:52, skipping insertion in model container [2025-04-13 19:01:52,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:01:52" (3/3) ... [2025-04-13 19:01:52,227 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2025-04-13 19:01:52,236 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:01:52,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 19:01:52,237 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:01:52,273 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:01:52,293 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 19:01:52,312 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,329 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:01:52,336 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;@8b0f1a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:01:52,336 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:01:52,337 INFO L278 IsEmpty]: Start isEmpty. Operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 19:01:52,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:52,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:01:52,342 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:52,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1968472706, now seen corresponding path program 1 times [2025-04-13 19:01:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:52,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609057900] [2025-04-13 19:01:52,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:52,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:01:52,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:01:52,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:52,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:52,617 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 19:01:52,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:52,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609057900] [2025-04-13 19:01:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609057900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:52,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:52,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456564090] [2025-04-13 19:01:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:52,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:52,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:52,656 INFO L87 Difference]: Start difference. First operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:52,834 INFO L93 Difference]: Finished difference Result 175 states and 433 transitions. [2025-04-13 19:01:52,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:01:52,835 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-13 19:01:52,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:52,842 INFO L225 Difference]: With dead ends: 175 [2025-04-13 19:01:52,842 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 19:01:52,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:01:52,845 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:52,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 8 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 19:01:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2025-04-13 19:01:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 2.4537037037037037) internal successors, (265), 110 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 265 transitions. [2025-04-13 19:01:52,874 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 265 transitions. Word has length 6 [2025-04-13 19:01:52,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:52,875 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 265 transitions. [2025-04-13 19:01:52,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:52,875 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 265 transitions. [2025-04-13 19:01:52,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 19:01:52,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:52,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:52,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:01:52,876 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:52,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:52,877 INFO L85 PathProgramCache]: Analyzing trace with hash -893111565, now seen corresponding path program 1 times [2025-04-13 19:01:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:52,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305547362] [2025-04-13 19:01:52,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:01:52,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:01:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:52,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305547362] [2025-04-13 19:01:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305547362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:52,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463782767] [2025-04-13 19:01:52,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:52,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:52,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:52,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:53,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:01:53,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:01:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:01:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:53,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:53,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463782767] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:53,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 19:01:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24442776] [2025-04-13 19:01:53,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:53,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:53,165 INFO L87 Difference]: Start difference. First operand 111 states and 265 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 19:01:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:53,487 INFO L93 Difference]: Finished difference Result 241 states and 675 transitions. [2025-04-13 19:01:53,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:01:53,488 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 7 [2025-04-13 19:01:53,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:53,490 INFO L225 Difference]: With dead ends: 241 [2025-04-13 19:01:53,491 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 19:01:53,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:53,491 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 163 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:53,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 19 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:01:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 19:01:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 153. [2025-04-13 19:01:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 150 states have (on average 2.4466666666666668) internal successors, (367), 152 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2025-04-13 19:01:53,512 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 7 [2025-04-13 19:01:53,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:53,512 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2025-04-13 19:01:53,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 19:01:53,512 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2025-04-13 19:01:53,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 19:01:53,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:53,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:53,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:53,717 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1962707443, now seen corresponding path program 1 times [2025-04-13 19:01:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470150539] [2025-04-13 19:01:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:01:53,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:01:53,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,814 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 19:01:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:53,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470150539] [2025-04-13 19:01:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470150539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:53,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070122657] [2025-04-13 19:01:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:53,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:53,815 INFO L87 Difference]: Start difference. First operand 153 states and 367 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:53,940 INFO L93 Difference]: Finished difference Result 291 states and 736 transitions. [2025-04-13 19:01:53,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:01:53,940 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-13 19:01:53,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:53,942 INFO L225 Difference]: With dead ends: 291 [2025-04-13 19:01:53,942 INFO L226 Difference]: Without dead ends: 248 [2025-04-13 19:01:53,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:01:53,943 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:53,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 8 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-13 19:01:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2025-04-13 19:01:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 2.452127659574468) internal successors, (461), 190 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 461 transitions. [2025-04-13 19:01:53,962 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 461 transitions. Word has length 8 [2025-04-13 19:01:53,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:53,962 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 461 transitions. [2025-04-13 19:01:53,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:53,962 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 461 transitions. [2025-04-13 19:01:53,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 19:01:53,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:53,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:01:53,963 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -714388406, now seen corresponding path program 1 times [2025-04-13 19:01:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030418470] [2025-04-13 19:01:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:01:53,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:01:53,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:54,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030418470] [2025-04-13 19:01:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030418470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:54,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533257188] [2025-04-13 19:01:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:54,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:54,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:01:54,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:01:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:01:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:54,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:54,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:54,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533257188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:54,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 19:01:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191098524] [2025-04-13 19:01:54,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:54,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:54,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:54,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:54,185 INFO L87 Difference]: Start difference. First operand 191 states and 461 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:54,441 INFO L93 Difference]: Finished difference Result 405 states and 1158 transitions. [2025-04-13 19:01:54,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:01:54,442 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 9 [2025-04-13 19:01:54,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:54,444 INFO L225 Difference]: With dead ends: 405 [2025-04-13 19:01:54,444 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 19:01:54,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:54,445 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 179 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:54,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 18 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 19:01:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 260. [2025-04-13 19:01:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 19:01:54,468 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 9 [2025-04-13 19:01:54,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:54,468 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 19:01:54,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,469 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 19:01:54,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:54,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:54,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:54,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:54,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 19:01:54,670 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:54,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -671449970, now seen corresponding path program 1 times [2025-04-13 19:01:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:54,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154080993] [2025-04-13 19:01:54,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:01:54,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:54,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:54,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:54,733 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 19:01:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:54,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154080993] [2025-04-13 19:01:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154080993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178877457] [2025-04-13 19:01:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:54,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:54,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:54,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:54,734 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:54,860 INFO L93 Difference]: Finished difference Result 410 states and 1003 transitions. [2025-04-13 19:01:54,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:01:54,861 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-13 19:01:54,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:54,863 INFO L225 Difference]: With dead ends: 410 [2025-04-13 19:01:54,863 INFO L226 Difference]: Without dead ends: 379 [2025-04-13 19:01:54,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:01:54,864 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:54,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 7 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-04-13 19:01:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 260. [2025-04-13 19:01:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 19:01:54,888 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 10 [2025-04-13 19:01:54,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:54,888 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 19:01:54,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:54,888 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 19:01:54,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:54,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:54,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:54,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:01:54,891 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:54,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash -677879252, now seen corresponding path program 1 times [2025-04-13 19:01:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:54,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260148883] [2025-04-13 19:01:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:54,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:01:54,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:54,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:54,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:54,952 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 19:01:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:54,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260148883] [2025-04-13 19:01:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260148883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:54,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:54,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800815760] [2025-04-13 19:01:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:54,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:54,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:54,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:54,954 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:55,060 INFO L93 Difference]: Finished difference Result 415 states and 1013 transitions. [2025-04-13 19:01:55,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:01:55,061 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-13 19:01:55,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:55,064 INFO L225 Difference]: With dead ends: 415 [2025-04-13 19:01:55,064 INFO L226 Difference]: Without dead ends: 378 [2025-04-13 19:01:55,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:01:55,065 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:55,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 7 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-04-13 19:01:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 260. [2025-04-13 19:01:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 257 states have (on average 2.4591439688715955) internal successors, (632), 259 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 632 transitions. [2025-04-13 19:01:55,091 INFO L79 Accepts]: Start accepts. Automaton has 260 states and 632 transitions. Word has length 10 [2025-04-13 19:01:55,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:55,092 INFO L485 AbstractCegarLoop]: Abstraction has 260 states and 632 transitions. [2025-04-13 19:01:55,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,092 INFO L278 IsEmpty]: Start isEmpty. Operand 260 states and 632 transitions. [2025-04-13 19:01:55,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:55,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:55,093 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:55,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:01:55,093 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:55,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash 635941566, now seen corresponding path program 2 times [2025-04-13 19:01:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:55,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976508544] [2025-04-13 19:01:55,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:55,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 19:01:55,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:55,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:55,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976508544] [2025-04-13 19:01:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976508544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:55,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887502359] [2025-04-13 19:01:55,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:55,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:55,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:01:55,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 19:01:55,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:55,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:55,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:55,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:01:55,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:55,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887502359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:55,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 19:01:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343202769] [2025-04-13 19:01:55,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:55,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:01:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:55,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:01:55,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:01:55,384 INFO L87 Difference]: Start difference. First operand 260 states and 632 transitions. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:55,945 INFO L93 Difference]: Finished difference Result 662 states and 2007 transitions. [2025-04-13 19:01:55,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 19:01:55,945 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 19:01:55,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:55,949 INFO L225 Difference]: With dead ends: 662 [2025-04-13 19:01:55,949 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 19:01:55,950 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=615, Invalid=1365, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 19:01:55,951 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 416 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:55,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 35 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:01:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 19:01:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 404. [2025-04-13 19:01:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 401 states have (on average 2.458852867830424) internal successors, (986), 403 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 986 transitions. [2025-04-13 19:01:55,990 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 986 transitions. Word has length 10 [2025-04-13 19:01:55,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:55,990 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 986 transitions. [2025-04-13 19:01:55,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:55,990 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 986 transitions. [2025-04-13 19:01:55,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 19:01:55,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:55,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:55,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:01:56,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:56,192 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:56,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash 659887593, now seen corresponding path program 1 times [2025-04-13 19:01:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:56,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288159456] [2025-04-13 19:01:56,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:56,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:56,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:56,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:56,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288159456] [2025-04-13 19:01:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288159456] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:56,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811074070] [2025-04-13 19:01:56,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:56,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:56,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:56,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:56,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:01:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:56,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:56,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:56,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:56,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:56,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:56,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811074070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:56,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 19:01:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616559276] [2025-04-13 19:01:56,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:56,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:56,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:56,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:56,352 INFO L87 Difference]: Start difference. First operand 404 states and 986 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:56,624 INFO L93 Difference]: Finished difference Result 761 states and 1983 transitions. [2025-04-13 19:01:56,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:01:56,624 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 11 [2025-04-13 19:01:56,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:56,627 INFO L225 Difference]: With dead ends: 761 [2025-04-13 19:01:56,627 INFO L226 Difference]: Without dead ends: 706 [2025-04-13 19:01:56,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-04-13 19:01:56,628 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:56,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 17 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-04-13 19:01:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 377. [2025-04-13 19:01:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 374 states have (on average 2.4572192513368982) internal successors, (919), 376 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 919 transitions. [2025-04-13 19:01:56,661 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 919 transitions. Word has length 11 [2025-04-13 19:01:56,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:56,662 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 919 transitions. [2025-04-13 19:01:56,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:56,662 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 919 transitions. [2025-04-13 19:01:56,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 19:01:56,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:56,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:56,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:01:56,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:56,863 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:56,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 460579845, now seen corresponding path program 1 times [2025-04-13 19:01:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:56,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171101170] [2025-04-13 19:01:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:56,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:56,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:56,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:56,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:56,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171101170] [2025-04-13 19:01:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171101170] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:56,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561785034] [2025-04-13 19:01:56,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:56,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:56,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:56,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:56,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:01:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:56,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:56,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:56,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:56,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561785034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:57,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 19:01:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140787223] [2025-04-13 19:01:57,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:57,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:01:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:01:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:01:57,039 INFO L87 Difference]: Start difference. First operand 377 states and 919 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:57,267 INFO L93 Difference]: Finished difference Result 691 states and 1757 transitions. [2025-04-13 19:01:57,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:01:57,268 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 11 [2025-04-13 19:01:57,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:57,271 INFO L225 Difference]: With dead ends: 691 [2025-04-13 19:01:57,271 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 19:01:57,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-04-13 19:01:57,272 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:57,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 13 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 19:01:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 377. [2025-04-13 19:01:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 374 states have (on average 2.4572192513368982) internal successors, (919), 376 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 919 transitions. [2025-04-13 19:01:57,310 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 919 transitions. Word has length 11 [2025-04-13 19:01:57,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:57,310 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 919 transitions. [2025-04-13 19:01:57,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:57,310 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 919 transitions. [2025-04-13 19:01:57,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 19:01:57,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:57,311 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:57,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:01:57,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:57,515 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:57,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -781869747, now seen corresponding path program 2 times [2025-04-13 19:01:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:57,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488300402] [2025-04-13 19:01:57,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:57,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 19:01:57,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:01:57,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:57,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:57,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488300402] [2025-04-13 19:01:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488300402] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:57,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315799662] [2025-04-13 19:01:57,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:57,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:57,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:57,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:01:57,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 19:01:57,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:01:57,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:57,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:57,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:01:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:57,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:57,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315799662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:57,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 19:01:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451302459] [2025-04-13 19:01:57,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:57,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:01:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:57,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:01:57,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:01:57,790 INFO L87 Difference]: Start difference. First operand 377 states and 919 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:58,395 INFO L93 Difference]: Finished difference Result 1145 states and 3468 transitions. [2025-04-13 19:01:58,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 19:01:58,396 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 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 19:01:58,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:58,400 INFO L225 Difference]: With dead ends: 1145 [2025-04-13 19:01:58,400 INFO L226 Difference]: Without dead ends: 1078 [2025-04-13 19:01:58,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=615, Invalid=1365, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 19:01:58,401 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 313 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:58,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 30 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:01:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-04-13 19:01:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 614. [2025-04-13 19:01:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 611 states have (on average 2.4680851063829787) internal successors, (1508), 613 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1508 transitions. [2025-04-13 19:01:58,483 INFO L79 Accepts]: Start accepts. Automaton has 614 states and 1508 transitions. Word has length 12 [2025-04-13 19:01:58,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:58,483 INFO L485 AbstractCegarLoop]: Abstraction has 614 states and 1508 transitions. [2025-04-13 19:01:58,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:58,484 INFO L278 IsEmpty]: Start isEmpty. Operand 614 states and 1508 transitions. [2025-04-13 19:01:58,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 19:01:58,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:58,484 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:58,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:58,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:58,685 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:58,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 646150990, now seen corresponding path program 2 times [2025-04-13 19:01:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:58,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115242147] [2025-04-13 19:01:58,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:58,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:01:58,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:01:58,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:58,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115242147] [2025-04-13 19:01:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115242147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:58,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413169433] [2025-04-13 19:01:58,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:58,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:58,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:58,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:01:58,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:01:58,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:01:58,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:58,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:58,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:01:58,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:58,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413169433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:58,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 19:01:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866640733] [2025-04-13 19:01:58,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:58,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:01:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:58,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:01:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:01:58,930 INFO L87 Difference]: Start difference. First operand 614 states and 1508 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:59,465 INFO L93 Difference]: Finished difference Result 1307 states and 3504 transitions. [2025-04-13 19:01:59,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:01:59,465 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 19:01:59,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:59,470 INFO L225 Difference]: With dead ends: 1307 [2025-04-13 19:01:59,470 INFO L226 Difference]: Without dead ends: 1252 [2025-04-13 19:01:59,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 19:01:59,471 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 171 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:59,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 20 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:01:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-04-13 19:01:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 587. [2025-04-13 19:01:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 584 states have (on average 2.4674657534246576) internal successors, (1441), 586 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1441 transitions. [2025-04-13 19:01:59,544 INFO L79 Accepts]: Start accepts. Automaton has 587 states and 1441 transitions. Word has length 14 [2025-04-13 19:01:59,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:59,545 INFO L485 AbstractCegarLoop]: Abstraction has 587 states and 1441 transitions. [2025-04-13 19:01:59,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:59,545 INFO L278 IsEmpty]: Start isEmpty. Operand 587 states and 1441 transitions. [2025-04-13 19:01:59,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 19:01:59,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:59,545 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:59,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:01:59,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:59,746 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:59,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1286172564, now seen corresponding path program 2 times [2025-04-13 19:01:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:59,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654031313] [2025-04-13 19:01:59,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:59,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:01:59,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:01:59,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:59,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654031313] [2025-04-13 19:01:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654031313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:59,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160596150] [2025-04-13 19:01:59,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:59,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:01:59,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:01:59,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:01:59,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:59,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:59,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:01:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:59,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160596150] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:59,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:59,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 19:01:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543713914] [2025-04-13 19:01:59,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:59,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:01:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:59,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:01:59,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:01:59,980 INFO L87 Difference]: Start difference. First operand 587 states and 1441 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:00,424 INFO L93 Difference]: Finished difference Result 1309 states and 3503 transitions. [2025-04-13 19:02:00,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 19:02:00,424 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 19:02:00,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:00,429 INFO L225 Difference]: With dead ends: 1309 [2025-04-13 19:02:00,429 INFO L226 Difference]: Without dead ends: 1242 [2025-04-13 19:02:00,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 19:02:00,430 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 190 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:00,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 14 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:02:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-04-13 19:02:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 559. [2025-04-13 19:02:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 556 states have (on average 2.4658273381294964) internal successors, (1371), 558 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1371 transitions. [2025-04-13 19:02:00,563 INFO L79 Accepts]: Start accepts. Automaton has 559 states and 1371 transitions. Word has length 14 [2025-04-13 19:02:00,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:00,563 INFO L485 AbstractCegarLoop]: Abstraction has 559 states and 1371 transitions. [2025-04-13 19:02:00,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:00,563 INFO L278 IsEmpty]: Start isEmpty. Operand 559 states and 1371 transitions. [2025-04-13 19:02:00,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 19:02:00,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:00,563 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:00,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 19:02:00,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 19:02:00,764 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:00,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1825920670, now seen corresponding path program 3 times [2025-04-13 19:02:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:00,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344994083] [2025-04-13 19:02:00,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:00,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 19:02:00,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 19:02:00,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:02:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:02:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:00,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344994083] [2025-04-13 19:02:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344994083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:00,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025028397] [2025-04-13 19:02:00,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:00,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:00,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:00,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:00,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 19:02:00,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-04-13 19:02:00,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 16 statements. [2025-04-13 19:02:00,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:02:00,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:02:00,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:02:00,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:02:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025028397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:00,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:02:00,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 19:02:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637093771] [2025-04-13 19:02:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:00,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:02:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:00,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:02:00,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:02:00,909 INFO L87 Difference]: Start difference. First operand 559 states and 1371 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:01,379 INFO L93 Difference]: Finished difference Result 1309 states and 3261 transitions. [2025-04-13 19:02:01,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:02:01,379 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 19:02:01,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:01,384 INFO L225 Difference]: With dead ends: 1309 [2025-04-13 19:02:01,384 INFO L226 Difference]: Without dead ends: 1225 [2025-04-13 19:02:01,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:02:01,385 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:01,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:02:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-04-13 19:02:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 861. [2025-04-13 19:02:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 858 states have (on average 2.5093240093240095) internal successors, (2153), 860 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2153 transitions. [2025-04-13 19:02:01,564 INFO L79 Accepts]: Start accepts. Automaton has 861 states and 2153 transitions. Word has length 16 [2025-04-13 19:02:01,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:01,564 INFO L485 AbstractCegarLoop]: Abstraction has 861 states and 2153 transitions. [2025-04-13 19:02:01,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:01,564 INFO L278 IsEmpty]: Start isEmpty. Operand 861 states and 2153 transitions. [2025-04-13 19:02:01,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 19:02:01,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:01,565 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:01,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 19:02:01,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 19:02:01,769 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:01,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -806663123, now seen corresponding path program 3 times [2025-04-13 19:02:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:01,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135184652] [2025-04-13 19:02:01,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:01,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:01,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 19:02:01,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 19:02:01,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:02:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:02:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:01,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135184652] [2025-04-13 19:02:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135184652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:01,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922517706] [2025-04-13 19:02:01,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:01,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:01,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:01,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 19:02:01,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 19:02:01,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 19:02:01,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:02:01,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:01,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:02:01,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:02:01,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:02:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922517706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:02:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:02:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 19:02:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643151495] [2025-04-13 19:02:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:02:01,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:02:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:01,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:02:01,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:02:01,883 INFO L87 Difference]: Start difference. First operand 861 states and 2153 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:02,455 INFO L93 Difference]: Finished difference Result 1485 states and 3726 transitions. [2025-04-13 19:02:02,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:02:02,455 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 19:02:02,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:02,458 INFO L225 Difference]: With dead ends: 1485 [2025-04-13 19:02:02,458 INFO L226 Difference]: Without dead ends: 713 [2025-04-13 19:02:02,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:02:02,459 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:02,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 19:02:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-04-13 19:02:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-04-13 19:02:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 711 states have (on average 2.4753867791842477) internal successors, (1760), 712 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1760 transitions. [2025-04-13 19:02:02,641 INFO L79 Accepts]: Start accepts. Automaton has 713 states and 1760 transitions. Word has length 18 [2025-04-13 19:02:02,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:02,641 INFO L485 AbstractCegarLoop]: Abstraction has 713 states and 1760 transitions. [2025-04-13 19:02:02,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:02,642 INFO L278 IsEmpty]: Start isEmpty. Operand 713 states and 1760 transitions. [2025-04-13 19:02:02,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 19:02:02,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:02,642 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:02,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 19:02:02,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 19:02:02,843 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:02,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -141499026, now seen corresponding path program 3 times [2025-04-13 19:02:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:02,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241062194] [2025-04-13 19:02:02,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:02,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 19:02:02,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:02:02,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:02:02,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:03,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241062194] [2025-04-13 19:02:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241062194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:03,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842091413] [2025-04-13 19:02:03,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:03,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:03,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:03,004 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:03,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:02:03,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 19:02:03,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:02:03,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:02:03,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:03,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 19:02:03,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:03,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842091413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:03,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 19:02:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005572692] [2025-04-13 19:02:03,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:03,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:02:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:03,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:02:03,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:02:03,334 INFO L87 Difference]: Start difference. First operand 713 states and 1760 transitions. Second operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:04,131 INFO L93 Difference]: Finished difference Result 1064 states and 2928 transitions. [2025-04-13 19:02:04,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 19:02:04,132 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:02:04,132 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:04,136 INFO L225 Difference]: With dead ends: 1064 [2025-04-13 19:02:04,136 INFO L226 Difference]: Without dead ends: 1037 [2025-04-13 19:02:04,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 19:02:04,137 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 401 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:04,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 25 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:02:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-04-13 19:02:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2025-04-13 19:02:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1035 states have (on average 2.477294685990338) internal successors, (2564), 1036 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2564 transitions. [2025-04-13 19:02:04,406 INFO L79 Accepts]: Start accepts. Automaton has 1037 states and 2564 transitions. Word has length 20 [2025-04-13 19:02:04,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:04,407 INFO L485 AbstractCegarLoop]: Abstraction has 1037 states and 2564 transitions. [2025-04-13 19:02:04,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:04,407 INFO L278 IsEmpty]: Start isEmpty. Operand 1037 states and 2564 transitions. [2025-04-13 19:02:04,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 19:02:04,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:04,407 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:04,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:02:04,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 19:02:04,608 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:04,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1701231052, now seen corresponding path program 3 times [2025-04-13 19:02:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:04,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476247542] [2025-04-13 19:02:04,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:04,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 19:02:04,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:02:04,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:02:04,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:04,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476247542] [2025-04-13 19:02:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476247542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:04,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453522213] [2025-04-13 19:02:04,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:02:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:04,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:04,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:04,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 19:02:04,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-04-13 19:02:04,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:02:04,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:02:04,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:04,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 19:02:04,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:04,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453522213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:05,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-04-13 19:02:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027548428] [2025-04-13 19:02:05,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:05,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:02:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:05,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:02:05,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:02:05,106 INFO L87 Difference]: Start difference. First operand 1037 states and 2564 transitions. Second operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:05,923 INFO L93 Difference]: Finished difference Result 1375 states and 3695 transitions. [2025-04-13 19:02:05,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 19:02:05,923 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:02:05,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:05,928 INFO L225 Difference]: With dead ends: 1375 [2025-04-13 19:02:05,928 INFO L226 Difference]: Without dead ends: 1349 [2025-04-13 19:02:05,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1350, Invalid=2810, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 19:02:05,929 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 314 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:05,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 13 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:02:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-04-13 19:02:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-04-13 19:02:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1347 states have (on average 2.482553823311062) internal successors, (3344), 1348 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 3344 transitions. [2025-04-13 19:02:06,212 INFO L79 Accepts]: Start accepts. Automaton has 1349 states and 3344 transitions. Word has length 20 [2025-04-13 19:02:06,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:06,212 INFO L485 AbstractCegarLoop]: Abstraction has 1349 states and 3344 transitions. [2025-04-13 19:02:06,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:06,212 INFO L278 IsEmpty]: Start isEmpty. Operand 1349 states and 3344 transitions. [2025-04-13 19:02:06,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 19:02:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:06,214 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:06,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 19:02:06,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 19:02:06,414 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:06,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1295158866, now seen corresponding path program 4 times [2025-04-13 19:02:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:06,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67937392] [2025-04-13 19:02:06,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:06,418 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:06,422 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:06,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:06,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67937392] [2025-04-13 19:02:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67937392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:06,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291850708] [2025-04-13 19:02:06,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:06,820 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:06,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 19:02:06,856 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:06,867 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:06,867 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:06,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:06,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 19:02:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:07,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291850708] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:07,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-13 19:02:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225192715] [2025-04-13 19:02:07,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:07,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-13 19:02:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:07,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-13 19:02:07,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 19:02:07,783 INFO L87 Difference]: Start difference. First operand 1349 states and 3344 transitions. Second operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:09,707 INFO L93 Difference]: Finished difference Result 2024 states and 5640 transitions. [2025-04-13 19:02:09,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 19:02:09,708 INFO L79 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 19:02:09,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:09,715 INFO L225 Difference]: With dead ends: 2024 [2025-04-13 19:02:09,715 INFO L226 Difference]: Without dead ends: 1997 [2025-04-13 19:02:09,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4547 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5114, Invalid=10386, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 19:02:09,718 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 1151 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:09,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 22 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 19:02:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2025-04-13 19:02:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2025-04-13 19:02:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1995 states have (on average 2.482205513784461) internal successors, (4952), 1996 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 4952 transitions. [2025-04-13 19:02:10,110 INFO L79 Accepts]: Start accepts. Automaton has 1997 states and 4952 transitions. Word has length 32 [2025-04-13 19:02:10,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:10,110 INFO L485 AbstractCegarLoop]: Abstraction has 1997 states and 4952 transitions. [2025-04-13 19:02:10,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:10,110 INFO L278 IsEmpty]: Start isEmpty. Operand 1997 states and 4952 transitions. [2025-04-13 19:02:10,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 19:02:10,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:10,111 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:10,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 19:02:10,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 19:02:10,312 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:10,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2004388724, now seen corresponding path program 4 times [2025-04-13 19:02:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:10,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470843669] [2025-04-13 19:02:10,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:10,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:10,316 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:10,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:10,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:10,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:10,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470843669] [2025-04-13 19:02:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470843669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:10,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036577652] [2025-04-13 19:02:10,709 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:02:10,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:10,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:10,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:10,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 19:02:10,744 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:10,756 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:10,756 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:02:10,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 19:02:10,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:11,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036577652] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:11,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-04-13 19:02:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172344108] [2025-04-13 19:02:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:11,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-13 19:02:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-13 19:02:11,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 19:02:11,659 INFO L87 Difference]: Start difference. First operand 1997 states and 4952 transitions. Second operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:13,595 INFO L93 Difference]: Finished difference Result 2647 states and 7175 transitions. [2025-04-13 19:02:13,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 19:02:13,595 INFO L79 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 19:02:13,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:13,604 INFO L225 Difference]: With dead ends: 2647 [2025-04-13 19:02:13,604 INFO L226 Difference]: Without dead ends: 2621 [2025-04-13 19:02:13,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4547 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5114, Invalid=10386, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 19:02:13,607 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 783 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:13,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 26 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:02:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2025-04-13 19:02:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2621. [2025-04-13 19:02:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 2.486445208094693) internal successors, (6512), 2620 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 6512 transitions. [2025-04-13 19:02:14,104 INFO L79 Accepts]: Start accepts. Automaton has 2621 states and 6512 transitions. Word has length 32 [2025-04-13 19:02:14,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:14,104 INFO L485 AbstractCegarLoop]: Abstraction has 2621 states and 6512 transitions. [2025-04-13 19:02:14,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:14,105 INFO L278 IsEmpty]: Start isEmpty. Operand 2621 states and 6512 transitions. [2025-04-13 19:02:14,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 19:02:14,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:14,108 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:14,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 19:02:14,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:14,308 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:14,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -104502738, now seen corresponding path program 5 times [2025-04-13 19:02:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:14,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991887320] [2025-04-13 19:02:14,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:14,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 19:02:14,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 19:02:14,325 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 19:02:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:15,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991887320] [2025-04-13 19:02:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991887320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:15,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384179901] [2025-04-13 19:02:15,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:15,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:15,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 19:02:15,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 19:02:15,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 19:02:15,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 19:02:15,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:15,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 19:02:15,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:16,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384179901] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:18,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 19:02:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540724947] [2025-04-13 19:02:18,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:18,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 19:02:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:18,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 19:02:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 19:02:18,305 INFO L87 Difference]: Start difference. First operand 2621 states and 6512 transitions. Second operand has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:24,300 INFO L93 Difference]: Finished difference Result 3944 states and 11064 transitions. [2025-04-13 19:02:24,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 19:02:24,301 INFO L79 Accepts]: Start accepts. Automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 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 56 [2025-04-13 19:02:24,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:24,311 INFO L225 Difference]: With dead ends: 3944 [2025-04-13 19:02:24,312 INFO L226 Difference]: Without dead ends: 3917 [2025-04-13 19:02:24,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=20006, Invalid=39774, Unknown=0, NotChecked=0, Total=59780 [2025-04-13 19:02:24,315 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 1960 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:24,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 37 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:02:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2025-04-13 19:02:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3917. [2025-04-13 19:02:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3915 states have (on average 2.484802043422733) internal successors, (9728), 3916 states have internal predecessors, (9728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 9728 transitions. [2025-04-13 19:02:25,140 INFO L79 Accepts]: Start accepts. Automaton has 3917 states and 9728 transitions. Word has length 56 [2025-04-13 19:02:25,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:25,140 INFO L485 AbstractCegarLoop]: Abstraction has 3917 states and 9728 transitions. [2025-04-13 19:02:25,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:25,140 INFO L278 IsEmpty]: Start isEmpty. Operand 3917 states and 9728 transitions. [2025-04-13 19:02:25,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 19:02:25,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:25,144 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:25,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 19:02:25,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:25,344 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:25,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 267553292, now seen corresponding path program 5 times [2025-04-13 19:02:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:25,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067110451] [2025-04-13 19:02:25,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:25,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 19:02:25,367 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 19:02:25,367 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 19:02:25,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:26,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067110451] [2025-04-13 19:02:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067110451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:26,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4840503] [2025-04-13 19:02:26,358 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:02:26,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:26,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:26,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 19:02:26,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 24 equivalence classes. [2025-04-13 19:02:26,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 19:02:26,409 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 19:02:26,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:26,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 19:02:26,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:27,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4840503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:29,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-04-13 19:02:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672441876] [2025-04-13 19:02:29,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:29,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2025-04-13 19:02:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:29,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2025-04-13 19:02:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9087, Invalid=12965, Unknown=0, NotChecked=0, Total=22052 [2025-04-13 19:02:29,252 INFO L87 Difference]: Start difference. First operand 3917 states and 9728 transitions. Second operand has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:35,075 INFO L93 Difference]: Finished difference Result 5191 states and 14135 transitions. [2025-04-13 19:02:35,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 19:02:35,075 INFO L79 Accepts]: Start accepts. Automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 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 56 [2025-04-13 19:02:35,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:35,087 INFO L225 Difference]: With dead ends: 5191 [2025-04-13 19:02:35,087 INFO L226 Difference]: Without dead ends: 5165 [2025-04-13 19:02:35,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=20006, Invalid=39774, Unknown=0, NotChecked=0, Total=59780 [2025-04-13 19:02:35,090 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 2223 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:35,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 23 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 19:02:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-04-13 19:02:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2025-04-13 19:02:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5163 states have (on average 2.4884756924268836) internal successors, (12848), 5164 states have internal predecessors, (12848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 12848 transitions. [2025-04-13 19:02:36,245 INFO L79 Accepts]: Start accepts. Automaton has 5165 states and 12848 transitions. Word has length 56 [2025-04-13 19:02:36,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:36,246 INFO L485 AbstractCegarLoop]: Abstraction has 5165 states and 12848 transitions. [2025-04-13 19:02:36,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:36,246 INFO L278 IsEmpty]: Start isEmpty. Operand 5165 states and 12848 transitions. [2025-04-13 19:02:36,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-13 19:02:36,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:36,252 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:36,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 19:02:36,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:36,453 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:36,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1567677230, now seen corresponding path program 6 times [2025-04-13 19:02:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:36,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86411325] [2025-04-13 19:02:36,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:36,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 19:02:36,485 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 19:02:36,485 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 19:02:36,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:39,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86411325] [2025-04-13 19:02:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86411325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:39,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134662595] [2025-04-13 19:02:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:39,694 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:39,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 19:02:39,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 19:02:39,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 19:02:39,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 19:02:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:39,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 19:02:39,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:42,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134662595] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:45,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-04-13 19:02:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254799357] [2025-04-13 19:02:45,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:45,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-04-13 19:02:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:45,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-04-13 19:02:45,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14950, Invalid=26056, Unknown=0, NotChecked=0, Total=41006 [2025-04-13 19:02:45,851 INFO L87 Difference]: Start difference. First operand 5165 states and 12848 transitions. Second operand has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:55,131 INFO L93 Difference]: Finished difference Result 5354 states and 13452 transitions. [2025-04-13 19:02:55,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 19:02:55,131 INFO L79 Accepts]: Start accepts. Automaton has has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 0 states have call successors, (0), 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 104 [2025-04-13 19:02:55,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:55,143 INFO L225 Difference]: With dead ends: 5354 [2025-04-13 19:02:55,143 INFO L226 Difference]: Without dead ends: 5327 [2025-04-13 19:02:55,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 13 SyntacticMatches, 90 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43143 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=30525, Invalid=62195, Unknown=0, NotChecked=0, Total=92720 [2025-04-13 19:02:55,148 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 2866 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:55,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2866 Valid, 25 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 19:02:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2025-04-13 19:02:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 5327. [2025-04-13 19:02:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5327 states, 5325 states have (on average 2.488262910798122) internal successors, (13250), 5326 states have internal predecessors, (13250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 13250 transitions. [2025-04-13 19:02:56,135 INFO L79 Accepts]: Start accepts. Automaton has 5327 states and 13250 transitions. Word has length 104 [2025-04-13 19:02:56,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:56,136 INFO L485 AbstractCegarLoop]: Abstraction has 5327 states and 13250 transitions. [2025-04-13 19:02:56,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 202 states have (on average 1.0643564356435644) internal successors, (215), 202 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:56,136 INFO L278 IsEmpty]: Start isEmpty. Operand 5327 states and 13250 transitions. [2025-04-13 19:02:56,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-13 19:02:56,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:56,141 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:56,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 19:02:56,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:56,342 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:02:56,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -928041716, now seen corresponding path program 6 times [2025-04-13 19:02:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:56,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419886125] [2025-04-13 19:02:56,342 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:56,347 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 19:02:56,370 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 19:02:56,370 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 19:02:56,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419886125] [2025-04-13 19:02:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419886125] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643841731] [2025-04-13 19:02:59,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:02:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:59,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:59,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 19:02:59,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 48 equivalence classes. [2025-04-13 19:02:59,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 104 of 104 statements. [2025-04-13 19:02:59,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-04-13 19:02:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:59,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-13 19:02:59,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:03:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:02,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:03:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:03:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643841731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:03:05,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:03:05,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 202 [2025-04-13 19:03:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375570333] [2025-04-13 19:03:05,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:03:05,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2025-04-13 19:03:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:03:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2025-04-13 19:03:05,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=26265, Unknown=0, NotChecked=0, Total=41412 [2025-04-13 19:03:05,901 INFO L87 Difference]: Start difference. First operand 5327 states and 13250 transitions. Second operand has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:03:14,559 INFO L93 Difference]: Finished difference Result 5535 states and 13926 transitions. [2025-04-13 19:03:14,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 19:03:14,559 INFO L79 Accepts]: Start accepts. Automaton has has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 0 states have call successors, (0), 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 104 [2025-04-13 19:03:14,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:03:14,570 INFO L225 Difference]: With dead ends: 5535 [2025-04-13 19:03:14,571 INFO L226 Difference]: Without dead ends: 5509 [2025-04-13 19:03:14,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 13 SyntacticMatches, 89 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43524 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=30933, Invalid=63009, Unknown=0, NotChecked=0, Total=93942 [2025-04-13 19:03:14,575 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 2487 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2487 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 19:03:14,575 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2487 Valid, 31 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 19:03:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2025-04-13 19:03:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5509. [2025-04-13 19:03:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5507 states have (on average 2.488650808062466) internal successors, (13705), 5508 states have internal predecessors, (13705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 13705 transitions. [2025-04-13 19:03:15,595 INFO L79 Accepts]: Start accepts. Automaton has 5509 states and 13705 transitions. Word has length 104 [2025-04-13 19:03:15,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:03:15,596 INFO L485 AbstractCegarLoop]: Abstraction has 5509 states and 13705 transitions. [2025-04-13 19:03:15,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 203 states have (on average 1.064039408866995) internal successors, (216), 203 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:03:15,596 INFO L278 IsEmpty]: Start isEmpty. Operand 5509 states and 13705 transitions. [2025-04-13 19:03:15,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-04-13 19:03:15,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:03:15,602 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:03:15,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 19:03:15,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:03:15,802 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:03:15,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:03:15,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1110367566, now seen corresponding path program 7 times [2025-04-13 19:03:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:03:15,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862624514] [2025-04-13 19:03:15,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:03:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:03:15,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 19:03:15,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 19:03:15,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:03:15,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:03:15,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:03:15,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 19:03:15,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 19:03:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:03:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:03:15,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:03:15,891 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:03:15,892 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:03:15,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 19:03:15,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:03:15,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:03:15,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:03:15,893 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:03:15,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 19:03:15,897 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 3, 3, 1, 1, 1, 1] [2025-04-13 19:03:16,003 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:03:16,003 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:03:16,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:03:16 BasicIcfg [2025-04-13 19:03:16,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:03:16,005 INFO L158 Benchmark]: Toolchain (without parser) took 84485.22ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.1MB in the beginning and 1.0GB in the end (delta: -901.6MB). Peak memory consumption was 328.9MB. Max. memory is 8.0GB. [2025-04-13 19:03:16,005 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:03:16,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 75.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:03:16,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.42ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:03:16,005 INFO L158 Benchmark]: Boogie Preprocessor took 29.97ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 72.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:03:16,006 INFO L158 Benchmark]: RCFGBuilder took 276.42ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 50.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:03:16,006 INFO L158 Benchmark]: TraceAbstraction took 83781.91ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 49.3MB in the beginning and 1.0GB in the end (delta: -951.4MB). Peak memory consumption was 278.5MB. Max. memory is 8.0GB. [2025-04-13 19:03:16,006 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 75.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.42ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.97ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 72.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 276.42ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 50.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 83781.91ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 49.3MB in the beginning and 1.0GB in the end (delta: -951.4MB). Peak memory consumption was 278.5MB. 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 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=-1] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=101] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=100, expression=0, limit=100] - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 83.6s, OverallIterations: 23, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14114 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14114 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8598 IncrementalHoareTripleChecker+Invalid, 8676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 76 mSDtfsCounter, 8598 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 216 SyntacticMatches, 179 SemanticMatches, 1740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136307 ImplicationChecksByTransitivity, 43.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5509occurred in iteration=22, InterpolantAutomatonStates: 729, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 3470 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 357 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 7790 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2430 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 56 InterpolantComputations, 6 PerfectInterpolantSequences, 200/35476 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:03:16,017 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...