/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:50:37,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:37,772 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 21:50:37,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:37,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:37,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:37,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:37,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:37,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:37,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:37,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:37,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:37,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:37,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:37,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:37,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:37,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:37,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:37,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:37,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:37,803 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:50:38,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:38,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:38,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:38,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:38,048 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:38,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-13 21:50:39,350 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc300cd69/92ed302769e040028f69cd97379452ef/FLAG5751c6672 [2025-04-13 21:50:39,592 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:50:39,592 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i [2025-04-13 21:50:39,602 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc300cd69/92ed302769e040028f69cd97379452ef/FLAG5751c6672 [2025-04-13 21:50:40,351 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc300cd69/92ed302769e040028f69cd97379452ef [2025-04-13 21:50:40,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:50:40,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:50:40,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:40,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:50:40,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:50:40,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2cf15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40, skipping insertion in model container [2025-04-13 21:50:40,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:50:40,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-13 21:50:40,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:40,629 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:50:40,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_tso.i[945,958] [2025-04-13 21:50:40,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:40,715 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:50:40,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40 WrapperNode [2025-04-13 21:50:40,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:40,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:40,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:50:40,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:50:40,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,759 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 21:50:40,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:40,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:50:40,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:50:40,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:50:40,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,781 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 21:50:40,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:50:40,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:50:40,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:50:40,791 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:50:40,792 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (1/1) ... [2025-04-13 21:50:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:50:40,816 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 21:50:40,818 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 21:50:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:50:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:50:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:50:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:50:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:50:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:50:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:50:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:50:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:50:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:50:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:50:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:50:40,839 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:50:40,951 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:50:40,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:50:41,103 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:50:41,104 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:50:41,104 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:50:41,186 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:50:41,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:41 BoogieIcfgContainer [2025-04-13 21:50:41,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:50:41,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:50:41,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:50:41,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:50:41,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:50:40" (1/3) ... [2025-04-13 21:50:41,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad9ef5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:41, skipping insertion in model container [2025-04-13 21:50:41,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:40" (2/3) ... [2025-04-13 21:50:41,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad9ef5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:41, skipping insertion in model container [2025-04-13 21:50:41,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:41" (3/3) ... [2025-04-13 21:50:41,195 INFO L128 eAbstractionObserver]: Analyzing ICFG safe034_tso.i [2025-04-13 21:50:41,205 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:50:41,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe034_tso.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:50:41,207 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:50:41,241 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:50:41,266 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 36 transitions, 84 flow [2025-04-13 21:50:41,413 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3282 states, 3281 states have (on average 3.428223102712588) internal successors, (11248), 3281 states have internal predecessors, (11248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:41,434 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:50:41,441 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;@66875448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:50:41,442 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:50:41,451 INFO L278 IsEmpty]: Start isEmpty. Operand has 3282 states, 3281 states have (on average 3.428223102712588) internal successors, (11248), 3281 states have internal predecessors, (11248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:41,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:50:41,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:41,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:41,464 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:41,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash 646113119, now seen corresponding path program 1 times [2025-04-13 21:50:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:41,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595542739] [2025-04-13 21:50:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:41,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:50:41,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:50:41,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:41,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:41,800 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 21:50:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:41,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595542739] [2025-04-13 21:50:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595542739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:41,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077323668] [2025-04-13 21:50:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:41,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:50:41,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:41,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:50:41,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:50:41,829 INFO L87 Difference]: Start difference. First operand has 3282 states, 3281 states have (on average 3.428223102712588) internal successors, (11248), 3281 states have internal predecessors, (11248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:42,034 INFO L93 Difference]: Finished difference Result 4622 states and 15460 transitions. [2025-04-13 21:50:42,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:50:42,036 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:50:42,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:42,072 INFO L225 Difference]: With dead ends: 4622 [2025-04-13 21:50:42,072 INFO L226 Difference]: Without dead ends: 2382 [2025-04-13 21:50:42,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:42,092 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:42,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 9 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-04-13 21:50:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2025-04-13 21:50:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 3.212095758084838) internal successors, (7648), 2381 states have internal predecessors, (7648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 7648 transitions. [2025-04-13 21:50:42,238 INFO L79 Accepts]: Start accepts. Automaton has 2382 states and 7648 transitions. Word has length 12 [2025-04-13 21:50:42,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:42,239 INFO L485 AbstractCegarLoop]: Abstraction has 2382 states and 7648 transitions. [2025-04-13 21:50:42,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,239 INFO L278 IsEmpty]: Start isEmpty. Operand 2382 states and 7648 transitions. [2025-04-13 21:50:42,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:50:42,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:42,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:42,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:50:42,244 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:42,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1078116563, now seen corresponding path program 1 times [2025-04-13 21:50:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:42,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537953319] [2025-04-13 21:50:42,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:42,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:50:42,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:50:42,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:42,398 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 21:50:42,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:42,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537953319] [2025-04-13 21:50:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537953319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:42,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:42,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100387150] [2025-04-13 21:50:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:42,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:42,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:42,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:42,400 INFO L87 Difference]: Start difference. First operand 2382 states and 7648 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:42,554 INFO L93 Difference]: Finished difference Result 2762 states and 8692 transitions. [2025-04-13 21:50:42,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:42,555 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 21:50:42,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:42,567 INFO L225 Difference]: With dead ends: 2762 [2025-04-13 21:50:42,567 INFO L226 Difference]: Without dead ends: 1422 [2025-04-13 21:50:42,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:42,572 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 104 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:42,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 12 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-04-13 21:50:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-04-13 21:50:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 3.0175932441942295) internal successors, (4288), 1421 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 4288 transitions. [2025-04-13 21:50:42,621 INFO L79 Accepts]: Start accepts. Automaton has 1422 states and 4288 transitions. Word has length 17 [2025-04-13 21:50:42,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:42,621 INFO L485 AbstractCegarLoop]: Abstraction has 1422 states and 4288 transitions. [2025-04-13 21:50:42,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,622 INFO L278 IsEmpty]: Start isEmpty. Operand 1422 states and 4288 transitions. [2025-04-13 21:50:42,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:50:42,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:42,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:42,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:50:42,628 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:42,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2068764628, now seen corresponding path program 1 times [2025-04-13 21:50:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:42,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814208462] [2025-04-13 21:50:42,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:42,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:50:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:50:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:42,790 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 21:50:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:42,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814208462] [2025-04-13 21:50:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814208462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:42,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:42,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:50:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935729016] [2025-04-13 21:50:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:42,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:50:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:42,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:50:42,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:50:42,791 INFO L87 Difference]: Start difference. First operand 1422 states and 4288 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:42,919 INFO L93 Difference]: Finished difference Result 1462 states and 4380 transitions. [2025-04-13 21:50:42,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:50:42,920 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-04-13 21:50:42,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:42,928 INFO L225 Difference]: With dead ends: 1462 [2025-04-13 21:50:42,928 INFO L226 Difference]: Without dead ends: 1082 [2025-04-13 21:50:42,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:50:42,930 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 149 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:42,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 9 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-04-13 21:50:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2025-04-13 21:50:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 3.023126734505088) internal successors, (3268), 1081 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 3268 transitions. [2025-04-13 21:50:42,965 INFO L79 Accepts]: Start accepts. Automaton has 1082 states and 3268 transitions. Word has length 23 [2025-04-13 21:50:42,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:42,966 INFO L485 AbstractCegarLoop]: Abstraction has 1082 states and 3268 transitions. [2025-04-13 21:50:42,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:42,966 INFO L278 IsEmpty]: Start isEmpty. Operand 1082 states and 3268 transitions. [2025-04-13 21:50:42,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:50:42,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:42,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:42,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:50:42,969 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:42,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1572560109, now seen corresponding path program 1 times [2025-04-13 21:50:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:42,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514708061] [2025-04-13 21:50:42,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:50:42,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:50:42,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:42,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:43,114 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 21:50:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:43,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514708061] [2025-04-13 21:50:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514708061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178938470] [2025-04-13 21:50:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:43,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:50:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:43,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:50:43,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:50:43,115 INFO L87 Difference]: Start difference. First operand 1082 states and 3268 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:43,224 INFO L93 Difference]: Finished difference Result 1570 states and 4696 transitions. [2025-04-13 21:50:43,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:50:43,225 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:50:43,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:43,233 INFO L225 Difference]: With dead ends: 1570 [2025-04-13 21:50:43,234 INFO L226 Difference]: Without dead ends: 1274 [2025-04-13 21:50:43,234 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:43,237 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:43,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-04-13 21:50:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 954. [2025-04-13 21:50:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 2.9758656873032527) internal successors, (2836), 953 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2836 transitions. [2025-04-13 21:50:43,272 INFO L79 Accepts]: Start accepts. Automaton has 954 states and 2836 transitions. Word has length 29 [2025-04-13 21:50:43,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:43,273 INFO L485 AbstractCegarLoop]: Abstraction has 954 states and 2836 transitions. [2025-04-13 21:50:43,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,274 INFO L278 IsEmpty]: Start isEmpty. Operand 954 states and 2836 transitions. [2025-04-13 21:50:43,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:50:43,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:43,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:43,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:50:43,278 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:43,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2081640561, now seen corresponding path program 2 times [2025-04-13 21:50:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:43,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327828615] [2025-04-13 21:50:43,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:50:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:43,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:50:43,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:50:43,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:50:43,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:43,416 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 21:50:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:43,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327828615] [2025-04-13 21:50:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327828615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928263620] [2025-04-13 21:50:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:43,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:43,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:43,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:43,418 INFO L87 Difference]: Start difference. First operand 954 states and 2836 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:43,542 INFO L93 Difference]: Finished difference Result 1250 states and 3648 transitions. [2025-04-13 21:50:43,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:43,542 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:50:43,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:43,551 INFO L225 Difference]: With dead ends: 1250 [2025-04-13 21:50:43,551 INFO L226 Difference]: Without dead ends: 570 [2025-04-13 21:50:43,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:43,555 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:43,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-04-13 21:50:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2025-04-13 21:50:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 2.804920913884007) internal successors, (1596), 569 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1596 transitions. [2025-04-13 21:50:43,572 INFO L79 Accepts]: Start accepts. Automaton has 570 states and 1596 transitions. Word has length 29 [2025-04-13 21:50:43,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:43,572 INFO L485 AbstractCegarLoop]: Abstraction has 570 states and 1596 transitions. [2025-04-13 21:50:43,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,573 INFO L278 IsEmpty]: Start isEmpty. Operand 570 states and 1596 transitions. [2025-04-13 21:50:43,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:50:43,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:43,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:43,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:50:43,575 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:50:43,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -967172877, now seen corresponding path program 3 times [2025-04-13 21:50:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:43,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775088927] [2025-04-13 21:50:43,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:50:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:43,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:50:43,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:50:43,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:50:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:43,717 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 21:50:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:43,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775088927] [2025-04-13 21:50:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775088927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:43,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:43,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772884393] [2025-04-13 21:50:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:43,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:43,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:43,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:43,718 INFO L87 Difference]: Start difference. First operand 570 states and 1596 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:43,830 INFO L93 Difference]: Finished difference Result 730 states and 2068 transitions. [2025-04-13 21:50:43,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:50:43,831 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 21:50:43,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:43,833 INFO L225 Difference]: With dead ends: 730 [2025-04-13 21:50:43,833 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:50:43,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:50:43,836 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:43,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 16 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:50:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:50:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:50:43,839 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-04-13 21:50:43,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:43,840 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:50:43,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:43,841 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:50:43,841 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:50:43,843 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 21:50:43,843 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:50:43,843 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 21:50:43,843 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 21:50:43,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:50:43,845 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 21:50:43,847 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:50:43,848 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:50:43,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:50:43 BasicIcfg [2025-04-13 21:50:43,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:50:43,850 INFO L158 Benchmark]: Toolchain (without parser) took 3496.37ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 101.2MB in the beginning and 199.1MB in the end (delta: -97.9MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.41ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 78.3MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 76.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: Boogie Preprocessor took 30.70ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: IcfgBuilder took 395.71ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 51.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:43,851 INFO L158 Benchmark]: TraceAbstraction took 2662.00ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 50.6MB in the beginning and 199.1MB in the end (delta: -148.5MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-13 21:50:43,852 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.20ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.41ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 78.3MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 76.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.70ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 395.71ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 51.2MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2662.00ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 50.6MB in the beginning and 199.1MB in the end (delta: -148.5MB). Peak memory consumption was 61.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 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 685 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 23 mSDtfsCounter, 685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3282occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 320 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:50:43,866 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...