/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/triangular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:33:36,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:33:36,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:33:36,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:33:36,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:33:36,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:33:36,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:33:36,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:33:36,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:33:36,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:33:36,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:33:36,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:33:36,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:33:36,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:33:36,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:33:36,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:33:36,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:33:36,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:33:36,867 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:33:37,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:33:37,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:33:37,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:33:37,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:33:37,114 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:33:37,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-1.i [2025-04-13 21:33:38,445 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601969856/b6c14fcc27034cdba7168718f8a88da1/FLAG5bfa4254d [2025-04-13 21:33:38,689 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:33:38,689 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-1.i [2025-04-13 21:33:38,700 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601969856/b6c14fcc27034cdba7168718f8a88da1/FLAG5bfa4254d [2025-04-13 21:33:39,495 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601969856/b6c14fcc27034cdba7168718f8a88da1 [2025-04-13 21:33:39,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:33:39,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:33:39,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:33:39,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:33:39,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:33:39,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235b7f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39, skipping insertion in model container [2025-04-13 21:33:39,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:33:39,799 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/triangular-1.i[30950,30963] [2025-04-13 21:33:39,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:33:39,810 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:33:39,864 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/triangular-1.i[30950,30963] [2025-04-13 21:33:39,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:33:39,889 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:33:39,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39 WrapperNode [2025-04-13 21:33:39,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:33:39,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:33:39,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:33:39,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:33:39,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,922 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 21:33:39,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:33:39,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:33:39,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:33:39,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:33:39,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:33:39,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:33:39,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:33:39,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:33:39,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:33:39,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (1/1) ... [2025-04-13 21:33:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:33:39,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:33:39,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:33:39,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:33:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:33:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:33:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:33:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:33:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:33:40,001 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:33:40,087 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:33:40,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:33:40,180 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:33:40,181 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:33:40,181 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:33:40,255 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:33:40,260 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:33:40,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:33:40,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:33:40 BoogieIcfgContainer [2025-04-13 21:33:40,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:33:40,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:33:40,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:33:40,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:33:40,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:33:39" (1/3) ... [2025-04-13 21:33:40,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd44d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:33:40, skipping insertion in model container [2025-04-13 21:33:40,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:33:39" (2/3) ... [2025-04-13 21:33:40,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd44d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:33:40, skipping insertion in model container [2025-04-13 21:33:40,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:33:40" (3/3) ... [2025-04-13 21:33:40,275 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2025-04-13 21:33:40,285 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:33:40,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-1.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:33:40,287 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:33:40,321 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:33:40,343 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 21:33:40,365 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:40,384 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:33:40,391 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;@d54958a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:33:40,391 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:33:40,393 INFO L278 IsEmpty]: Start isEmpty. Operand has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:40,396 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:33:40,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:40,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:40,397 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 21:33:40,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -272227646, now seen corresponding path program 1 times [2025-04-13 21:33:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:40,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94917592] [2025-04-13 21:33:40,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:40,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:33:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:33:40,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:40,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:40,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94917592] [2025-04-13 21:33:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94917592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:33:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:33:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215057597] [2025-04-13 21:33:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:40,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:33:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:40,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:33:40,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:33:40,823 INFO L87 Difference]: Start difference. First operand has 90 states, 89 states have (on average 3.191011235955056) internal successors, (284), 89 states have internal predecessors, (284), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:40,951 INFO L93 Difference]: Finished difference Result 160 states and 472 transitions. [2025-04-13 21:33:40,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:33:40,953 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-13 21:33:40,954 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:40,960 INFO L225 Difference]: With dead ends: 160 [2025-04-13 21:33:40,960 INFO L226 Difference]: Without dead ends: 94 [2025-04-13 21:33:40,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:33:40,967 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:40,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-13 21:33:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-13 21:33:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.6881720430107525) internal successors, (250), 93 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 250 transitions. [2025-04-13 21:33:40,994 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 250 transitions. Word has length 8 [2025-04-13 21:33:40,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:40,994 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 250 transitions. [2025-04-13 21:33:40,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:40,994 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 250 transitions. [2025-04-13 21:33:40,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:33:40,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:40,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:40,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:33:40,995 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 21:33:40,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 396744576, now seen corresponding path program 1 times [2025-04-13 21:33:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:40,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552330313] [2025-04-13 21:33:40,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:41,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:33:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:33:41,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:41,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552330313] [2025-04-13 21:33:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552330313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:41,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:33:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:33:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742221733] [2025-04-13 21:33:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:41,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:33:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:41,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:33:41,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:33:41,155 INFO L87 Difference]: Start difference. First operand 94 states and 250 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:41,311 INFO L93 Difference]: Finished difference Result 156 states and 417 transitions. [2025-04-13 21:33:41,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:33:41,312 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 21:33:41,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:41,313 INFO L225 Difference]: With dead ends: 156 [2025-04-13 21:33:41,313 INFO L226 Difference]: Without dead ends: 115 [2025-04-13 21:33:41,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:33:41,314 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:41,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-13 21:33:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-04-13 21:33:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.6407766990291264) internal successors, (272), 103 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 272 transitions. [2025-04-13 21:33:41,326 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 272 transitions. Word has length 10 [2025-04-13 21:33:41,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:41,327 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 272 transitions. [2025-04-13 21:33:41,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,327 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 272 transitions. [2025-04-13 21:33:41,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:33:41,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:41,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:41,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:33:41,330 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 21:33:41,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2132617218, now seen corresponding path program 1 times [2025-04-13 21:33:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:41,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495193882] [2025-04-13 21:33:41,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:41,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:33:41,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:33:41,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:41,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:41,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495193882] [2025-04-13 21:33:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495193882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:41,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:33:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:33:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161716280] [2025-04-13 21:33:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:41,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:33:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:41,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:33:41,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:33:41,437 INFO L87 Difference]: Start difference. First operand 104 states and 272 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:41,589 INFO L93 Difference]: Finished difference Result 181 states and 489 transitions. [2025-04-13 21:33:41,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:33:41,590 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:33:41,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:41,591 INFO L225 Difference]: With dead ends: 181 [2025-04-13 21:33:41,591 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 21:33:41,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:33:41,592 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:41,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 21:33:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2025-04-13 21:33:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.63) internal successors, (263), 100 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 263 transitions. [2025-04-13 21:33:41,603 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 263 transitions. Word has length 12 [2025-04-13 21:33:41,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:41,604 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 263 transitions. [2025-04-13 21:33:41,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,604 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 263 transitions. [2025-04-13 21:33:41,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:33:41,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:41,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:41,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:33:41,604 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 21:33:41,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2074764538, now seen corresponding path program 2 times [2025-04-13 21:33:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:41,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068709643] [2025-04-13 21:33:41,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:33:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:41,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:33:41,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:33:41,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:33:41,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:41,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068709643] [2025-04-13 21:33:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068709643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:33:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:33:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333978052] [2025-04-13 21:33:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:41,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:33:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:41,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:33:41,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:33:41,759 INFO L87 Difference]: Start difference. First operand 101 states and 263 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:41,916 INFO L93 Difference]: Finished difference Result 181 states and 477 transitions. [2025-04-13 21:33:41,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:33:41,916 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:33:41,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:41,917 INFO L225 Difference]: With dead ends: 181 [2025-04-13 21:33:41,917 INFO L226 Difference]: Without dead ends: 141 [2025-04-13 21:33:41,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:33:41,918 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:41,918 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-13 21:33:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2025-04-13 21:33:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.683333333333333) internal successors, (322), 120 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 322 transitions. [2025-04-13 21:33:41,927 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 322 transitions. Word has length 12 [2025-04-13 21:33:41,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:41,928 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 322 transitions. [2025-04-13 21:33:41,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:41,928 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 322 transitions. [2025-04-13 21:33:41,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:33:41,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:41,929 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:41,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:33:41,931 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 21:33:41,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1070313945, now seen corresponding path program 1 times [2025-04-13 21:33:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:41,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542442040] [2025-04-13 21:33:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:33:41,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:33:41,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:42,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542442040] [2025-04-13 21:33:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542442040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:33:42,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132015634] [2025-04-13 21:33:42,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:33:42,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:33:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:33:42,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:33:42,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:33:42,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:42,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:42,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:33:42,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:33:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:42,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:33:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132015634] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:33:42,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:33:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:33:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546463200] [2025-04-13 21:33:42,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:33:42,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:33:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:42,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:33:42,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:33:42,258 INFO L87 Difference]: Start difference. First operand 121 states and 322 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:42,544 INFO L93 Difference]: Finished difference Result 283 states and 799 transitions. [2025-04-13 21:33:42,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:33:42,544 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 21:33:42,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:42,545 INFO L225 Difference]: With dead ends: 283 [2025-04-13 21:33:42,546 INFO L226 Difference]: Without dead ends: 165 [2025-04-13 21:33:42,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:33:42,547 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:42,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-13 21:33:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2025-04-13 21:33:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.676056338028169) internal successors, (380), 142 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 380 transitions. [2025-04-13 21:33:42,553 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 380 transitions. Word has length 14 [2025-04-13 21:33:42,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:42,553 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 380 transitions. [2025-04-13 21:33:42,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:42,553 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 380 transitions. [2025-04-13 21:33:42,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:33:42,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:42,556 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:42,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:33:42,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:42,756 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 21:33:42,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1387412156, now seen corresponding path program 1 times [2025-04-13 21:33:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:42,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550776883] [2025-04-13 21:33:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:42,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:33:42,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:33:42,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:42,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:33:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:42,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550776883] [2025-04-13 21:33:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550776883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:33:42,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516914310] [2025-04-13 21:33:42,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:33:42,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:42,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:33:42,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:33:42,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:33:42,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:33:42,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:33:42,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:33:42,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:42,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:33:42,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:33:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:33:42,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:33:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:33:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516914310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:33:43,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:33:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 21:33:43,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653455431] [2025-04-13 21:33:43,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:33:43,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:33:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:43,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:33:43,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:33:43,062 INFO L87 Difference]: Start difference. First operand 143 states and 380 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:43,674 INFO L93 Difference]: Finished difference Result 583 states and 1639 transitions. [2025-04-13 21:33:43,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 21:33:43,674 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 21:33:43,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:43,676 INFO L225 Difference]: With dead ends: 583 [2025-04-13 21:33:43,677 INFO L226 Difference]: Without dead ends: 365 [2025-04-13 21:33:43,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=652, Invalid=1700, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 21:33:43,681 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:43,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:33:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-04-13 21:33:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 215. [2025-04-13 21:33:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.6448598130841123) internal successors, (566), 214 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 566 transitions. [2025-04-13 21:33:43,700 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 566 transitions. Word has length 20 [2025-04-13 21:33:43,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:43,700 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 566 transitions. [2025-04-13 21:33:43,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:43,700 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 566 transitions. [2025-04-13 21:33:43,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 21:33:43,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:43,701 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:43,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:33:43,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 21:33:43,902 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 21:33:43,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1355589565, now seen corresponding path program 2 times [2025-04-13 21:33:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:43,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345292594] [2025-04-13 21:33:43,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:33:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:43,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 21:33:43,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:33:43,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:33:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:44,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345292594] [2025-04-13 21:33:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345292594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:33:44,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579796535] [2025-04-13 21:33:44,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:33:44,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:33:44,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:33:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:33:44,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 21:33:44,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:33:44,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:33:44,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:44,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:33:44,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:33:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:44,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:33:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:33:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579796535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:33:44,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:33:44,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-04-13 21:33:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221836011] [2025-04-13 21:33:44,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:33:44,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:33:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:33:44,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:33:44,353 INFO L87 Difference]: Start difference. First operand 215 states and 566 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:44,766 INFO L93 Difference]: Finished difference Result 439 states and 1183 transitions. [2025-04-13 21:33:44,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 21:33:44,767 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 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 26 [2025-04-13 21:33:44,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:44,769 INFO L225 Difference]: With dead ends: 439 [2025-04-13 21:33:44,769 INFO L226 Difference]: Without dead ends: 373 [2025-04-13 21:33:44,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=551, Invalid=1611, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 21:33:44,770 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:44,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:33:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-13 21:33:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 335. [2025-04-13 21:33:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.6766467065868262) internal successors, (894), 334 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 894 transitions. [2025-04-13 21:33:44,788 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 894 transitions. Word has length 26 [2025-04-13 21:33:44,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:44,788 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 894 transitions. [2025-04-13 21:33:44,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:44,788 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 894 transitions. [2025-04-13 21:33:44,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:33:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:44,790 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:44,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 21:33:44,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:44,990 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:33:44,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1208241411, now seen corresponding path program 3 times [2025-04-13 21:33:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:44,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499043283] [2025-04-13 21:33:44,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:33:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:44,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 6 equivalence classes. [2025-04-13 21:33:45,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 21:33:45,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 21:33:45,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:33:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:45,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499043283] [2025-04-13 21:33:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499043283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:33:45,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555613972] [2025-04-13 21:33:45,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:33:45,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:33:45,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:33:45,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:33:45,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 6 equivalence classes. [2025-04-13 21:33:45,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 21:33:45,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 21:33:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:45,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:33:45,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:33:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:33:45,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:33:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555613972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:33:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-04-13 21:33:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972535936] [2025-04-13 21:33:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:45,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:33:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:33:45,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:33:45,141 INFO L87 Difference]: Start difference. First operand 335 states and 894 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:45,226 INFO L93 Difference]: Finished difference Result 975 states and 2604 transitions. [2025-04-13 21:33:45,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:33:45,226 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:33:45,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:45,228 INFO L225 Difference]: With dead ends: 975 [2025-04-13 21:33:45,228 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 21:33:45,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:33:45,230 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:45,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 21:33:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-13 21:33:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.2283464566929134) internal successors, (283), 127 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 283 transitions. [2025-04-13 21:33:45,239 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 283 transitions. Word has length 30 [2025-04-13 21:33:45,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:45,241 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 283 transitions. [2025-04-13 21:33:45,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:45,241 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 283 transitions. [2025-04-13 21:33:45,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:33:45,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:33:45,242 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:33:45,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:33:45,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:33:45,442 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:33:45,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:33:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash 885462397, now seen corresponding path program 4 times [2025-04-13 21:33:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:33:45,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347180639] [2025-04-13 21:33:45,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:33:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:33:45,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 21:33:45,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-04-13 21:33:45,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 21:33:45,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:33:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 21:33:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:33:45,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347180639] [2025-04-13 21:33:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347180639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:33:45,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:33:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:33:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271390813] [2025-04-13 21:33:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:33:45,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:33:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:33:45,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:33:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:33:45,499 INFO L87 Difference]: Start difference. First operand 128 states and 283 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 21:33:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:33:45,559 INFO L93 Difference]: Finished difference Result 346 states and 769 transitions. [2025-04-13 21:33:45,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:33:45,560 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 30 [2025-04-13 21:33:45,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:33:45,561 INFO L225 Difference]: With dead ends: 346 [2025-04-13 21:33:45,561 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:33:45,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:33:45,561 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:45,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:33:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:33:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:33:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:33:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:33:45,563 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-04-13 21:33:45,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:33:45,563 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:33:45,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 21:33:45,563 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:33:45,563 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:33:45,566 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:33:45,566 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:33:45,566 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:33:45,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:33:45,571 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2025-04-13 21:33:45,573 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:33:45,573 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:33:45,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:33:45 BasicIcfg [2025-04-13 21:33:45,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:33:45,575 INFO L158 Benchmark]: Toolchain (without parser) took 6077.40ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 50.2MB in the end (delta: 47.9MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2025-04-13 21:33:45,576 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:45,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.05ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 75.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:33:45,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:45,576 INFO L158 Benchmark]: Boogie Preprocessor took 32.78ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 71.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:45,576 INFO L158 Benchmark]: IcfgBuilder took 307.75ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 50.9MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:33:45,579 INFO L158 Benchmark]: TraceAbstraction took 5306.36ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 50.2MB in the end (delta: 710.5kB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. [2025-04-13 21:33:45,581 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 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.05ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 75.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.78ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 71.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 307.75ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 50.9MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5306.36ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 50.2MB in the end (delta: 710.5kB). Peak memory consumption was 2.9MB. 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: 722]: 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, 28 locations, 33 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1054 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1054 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1877 IncrementalHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 0 mSDtfsCounter, 1877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 131, 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, 9 MinimizatonAttempts, 263 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002 SizeOfPredicates, 20 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 140/250 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:33:45,601 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...