/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:22:22,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:22:22,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 17:22:22,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:22:22,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:22:22,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:22:22,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:22:22,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:22:22,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:22:22,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:22:22,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:22:22,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:22:22,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:22:22,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:22:22,915 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:22:22,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:22:22,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:22:22,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:22,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:22,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:22:22,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:22:22,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:22:22,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:22:22,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 [2025-04-13 17:22:23,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:22:23,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:22:23,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:22:23,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:22:23,160 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:22:23,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2025-04-13 17:22:24,438 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ceb2c70/ce9218a031e64f7a986494d6bf49f26a/FLAG750fe3ec0 [2025-04-13 17:22:24,664 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:22:24,664 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2025-04-13 17:22:24,672 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ceb2c70/ce9218a031e64f7a986494d6bf49f26a/FLAG750fe3ec0 [2025-04-13 17:22:25,438 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ceb2c70/ce9218a031e64f7a986494d6bf49f26a [2025-04-13 17:22:25,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:22:25,442 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:22:25,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:22:25,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:22:25,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:22:25,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2beadcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25, skipping insertion in model container [2025-04-13 17:22:25,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:22:25,639 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/safe005_tso.i[945,958] [2025-04-13 17:22:25,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:22:25,766 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:22:25,792 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/safe005_tso.i[945,958] [2025-04-13 17:22:25,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:22:25,851 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:22:25,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25 WrapperNode [2025-04-13 17:22:25,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:22:25,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:22:25,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:22:25,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:22:25,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,879 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 17:22:25,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:22:25,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:22:25,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:22:25,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:22:25,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 17:22:25,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:22:25,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:22:25,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:22:25,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:22:25,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (1/1) ... [2025-04-13 17:22:25,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:22:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:22:25,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:22:25,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 17:22:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 17:22:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 17:22:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:22:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:22:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:22:25,953 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:22:26,025 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:22:26,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:22:26,121 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:22:26,122 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:22:26,122 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:22:26,203 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:22:26,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:22:26 BoogieIcfgContainer [2025-04-13 17:22:26,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:22:26,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:22:26,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:22:26,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:22:26,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:22:25" (1/3) ... [2025-04-13 17:22:26,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1b0fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:22:26, skipping insertion in model container [2025-04-13 17:22:26,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:22:25" (2/3) ... [2025-04-13 17:22:26,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1b0fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:22:26, skipping insertion in model container [2025-04-13 17:22:26,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:22:26" (3/3) ... [2025-04-13 17:22:26,211 INFO L128 eAbstractionObserver]: Analyzing ICFG safe005_tso.i [2025-04-13 17:22:26,222 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:22:26,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_tso.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 17:22:26,224 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:22:26,263 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:22:26,286 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 17:22:26,463 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2874 states, 2873 states have (on average 3.409328228332753) internal successors, (9795), 2873 states have internal predecessors, (9795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:26,485 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:22:26,495 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;@1868cd89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:22:26,495 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:22:26,505 INFO L278 IsEmpty]: Start isEmpty. Operand has 2874 states, 2873 states have (on average 3.409328228332753) internal successors, (9795), 2873 states have internal predecessors, (9795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:26,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:22:26,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:26,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:26,514 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:26,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1021190667, now seen corresponding path program 1 times [2025-04-13 17:22:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:26,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24463653] [2025-04-13 17:22:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:26,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:22:26,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:22:26,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:26,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:26,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24463653] [2025-04-13 17:22:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24463653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:26,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:26,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:22:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707317516] [2025-04-13 17:22:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:26,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:22:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:26,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:22:26,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:22:26,881 INFO L87 Difference]: Start difference. First operand has 2874 states, 2873 states have (on average 3.409328228332753) internal successors, (9795), 2873 states have internal predecessors, (9795), 0 states have call successors, (0), 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 17:22:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:27,009 INFO L93 Difference]: Finished difference Result 4084 states and 13588 transitions. [2025-04-13 17:22:27,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:22:27,011 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 17:22:27,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:27,040 INFO L225 Difference]: With dead ends: 4084 [2025-04-13 17:22:27,041 INFO L226 Difference]: Without dead ends: 2124 [2025-04-13 17:22:27,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:27,077 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:27,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 48 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-04-13 17:22:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2124. [2025-04-13 17:22:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 3.2006594441827603) internal successors, (6795), 2123 states have internal predecessors, (6795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 6795 transitions. [2025-04-13 17:22:27,208 INFO L79 Accepts]: Start accepts. Automaton has 2124 states and 6795 transitions. Word has length 12 [2025-04-13 17:22:27,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:27,209 INFO L485 AbstractCegarLoop]: Abstraction has 2124 states and 6795 transitions. [2025-04-13 17:22:27,209 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 17:22:27,209 INFO L278 IsEmpty]: Start isEmpty. Operand 2124 states and 6795 transitions. [2025-04-13 17:22:27,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:22:27,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:27,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:27,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:22:27,214 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:27,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 858011816, now seen corresponding path program 1 times [2025-04-13 17:22:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:27,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704270299] [2025-04-13 17:22:27,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:27,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:22:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:22:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:27,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:27,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704270299] [2025-04-13 17:22:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704270299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:27,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:27,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:22:27,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104435342] [2025-04-13 17:22:27,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:27,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:27,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:27,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:27,349 INFO L87 Difference]: Start difference. First operand 2124 states and 6795 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 17:22:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:27,452 INFO L93 Difference]: Finished difference Result 2484 states and 7783 transitions. [2025-04-13 17:22:27,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:27,452 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 17:22:27,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:27,462 INFO L225 Difference]: With dead ends: 2484 [2025-04-13 17:22:27,462 INFO L226 Difference]: Without dead ends: 1274 [2025-04-13 17:22:27,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:22:27,466 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:27,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-04-13 17:22:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2025-04-13 17:22:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 3.000785545954438) internal successors, (3820), 1273 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3820 transitions. [2025-04-13 17:22:27,516 INFO L79 Accepts]: Start accepts. Automaton has 1274 states and 3820 transitions. Word has length 17 [2025-04-13 17:22:27,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:27,517 INFO L485 AbstractCegarLoop]: Abstraction has 1274 states and 3820 transitions. [2025-04-13 17:22:27,517 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 17:22:27,517 INFO L278 IsEmpty]: Start isEmpty. Operand 1274 states and 3820 transitions. [2025-04-13 17:22:27,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:22:27,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:27,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:22:27,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:22:27,520 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:27,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1482509819, now seen corresponding path program 1 times [2025-04-13 17:22:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:27,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533376504] [2025-04-13 17:22:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:27,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:22:27,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:22:27,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:27,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:27,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533376504] [2025-04-13 17:22:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533376504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:27,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:22:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297624423] [2025-04-13 17:22:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:27,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:22:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:22:27,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:22:27,674 INFO L87 Difference]: Start difference. First operand 1274 states and 3820 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:27,757 INFO L93 Difference]: Finished difference Result 1314 states and 3912 transitions. [2025-04-13 17:22:27,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:22:27,757 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:22:27,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:27,764 INFO L225 Difference]: With dead ends: 1314 [2025-04-13 17:22:27,764 INFO L226 Difference]: Without dead ends: 954 [2025-04-13 17:22:27,765 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:22:27,767 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:27,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 47 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-04-13 17:22:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-04-13 17:22:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 3.0010493179433366) internal successors, (2860), 953 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2860 transitions. [2025-04-13 17:22:27,788 INFO L79 Accepts]: Start accepts. Automaton has 954 states and 2860 transitions. Word has length 22 [2025-04-13 17:22:27,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:27,788 INFO L485 AbstractCegarLoop]: Abstraction has 954 states and 2860 transitions. [2025-04-13 17:22:27,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:27,789 INFO L278 IsEmpty]: Start isEmpty. Operand 954 states and 2860 transitions. [2025-04-13 17:22:27,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:22:27,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:27,791 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] [2025-04-13 17:22:27,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:22:27,791 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:27,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1661462496, now seen corresponding path program 1 times [2025-04-13 17:22:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:27,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414866597] [2025-04-13 17:22:27,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:22:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:27,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:22:27,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:22:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:22:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:27,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414866597] [2025-04-13 17:22:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414866597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:27,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:22:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872501319] [2025-04-13 17:22:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:27,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:22:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:27,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:22:27,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:22:27,946 INFO L87 Difference]: Start difference. First operand 954 states and 2860 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:28,118 INFO L93 Difference]: Finished difference Result 2766 states and 8092 transitions. [2025-04-13 17:22:28,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:22:28,119 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:22:28,119 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:28,126 INFO L225 Difference]: With dead ends: 2766 [2025-04-13 17:22:28,126 INFO L226 Difference]: Without dead ends: 986 [2025-04-13 17:22:28,129 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:22:28,131 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:28,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 169 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-04-13 17:22:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 626. [2025-04-13 17:22:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 2.8352) internal successors, (1772), 625 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1772 transitions. [2025-04-13 17:22:28,151 INFO L79 Accepts]: Start accepts. Automaton has 626 states and 1772 transitions. Word has length 28 [2025-04-13 17:22:28,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:28,152 INFO L485 AbstractCegarLoop]: Abstraction has 626 states and 1772 transitions. [2025-04-13 17:22:28,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,152 INFO L278 IsEmpty]: Start isEmpty. Operand 626 states and 1772 transitions. [2025-04-13 17:22:28,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:22:28,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:28,154 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] [2025-04-13 17:22:28,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:22:28,154 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:28,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1608513096, now seen corresponding path program 2 times [2025-04-13 17:22:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:28,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333220466] [2025-04-13 17:22:28,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:22:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:28,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:22:28,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:22:28,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:22:28,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:28,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333220466] [2025-04-13 17:22:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333220466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:28,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:28,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:22:28,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206832939] [2025-04-13 17:22:28,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:28,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:28,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:28,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:28,328 INFO L87 Difference]: Start difference. First operand 626 states and 1772 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:28,396 INFO L93 Difference]: Finished difference Result 986 states and 2784 transitions. [2025-04-13 17:22:28,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:22:28,397 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:22:28,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:28,403 INFO L225 Difference]: With dead ends: 986 [2025-04-13 17:22:28,403 INFO L226 Difference]: Without dead ends: 542 [2025-04-13 17:22:28,404 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:22:28,405 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:28,405 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:22:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-04-13 17:22:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 478. [2025-04-13 17:22:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 2.79664570230608) internal successors, (1334), 477 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1334 transitions. [2025-04-13 17:22:28,421 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 1334 transitions. Word has length 28 [2025-04-13 17:22:28,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:28,421 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 1334 transitions. [2025-04-13 17:22:28,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,422 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 1334 transitions. [2025-04-13 17:22:28,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:22:28,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:22:28,423 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] [2025-04-13 17:22:28,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:22:28,423 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:22:28,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:22:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1553162798, now seen corresponding path program 3 times [2025-04-13 17:22:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:22:28,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111704190] [2025-04-13 17:22:28,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:22:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:22:28,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:22:28,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:22:28,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:22:28,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:22:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:22:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:22:28,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111704190] [2025-04-13 17:22:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111704190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:22:28,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:22:28,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:22:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104755670] [2025-04-13 17:22:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:22:28,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:22:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:22:28,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:22:28,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:22:28,584 INFO L87 Difference]: Start difference. First operand 478 states and 1334 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:22:28,654 INFO L93 Difference]: Finished difference Result 542 states and 1526 transitions. [2025-04-13 17:22:28,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:22:28,654 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:22:28,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:22:28,656 INFO L225 Difference]: With dead ends: 542 [2025-04-13 17:22:28,656 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:22:28,657 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 17:22:28,658 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:22:28,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:22:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:22:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:22:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:22:28,659 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-04-13 17:22:28,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:22:28,659 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:22:28,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:22:28,660 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:22:28,660 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:22:28,662 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 17:22:28,662 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 17:22:28,662 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 17:22:28,662 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 17:22:28,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:22:28,664 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 17:22:28,666 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:22:28,666 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:22:28,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:22:28 BasicIcfg [2025-04-13 17:22:28,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:22:28,669 INFO L158 Benchmark]: Toolchain (without parser) took 3226.69ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 99.7MB in the beginning and 219.0MB in the end (delta: -119.3MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. [2025-04-13 17:22:28,669 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:22:28,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.26ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.3MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:22:28,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.83ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:22:28,669 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:22:28,669 INFO L158 Benchmark]: RCFGBuilder took 291.94ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 50.6MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:22:28,670 INFO L158 Benchmark]: TraceAbstraction took 2462.40ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 49.5MB in the beginning and 219.0MB in the end (delta: -169.5MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2025-04-13 17:22:28,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.26ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.3MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.83ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 291.94ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 50.6MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2462.40ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 49.5MB in the beginning and 219.0MB in the end (delta: -169.5MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 61 locations, 57 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 458 mSDsluCounter, 440 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 132 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2874occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 424 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 591 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 17:22:28,683 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...