/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/weaver/parallel-misc-2-unrolled.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:32:52,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:32:52,359 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 22:32:52,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:32:52,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:32:52,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:32:52,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:32:52,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:32:52,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:32:52,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:32:52,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:32:52,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:32:52,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:32:52,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:32:52,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:32:52,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:32:52,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:32:52,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:32:52,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:32:52,391 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 22:32:52,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:32:52,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:32:52,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:32:52,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:32:52,617 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:32:52,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-04-13 22:32:53,965 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f515bb/c3a123df3c2a43abb7dae61bf342ce50/FLAGc1b00a94b [2025-04-13 22:32:54,132 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:32:54,132 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-04-13 22:32:54,149 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f515bb/c3a123df3c2a43abb7dae61bf342ce50/FLAGc1b00a94b [2025-04-13 22:32:56,067 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4f515bb/c3a123df3c2a43abb7dae61bf342ce50 [2025-04-13 22:32:56,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:32:56,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:32:56,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:32:56,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:32:56,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:32:56,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d05c80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56, skipping insertion in model container [2025-04-13 22:32:56,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:32:56,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c[2043,2056] [2025-04-13 22:32:56,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:32:56,253 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:32:56,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c[2043,2056] [2025-04-13 22:32:56,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:32:56,287 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:32:56,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56 WrapperNode [2025-04-13 22:32:56,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:32:56,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:32:56,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:32:56,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:32:56,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,316 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2025-04-13 22:32:56,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:32:56,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:32:56,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:32:56,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:32:56,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,335 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 22:32:56,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:32:56,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:32:56,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:32:56,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:32:56,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (1/1) ... [2025-04-13 22:32:56,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:32:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:56,368 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 22:32:56,370 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 22:32:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:32:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:32:56,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:32:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:32:56,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:32:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:32:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:32:56,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:32:56,385 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 22:32:56,447 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:32:56,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:32:56,594 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:32:56,594 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:32:56,594 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:32:56,704 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:32:56,708 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:32:56,714 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:32:56,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:32:56 BoogieIcfgContainer [2025-04-13 22:32:56,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:32:56,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:32:56,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:32:56,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:32:56,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:32:56" (1/3) ... [2025-04-13 22:32:56,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b474a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:32:56, skipping insertion in model container [2025-04-13 22:32:56,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:32:56" (2/3) ... [2025-04-13 22:32:56,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b474a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:32:56, skipping insertion in model container [2025-04-13 22:32:56,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:32:56" (3/3) ... [2025-04-13 22:32:56,722 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled.wvr.c [2025-04-13 22:32:56,732 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:32:56,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2-unrolled.wvr.c that has 3 procedures, 24 locations, 25 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 22:32:56,733 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:32:56,780 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:32:56,805 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 27 transitions, 68 flow [2025-04-13 22:32:56,820 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 96 states, 95 states have (on average 2.6210526315789475) internal successors, (249), 95 states have internal predecessors, (249), 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 22:32:56,836 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:32:56,843 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;@6cfdd314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:32:56,843 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:32:56,845 INFO L278 IsEmpty]: Start isEmpty. Operand has 96 states, 95 states have (on average 2.6210526315789475) internal successors, (249), 95 states have internal predecessors, (249), 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 22:32:56,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 22:32:56,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:56,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:56,850 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:56,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2088790578, now seen corresponding path program 1 times [2025-04-13 22:32:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:56,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174608313] [2025-04-13 22:32:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:56,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 22:32:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 22:32:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,050 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 22:32:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174608313] [2025-04-13 22:32:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174608313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:57,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:32:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585974476] [2025-04-13 22:32:57,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:57,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:32:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:57,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:32:57,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:32:57,072 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 2.6210526315789475) internal successors, (249), 95 states have internal predecessors, (249), 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 6.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 22:32:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:57,144 INFO L93 Difference]: Finished difference Result 121 states and 299 transitions. [2025-04-13 22:32:57,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:32:57,145 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.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 22:32:57,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:57,150 INFO L225 Difference]: With dead ends: 121 [2025-04-13 22:32:57,150 INFO L226 Difference]: Without dead ends: 116 [2025-04-13 22:32:57,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:32:57,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:57,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-13 22:32:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2025-04-13 22:32:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.5392156862745097) internal successors, (259), 102 states have internal predecessors, (259), 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 22:32:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 259 transitions. [2025-04-13 22:32:57,182 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 259 transitions. Word has length 12 [2025-04-13 22:32:57,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:57,182 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 259 transitions. [2025-04-13 22:32:57,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.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 22:32:57,183 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 259 transitions. [2025-04-13 22:32:57,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:32:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:57,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:57,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:32:57,184 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:57,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash 415363856, now seen corresponding path program 1 times [2025-04-13 22:32:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:57,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69473477] [2025-04-13 22:32:57,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:57,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:32:57,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:32:57,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:57,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,353 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 22:32:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69473477] [2025-04-13 22:32:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69473477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:32:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200877066] [2025-04-13 22:32:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:57,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:32:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:57,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:32:57,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:32:57,356 INFO L87 Difference]: Start difference. First operand 103 states and 259 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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 22:32:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:57,463 INFO L93 Difference]: Finished difference Result 167 states and 385 transitions. [2025-04-13 22:32:57,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:57,463 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:57,465 INFO L225 Difference]: With dead ends: 167 [2025-04-13 22:32:57,465 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 22:32:57,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:32:57,466 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:57,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 22:32:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 101. [2025-04-13 22:32:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.46) internal successors, (246), 100 states have internal predecessors, (246), 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 22:32:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 246 transitions. [2025-04-13 22:32:57,473 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 246 transitions. Word has length 16 [2025-04-13 22:32:57,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:57,473 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 246 transitions. [2025-04-13 22:32:57,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,474 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 246 transitions. [2025-04-13 22:32:57,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:32:57,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:57,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:57,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:32:57,474 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:57,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -414471732, now seen corresponding path program 1 times [2025-04-13 22:32:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:57,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581121528] [2025-04-13 22:32:57,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:57,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:32:57,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:32:57,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:57,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,567 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 22:32:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581121528] [2025-04-13 22:32:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581121528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:32:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329352244] [2025-04-13 22:32:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:57,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:32:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:57,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:32:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:32:57,570 INFO L87 Difference]: Start difference. First operand 101 states and 246 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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 22:32:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:57,683 INFO L93 Difference]: Finished difference Result 146 states and 335 transitions. [2025-04-13 22:32:57,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:57,683 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:57,684 INFO L225 Difference]: With dead ends: 146 [2025-04-13 22:32:57,684 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 22:32:57,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 22:32:57,685 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:57,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 22:32:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2025-04-13 22:32:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.44) internal successors, (244), 100 states have internal predecessors, (244), 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 22:32:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 244 transitions. [2025-04-13 22:32:57,693 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 244 transitions. Word has length 16 [2025-04-13 22:32:57,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:57,693 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 244 transitions. [2025-04-13 22:32:57,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,693 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 244 transitions. [2025-04-13 22:32:57,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:32:57,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:57,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:57,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:32:57,694 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:57,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1139505944, now seen corresponding path program 2 times [2025-04-13 22:32:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:57,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332096101] [2025-04-13 22:32:57,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:57,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:32:57,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:32:57,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,773 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 22:32:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332096101] [2025-04-13 22:32:57,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332096101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:57,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:57,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:32:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440210263] [2025-04-13 22:32:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:57,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:32:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:57,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:32:57,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:32:57,775 INFO L87 Difference]: Start difference. First operand 101 states and 244 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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 22:32:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:57,855 INFO L93 Difference]: Finished difference Result 140 states and 324 transitions. [2025-04-13 22:32:57,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:57,855 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:57,856 INFO L225 Difference]: With dead ends: 140 [2025-04-13 22:32:57,856 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 22:32:57,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:32:57,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:57,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 22:32:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2025-04-13 22:32:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.3789473684210525) internal successors, (226), 95 states have internal predecessors, (226), 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 22:32:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 226 transitions. [2025-04-13 22:32:57,868 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 226 transitions. Word has length 16 [2025-04-13 22:32:57,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:57,868 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 226 transitions. [2025-04-13 22:32:57,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:57,868 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 226 transitions. [2025-04-13 22:32:57,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:32:57,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:57,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:57,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:32:57,869 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:57,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash -286123142, now seen corresponding path program 2 times [2025-04-13 22:32:57,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:57,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772060104] [2025-04-13 22:32:57,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:57,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:32:57,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:32:57,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,937 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 22:32:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772060104] [2025-04-13 22:32:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772060104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:57,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:32:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976758648] [2025-04-13 22:32:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:57,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:32:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:32:57,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:32:57,938 INFO L87 Difference]: Start difference. First operand 96 states and 226 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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 22:32:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:58,016 INFO L93 Difference]: Finished difference Result 142 states and 314 transitions. [2025-04-13 22:32:58,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:58,017 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:58,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:58,018 INFO L225 Difference]: With dead ends: 142 [2025-04-13 22:32:58,018 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 22:32:58,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 22:32:58,018 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:58,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 22:32:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2025-04-13 22:32:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.336842105263158) internal successors, (222), 95 states have internal predecessors, (222), 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 22:32:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 222 transitions. [2025-04-13 22:32:58,026 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 222 transitions. Word has length 16 [2025-04-13 22:32:58,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:58,026 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 222 transitions. [2025-04-13 22:32:58,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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 22:32:58,026 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 222 transitions. [2025-04-13 22:32:58,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:32:58,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:58,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:58,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:32:58,027 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:58,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash 15363118, now seen corresponding path program 1 times [2025-04-13 22:32:58,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:58,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479382281] [2025-04-13 22:32:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:32:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:58,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:32:58,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:32:58,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:58,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:58,208 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 22:32:58,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:58,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479382281] [2025-04-13 22:32:58,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479382281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:58,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:58,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:32:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167674423] [2025-04-13 22:32:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:58,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:32:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:58,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:32:58,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:32:58,209 INFO L87 Difference]: Start difference. First operand 96 states and 222 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:58,301 INFO L93 Difference]: Finished difference Result 145 states and 339 transitions. [2025-04-13 22:32:58,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:58,301 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:32:58,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:58,302 INFO L225 Difference]: With dead ends: 145 [2025-04-13 22:32:58,302 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 22:32:58,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:32:58,303 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:58,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 22:32:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-13 22:32:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.375) internal successors, (266), 112 states have internal predecessors, (266), 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 22:32:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 266 transitions. [2025-04-13 22:32:58,307 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 266 transitions. Word has length 20 [2025-04-13 22:32:58,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:58,307 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 266 transitions. [2025-04-13 22:32:58,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:58,307 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 266 transitions. [2025-04-13 22:32:58,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:32:58,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:58,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:58,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:32:58,308 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:32:58,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 204631566, now seen corresponding path program 2 times [2025-04-13 22:32:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:58,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181589194] [2025-04-13 22:32:58,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:58,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:32:58,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:32:58,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:58,431 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 22:32:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:58,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181589194] [2025-04-13 22:32:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181589194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:32:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797887834] [2025-04-13 22:32:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:58,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:32:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:58,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:32:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:32:58,432 INFO L87 Difference]: Start difference. First operand 113 states and 266 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:58,542 INFO L93 Difference]: Finished difference Result 113 states and 266 transitions. [2025-04-13 22:32:58,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:32:58,542 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:32:58,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:58,543 INFO L225 Difference]: With dead ends: 113 [2025-04-13 22:32:58,543 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:32:58,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:32:58,545 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:58,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:32:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:32:58,546 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 22:32:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:32:58,546 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-04-13 22:32:58,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:58,546 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:32:58,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:32:58,546 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:32:58,546 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:32:58,549 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:32:58,550 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:32:58,550 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:32:58,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:32:58,552 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1] [2025-04-13 22:32:58,555 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:32:58,555 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:32:58,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:32:58 BasicIcfg [2025-04-13 22:32:58,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:32:58,557 INFO L158 Benchmark]: Toolchain (without parser) took 2486.94ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 45.4MB in the end (delta: 62.1MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2025-04-13 22:32:58,557 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:58,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 92.9MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:32:58,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.73ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:32:58,558 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:58,559 INFO L158 Benchmark]: IcfgBuilder took 372.79ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 66.2MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 22:32:58,559 INFO L158 Benchmark]: TraceAbstraction took 1840.90ms. Allocated memory is still 155.2MB. Free memory was 65.6MB in the beginning and 45.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2025-04-13 22:32:58,560 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.21ms. Allocated memory is still 163.6MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 92.9MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.73ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 372.79ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 66.2MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1840.90ms. Allocated memory is still 155.2MB. Free memory was 65.6MB in the beginning and 45.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.4MB. 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: 78]: 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, 38 locations, 45 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 621 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=6, InterpolantAutomatonStates: 34, 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, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 22:32:58,575 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...