/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/rfi003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:46:43,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:46:43,886 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:46:43,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:46:43,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:46:43,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:46:43,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:46:43,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:46:43,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:46:43,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:46:43,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:46:43,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:46:43,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:46:43,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:46:43,917 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:46:43,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:46:43,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:46:43,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:46:43,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:46:43,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:46:43,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:46:43,919 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:46:44,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:46:44,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:46:44,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:46:44,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:46:44,153 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:46:44,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2025-04-13 21:46:45,399 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202bf541f/25a3f0ff26464d11b103ac1e8c28eac5/FLAGa5fa8921f [2025-04-13 21:46:45,664 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:46:45,664 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2025-04-13 21:46:45,682 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202bf541f/25a3f0ff26464d11b103ac1e8c28eac5/FLAGa5fa8921f [2025-04-13 21:46:46,449 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202bf541f/25a3f0ff26464d11b103ac1e8c28eac5 [2025-04-13 21:46:46,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:46:46,452 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:46:46,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:46:46,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:46:46,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:46:46,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d4758a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46, skipping insertion in model container [2025-04-13 21:46:46,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:46:46,628 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/rfi003_tso.i[944,957] [2025-04-13 21:46:46,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:46:46,783 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:46:46,801 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/rfi003_tso.i[944,957] [2025-04-13 21:46:46,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:46:46,881 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:46:46,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46 WrapperNode [2025-04-13 21:46:46,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:46:46,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:46:46,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:46:46,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:46:46,888 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:46:46" (1/1) ... [2025-04-13 21:46:46,900 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:46:46" (1/1) ... [2025-04-13 21:46:46,928 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2025-04-13 21:46:46,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:46:46,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:46:46,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:46:46,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:46:46,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,956 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:46:46,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:46:46,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:46:46,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:46:46,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:46:46,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (1/1) ... [2025-04-13 21:46:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:46:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:46:47,004 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:46:47,007 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:46:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:46:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:46:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:46:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:46:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:46:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:46:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:46:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:46:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:46:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:46:47,027 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:46:47,127 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:46:47,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:46:47,392 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:46:47,393 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:46:47,393 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:46:47,679 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:46:47,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:46:47 BoogieIcfgContainer [2025-04-13 21:46:47,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:46:47,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:46:47,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:46:47,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:46:47,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:46:46" (1/3) ... [2025-04-13 21:46:47,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d3157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:46:47, skipping insertion in model container [2025-04-13 21:46:47,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:46:46" (2/3) ... [2025-04-13 21:46:47,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d3157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:46:47, skipping insertion in model container [2025-04-13 21:46:47,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:46:47" (3/3) ... [2025-04-13 21:46:47,688 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2025-04-13 21:46:47,699 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:46:47,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_tso.i that has 3 procedures, 30 locations, 27 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 21:46:47,700 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:46:47,744 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:46:47,767 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 66 flow [2025-04-13 21:46:47,829 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 610 states, 607 states have (on average 2.6194398682042834) internal successors, (1590), 609 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have 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:46:47,853 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:46:47,864 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;@7706597e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:46:47,864 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:46:47,867 INFO L278 IsEmpty]: Start isEmpty. Operand has 610 states, 607 states have (on average 2.6194398682042834) internal successors, (1590), 609 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have 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:46:47,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:46:47,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:47,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:46:47,872 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:47,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 441877862, now seen corresponding path program 1 times [2025-04-13 21:46:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:47,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837543338] [2025-04-13 21:46:47,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:46:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:47,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:46:47,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:46:47,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:46:47,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:48,286 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:46:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:48,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837543338] [2025-04-13 21:46:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837543338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:48,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:48,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:46:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717818502] [2025-04-13 21:46:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:48,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:46:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:46:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:46:48,309 INFO L87 Difference]: Start difference. First operand has 610 states, 607 states have (on average 2.6194398682042834) internal successors, (1590), 609 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:46:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:48,441 INFO L93 Difference]: Finished difference Result 610 states and 1590 transitions. [2025-04-13 21:46:48,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:46:48,446 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 21:46:48,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:48,461 INFO L225 Difference]: With dead ends: 610 [2025-04-13 21:46:48,461 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 21:46:48,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:46:48,467 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:48,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:46:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 21:46:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-04-13 21:46:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 2.5969289827255277) internal successors, (1353), 521 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have 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:46:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1353 transitions. [2025-04-13 21:46:48,524 INFO L79 Accepts]: Start accepts. Automaton has 522 states and 1353 transitions. Word has length 7 [2025-04-13 21:46:48,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:48,524 INFO L485 AbstractCegarLoop]: Abstraction has 522 states and 1353 transitions. [2025-04-13 21:46:48,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:46:48,524 INFO L278 IsEmpty]: Start isEmpty. Operand 522 states and 1353 transitions. [2025-04-13 21:46:48,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:46:48,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:48,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:46:48,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:46:48,525 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:48,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash -559180032, now seen corresponding path program 1 times [2025-04-13 21:46:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:48,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554989542] [2025-04-13 21:46:48,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:46:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:48,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:46:48,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:46:48,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:46:48,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:48,848 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:46:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:48,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554989542] [2025-04-13 21:46:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554989542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:48,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:48,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:46:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277218745] [2025-04-13 21:46:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:48,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:46:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:48,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:46:48,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:46:48,852 INFO L87 Difference]: Start difference. First operand 522 states and 1353 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 21:46:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:48,976 INFO L93 Difference]: Finished difference Result 672 states and 1688 transitions. [2025-04-13 21:46:48,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:46:48,977 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 21:46:48,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:48,979 INFO L225 Difference]: With dead ends: 672 [2025-04-13 21:46:48,979 INFO L226 Difference]: Without dead ends: 312 [2025-04-13 21:46:48,980 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:46:48,980 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:48,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:46:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-13 21:46:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-04-13 21:46:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.32475884244373) internal successors, (723), 311 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have 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:46:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 723 transitions. [2025-04-13 21:46:48,992 INFO L79 Accepts]: Start accepts. Automaton has 312 states and 723 transitions. Word has length 10 [2025-04-13 21:46:48,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:48,992 INFO L485 AbstractCegarLoop]: Abstraction has 312 states and 723 transitions. [2025-04-13 21:46:48,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 21:46:48,992 INFO L278 IsEmpty]: Start isEmpty. Operand 312 states and 723 transitions. [2025-04-13 21:46:48,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:46:48,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:48,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:46:48,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:46:48,993 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:48,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1110219197, now seen corresponding path program 1 times [2025-04-13 21:46:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:48,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551370780] [2025-04-13 21:46:48,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:46:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:49,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:46:49,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:46:49,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:46:49,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:49,275 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:46:49,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:49,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551370780] [2025-04-13 21:46:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551370780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:49,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:46:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314835701] [2025-04-13 21:46:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:49,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:46:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:49,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:46:49,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:46:49,277 INFO L87 Difference]: Start difference. First operand 312 states and 723 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:46:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:49,365 INFO L93 Difference]: Finished difference Result 332 states and 759 transitions. [2025-04-13 21:46:49,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:46:49,365 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 21:46:49,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:49,367 INFO L225 Difference]: With dead ends: 332 [2025-04-13 21:46:49,367 INFO L226 Difference]: Without dead ends: 182 [2025-04-13 21:46:49,367 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:46:49,368 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:49,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 4 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:46:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-13 21:46:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-04-13 21:46:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.1988950276243093) internal successors, (398), 181 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have 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:46:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 398 transitions. [2025-04-13 21:46:49,373 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 398 transitions. Word has length 16 [2025-04-13 21:46:49,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:49,373 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 398 transitions. [2025-04-13 21:46:49,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:46:49,373 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 398 transitions. [2025-04-13 21:46:49,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:46:49,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:49,374 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:46:49,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:46:49,375 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:49,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1903493048, now seen corresponding path program 1 times [2025-04-13 21:46:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:49,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660320027] [2025-04-13 21:46:49,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:46:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:49,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:46:49,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:46:49,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:46:49,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:52,393 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:46:52,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:52,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660320027] [2025-04-13 21:46:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660320027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:52,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:46:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095759757] [2025-04-13 21:46:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:52,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:46:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:52,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:46:52,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:46:52,394 INFO L87 Difference]: Start difference. First operand 182 states and 398 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:52,956 INFO L93 Difference]: Finished difference Result 270 states and 584 transitions. [2025-04-13 21:46:52,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:46:52,957 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:52,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:52,959 INFO L225 Difference]: With dead ends: 270 [2025-04-13 21:46:52,959 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 21:46:52,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:46:52,960 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 112 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:52,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 20 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:46:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 21:46:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2025-04-13 21:46:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.119205298013245) internal successors, (320), 151 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have 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:46:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 320 transitions. [2025-04-13 21:46:52,968 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 320 transitions. Word has length 23 [2025-04-13 21:46:52,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:52,968 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 320 transitions. [2025-04-13 21:46:52,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:52,968 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 320 transitions. [2025-04-13 21:46:52,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:46:52,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:52,970 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:46:52,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:46:52,970 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:52,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 620069882, now seen corresponding path program 2 times [2025-04-13 21:46:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:52,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039469253] [2025-04-13 21:46:52,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:46:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:52,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:46:53,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:46:53,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:46:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:54,993 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:46:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:54,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039469253] [2025-04-13 21:46:54,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039469253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:54,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:46:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870251807] [2025-04-13 21:46:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:54,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:46:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:54,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:46:54,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:46:54,994 INFO L87 Difference]: Start difference. First operand 152 states and 320 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:55,361 INFO L93 Difference]: Finished difference Result 230 states and 477 transitions. [2025-04-13 21:46:55,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:46:55,361 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:55,361 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:55,362 INFO L225 Difference]: With dead ends: 230 [2025-04-13 21:46:55,362 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 21:46:55,362 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:46:55,363 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:55,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 19 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:46:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 21:46:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-13 21:46:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.0708661417322833) internal successors, (263), 127 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have 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:46:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 263 transitions. [2025-04-13 21:46:55,366 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 263 transitions. Word has length 23 [2025-04-13 21:46:55,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:55,366 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 263 transitions. [2025-04-13 21:46:55,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:46:55,366 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 263 transitions. [2025-04-13 21:46:55,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:46:55,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:46:55,367 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:46:55,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:46:55,367 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:46:55,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:46:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1945906668, now seen corresponding path program 3 times [2025-04-13 21:46:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:46:55,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455785733] [2025-04-13 21:46:55,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:46:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:46:55,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:46:55,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:46:55,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:46:55,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:46:55,544 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:46:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:46:55,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455785733] [2025-04-13 21:46:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455785733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:46:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:46:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:46:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605695823] [2025-04-13 21:46:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:46:55,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:46:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:46:55,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:46:55,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:46:55,546 INFO L87 Difference]: Start difference. First operand 128 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.75) 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:46:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:46:55,621 INFO L93 Difference]: Finished difference Result 128 states and 263 transitions. [2025-04-13 21:46:55,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:46:55,622 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) 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:46:55,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:46:55,623 INFO L225 Difference]: With dead ends: 128 [2025-04-13 21:46:55,623 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:46:55,623 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:46:55,624 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:46:55,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:46:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:46:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:46:55,624 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:46:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:46:55,624 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2025-04-13 21:46:55,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:46:55,624 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:46:55,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) 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:46:55,625 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:46:55,625 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:46:55,627 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 21:46:55,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 21:46:55,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 21:46:55,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 21:46:55,628 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 21:46:55,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:46:55,630 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 21:46:55,633 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:46:55,633 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:46:55,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:46:55 BasicIcfg [2025-04-13 21:46:55,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:46:55,637 INFO L158 Benchmark]: Toolchain (without parser) took 9185.03ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 109.1MB in the beginning and 334.5MB in the end (delta: -225.3MB). Peak memory consumption was 167.6MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,637 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:46:55,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.87ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 80.2MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 76.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,638 INFO L158 Benchmark]: Boogie Preprocessor took 41.05ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 72.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,638 INFO L158 Benchmark]: IcfgBuilder took 708.54ms. Allocated memory is still 155.2MB. Free memory was 72.4MB in the beginning and 58.0MB in the end (delta: 14.5MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,638 INFO L158 Benchmark]: TraceAbstraction took 7956.06ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 57.2MB in the beginning and 334.5MB in the end (delta: -277.3MB). Peak memory consumption was 113.5MB. Max. memory is 8.0GB. [2025-04-13 21:46:55,641 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.22ms. Allocated memory is still 163.6MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.87ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 80.2MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 76.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.05ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 72.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 708.54ms. Allocated memory is still 155.2MB. Free memory was 72.4MB in the beginning and 58.0MB in the end (delta: 14.5MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7956.06ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 57.2MB in the beginning and 334.5MB in the end (delta: -277.3MB). Peak memory consumption was 113.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 - 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 5 procedures, 50 locations, 47 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 798 IncrementalHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 16 mSDtfsCounter, 798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:46:55,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...