/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/triangular-longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:06:33,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:06:33,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:06:33,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:06:33,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:06:33,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:06:33,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:06:33,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:06:33,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:06:33,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:06:33,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:06:33,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:06:33,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:06:33,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:06:33,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:06:33,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:06:33,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:33,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:06:33,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:33,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:06:33,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:06:33,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:06:33,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:06:33,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:06:33,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:06:33,888 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:06:33,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-1.i [2025-04-13 17:06:35,188 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9126aae/2271c92712ef4581972d776f3cb666d5/FLAG0973b743a [2025-04-13 17:06:35,469 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:06:35,469 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-1.i [2025-04-13 17:06:35,486 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9126aae/2271c92712ef4581972d776f3cb666d5/FLAG0973b743a [2025-04-13 17:06:36,387 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9126aae/2271c92712ef4581972d776f3cb666d5 [2025-04-13 17:06:36,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:06:36,390 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:06:36,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:36,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:06:36,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:06:36,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eca2378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36, skipping insertion in model container [2025-04-13 17:06:36,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:06:36,688 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-longer-1.i[30961,30974] [2025-04-13 17:06:36,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:36,699 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:06:36,744 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-longer-1.i[30961,30974] [2025-04-13 17:06:36,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:06:36,770 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:06:36,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36 WrapperNode [2025-04-13 17:06:36,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:06:36,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:36,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:06:36,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:06:36,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,801 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 17:06:36,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:06:36,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:06:36,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:06:36,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:06:36,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 17:06:36,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:06:36,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:06:36,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:06:36,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:06:36,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (1/1) ... [2025-04-13 17:06:36,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:06:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:36,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:06:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:06:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:06:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:06:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:06:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:06:36,877 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:06:36,966 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:06:36,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:06:37,048 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:06:37,049 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:06:37,049 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:06:37,114 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:37,117 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:06:37,124 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:06:37,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:37 BoogieIcfgContainer [2025-04-13 17:06:37,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:06:37,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:06:37,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:06:37,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:06:37,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:06:36" (1/3) ... [2025-04-13 17:06:37,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4ab598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:37, skipping insertion in model container [2025-04-13 17:06:37,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:06:36" (2/3) ... [2025-04-13 17:06:37,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4ab598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:06:37, skipping insertion in model container [2025-04-13 17:06:37,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:06:37" (3/3) ... [2025-04-13 17:06:37,130 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2025-04-13 17:06:37,140 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:06:37,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-1.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 17:06:37,141 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:06:37,171 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:06:37,192 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 17:06:37,208 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 17:06:37,223 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:06:37,232 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;@72dda599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:06:37,232 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:06:37,234 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 17:06:37,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:06:37,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:37,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:37,239 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 17:06:37,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1193666932, now seen corresponding path program 1 times [2025-04-13 17:06:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:37,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811546977] [2025-04-13 17:06:37,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:37,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:37,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:06:37,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:06:37,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:37,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:37,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811546977] [2025-04-13 17:06:37,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811546977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:37,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:06:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581375390] [2025-04-13 17:06:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:37,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:06:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:37,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:06:37,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:06:37,576 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 17:06:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:37,692 INFO L93 Difference]: Finished difference Result 160 states and 472 transitions. [2025-04-13 17:06:37,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:06:37,695 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 17:06:37,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:37,700 INFO L225 Difference]: With dead ends: 160 [2025-04-13 17:06:37,700 INFO L226 Difference]: Without dead ends: 94 [2025-04-13 17:06:37,704 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 17:06:37,706 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 17:06:37,706 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 17:06:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-13 17:06:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-13 17:06:37,726 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 17:06:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 250 transitions. [2025-04-13 17:06:37,731 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 250 transitions. Word has length 8 [2025-04-13 17:06:37,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:37,731 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 250 transitions. [2025-04-13 17:06:37,731 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 17:06:37,731 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 250 transitions. [2025-04-13 17:06:37,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:06:37,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:37,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:37,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:06:37,732 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 17:06:37,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -113514130, now seen corresponding path program 1 times [2025-04-13 17:06:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:37,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673331416] [2025-04-13 17:06:37,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:37,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:06:37,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:06:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:37,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:37,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673331416] [2025-04-13 17:06:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673331416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:37,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:37,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:06:37,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838675469] [2025-04-13 17:06:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:37,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:06:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:37,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:06:37,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:06:37,874 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 17:06:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:37,995 INFO L93 Difference]: Finished difference Result 156 states and 417 transitions. [2025-04-13 17:06:37,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:06:37,995 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 17:06:37,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:37,996 INFO L225 Difference]: With dead ends: 156 [2025-04-13 17:06:37,996 INFO L226 Difference]: Without dead ends: 115 [2025-04-13 17:06:37,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:06:37,997 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:37,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-13 17:06:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-04-13 17:06:38,006 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 17:06:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 272 transitions. [2025-04-13 17:06:38,010 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 272 transitions. Word has length 10 [2025-04-13 17:06:38,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,011 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 272 transitions. [2025-04-13 17:06:38,011 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 17:06:38,011 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 272 transitions. [2025-04-13 17:06:38,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:06:38,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:06:38,012 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 17:06:38,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash -74058640, now seen corresponding path program 1 times [2025-04-13 17:06:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153649232] [2025-04-13 17:06:38,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:06:38,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:06:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153649232] [2025-04-13 17:06:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153649232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:06:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205921076] [2025-04-13 17:06:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:06:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:06:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:06:38,147 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 17:06:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,296 INFO L93 Difference]: Finished difference Result 199 states and 543 transitions. [2025-04-13 17:06:38,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:06:38,297 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 17:06:38,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,299 INFO L225 Difference]: With dead ends: 199 [2025-04-13 17:06:38,299 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 17:06:38,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:06:38,300 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:38,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 17:06:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2025-04-13 17:06:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.6792452830188678) internal successors, (284), 106 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 17:06:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 284 transitions. [2025-04-13 17:06:38,309 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 284 transitions. Word has length 12 [2025-04-13 17:06:38,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,309 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 284 transitions. [2025-04-13 17:06:38,309 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 17:06:38,309 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 284 transitions. [2025-04-13 17:06:38,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:06:38,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,311 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:06:38,311 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 17:06:38,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1634276771, now seen corresponding path program 1 times [2025-04-13 17:06:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091838962] [2025-04-13 17:06:38,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:38,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:38,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,436 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 17:06:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:38,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091838962] [2025-04-13 17:06:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091838962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:38,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14278459] [2025-04-13 17:06:38,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:38,440 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 17:06:38,440 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 17:06:38,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:06:38,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:38,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:06:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:38,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:06:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14278459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:38,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:06:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-13 17:06:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726656051] [2025-04-13 17:06:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:38,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:06:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:38,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:06:38,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:06:38,553 INFO L87 Difference]: Start difference. First operand 107 states and 284 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:38,740 INFO L93 Difference]: Finished difference Result 248 states and 667 transitions. [2025-04-13 17:06:38,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:06:38,740 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 17:06:38,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:38,741 INFO L225 Difference]: With dead ends: 248 [2025-04-13 17:06:38,741 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 17:06:38,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:06:38,742 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:38,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 3 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 17:06:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2025-04-13 17:06:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.6901408450704225) internal successors, (382), 142 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 382 transitions. [2025-04-13 17:06:38,752 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 382 transitions. Word has length 14 [2025-04-13 17:06:38,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:38,752 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 382 transitions. [2025-04-13 17:06:38,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:38,752 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 382 transitions. [2025-04-13 17:06:38,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:06:38,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:38,755 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:38,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:06:38,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:38,955 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 17:06:38,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:38,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1206946781, now seen corresponding path program 2 times [2025-04-13 17:06:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:38,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167164324] [2025-04-13 17:06:38,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:38,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:06:38,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:38,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,061 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 17:06:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:39,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167164324] [2025-04-13 17:06:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167164324] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:39,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36911687] [2025-04-13 17:06:39,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:39,065 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 17:06:39,066 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 17:06:39,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:06:39,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:06:39,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:39,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:06:39,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:39,141 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 17:06:39,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:39,269 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 17:06:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36911687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:39,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 17:06:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59039422] [2025-04-13 17:06:39,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:39,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:06:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:39,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:06:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:06:39,270 INFO L87 Difference]: Start difference. First operand 143 states and 382 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:39,560 INFO L93 Difference]: Finished difference Result 297 states and 807 transitions. [2025-04-13 17:06:39,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:06:39,561 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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 17:06:39,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:39,562 INFO L225 Difference]: With dead ends: 297 [2025-04-13 17:06:39,562 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 17:06:39,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:06:39,563 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:39,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 7 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 17:06:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2025-04-13 17:06:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.6125) internal successors, (418), 160 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 418 transitions. [2025-04-13 17:06:39,574 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 418 transitions. Word has length 14 [2025-04-13 17:06:39,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:39,574 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 418 transitions. [2025-04-13 17:06:39,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:39,574 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 418 transitions. [2025-04-13 17:06:39,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:06:39,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:39,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:39,584 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 17:06:39,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:39,777 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 17:06:39,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1775987588, now seen corresponding path program 1 times [2025-04-13 17:06:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:39,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464719378] [2025-04-13 17:06:39,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:39,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:06:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:06:39,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:39,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464719378] [2025-04-13 17:06:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464719378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:39,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840219960] [2025-04-13 17:06:39,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:06:39,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:39,893 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 17:06:39,894 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 17:06:39,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:06:39,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:06:39,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:06:39,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:39,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:06:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:39,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840219960] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:40,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 17:06:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961187543] [2025-04-13 17:06:40,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:40,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:06:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:40,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:06:40,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:06:40,075 INFO L87 Difference]: Start difference. First operand 161 states and 418 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:40,515 INFO L93 Difference]: Finished difference Result 423 states and 1167 transitions. [2025-04-13 17:06:40,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:06:40,515 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 17:06:40,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:40,518 INFO L225 Difference]: With dead ends: 423 [2025-04-13 17:06:40,518 INFO L226 Difference]: Without dead ends: 251 [2025-04-13 17:06:40,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:06:40,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:40,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:06:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-13 17:06:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2025-04-13 17:06:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.6470588235294117) internal successors, (450), 170 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 450 transitions. [2025-04-13 17:06:40,528 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 450 transitions. Word has length 16 [2025-04-13 17:06:40,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:40,528 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 450 transitions. [2025-04-13 17:06:40,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:40,528 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 450 transitions. [2025-04-13 17:06:40,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:06:40,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:40,529 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:40,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:06:40,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,730 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 17:06:40,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -44083554, now seen corresponding path program 2 times [2025-04-13 17:06:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:40,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476711774] [2025-04-13 17:06:40,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:40,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:06:40,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:06:40,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:40,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476711774] [2025-04-13 17:06:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476711774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:40,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478663885] [2025-04-13 17:06:40,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:06:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:40,880 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 17:06:40,887 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 17:06:40,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:06:40,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:06:40,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:06:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:40,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:06:40,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:40,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478663885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:41,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:41,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-13 17:06:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74765713] [2025-04-13 17:06:41,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:41,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:06:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:41,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:06:41,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:06:41,117 INFO L87 Difference]: Start difference. First operand 171 states and 450 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:41,868 INFO L93 Difference]: Finished difference Result 609 states and 1717 transitions. [2025-04-13 17:06:41,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 17:06:41,869 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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 24 [2025-04-13 17:06:41,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:41,871 INFO L225 Difference]: With dead ends: 609 [2025-04-13 17:06:41,871 INFO L226 Difference]: Without dead ends: 369 [2025-04-13 17:06:41,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1172, Invalid=2988, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 17:06:41,873 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 427 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:41,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-04-13 17:06:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 271. [2025-04-13 17:06:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.6666666666666665) internal successors, (720), 270 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 720 transitions. [2025-04-13 17:06:41,883 INFO L79 Accepts]: Start accepts. Automaton has 271 states and 720 transitions. Word has length 24 [2025-04-13 17:06:41,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:41,883 INFO L485 AbstractCegarLoop]: Abstraction has 271 states and 720 transitions. [2025-04-13 17:06:41,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:41,884 INFO L278 IsEmpty]: Start isEmpty. Operand 271 states and 720 transitions. [2025-04-13 17:06:41,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 17:06:41,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:41,885 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 17:06:42,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:42,085 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 17:06:42,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1607421564, now seen corresponding path program 3 times [2025-04-13 17:06:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:42,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796327101] [2025-04-13 17:06:42,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:42,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-04-13 17:06:42,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:06:42,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:42,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796327101] [2025-04-13 17:06:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796327101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:42,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882811150] [2025-04-13 17:06:42,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:42,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:42,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:42,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 17:06:42,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 11 equivalence classes. [2025-04-13 17:06:42,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:06:42,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 17:06:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:06:42,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882811150] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:42,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-04-13 17:06:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565402422] [2025-04-13 17:06:42,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:42,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:06:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:42,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:06:42,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:06:42,639 INFO L87 Difference]: Start difference. First operand 271 states and 720 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:43,613 INFO L93 Difference]: Finished difference Result 715 states and 1991 transitions. [2025-04-13 17:06:43,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 17:06:43,613 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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 36 [2025-04-13 17:06:43,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:43,616 INFO L225 Difference]: With dead ends: 715 [2025-04-13 17:06:43,616 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 17:06:43,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1571, Invalid=4281, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 17:06:43,618 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 729 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:43,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 17:06:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 315. [2025-04-13 17:06:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 2.656050955414013) internal successors, (834), 314 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 834 transitions. [2025-04-13 17:06:43,628 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 834 transitions. Word has length 36 [2025-04-13 17:06:43,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:43,628 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 834 transitions. [2025-04-13 17:06:43,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:43,628 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 834 transitions. [2025-04-13 17:06:43,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-13 17:06:43,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:43,630 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:43,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:43,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:43,834 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 17:06:43,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1341689954, now seen corresponding path program 4 times [2025-04-13 17:06:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:43,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678671954] [2025-04-13 17:06:43,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:43,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-13 17:06:43,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 17:06:43,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:44,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678671954] [2025-04-13 17:06:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678671954] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:44,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813904170] [2025-04-13 17:06:44,217 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:06:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:44,222 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:06:44,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 17:06:44,265 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-13 17:06:44,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 17:06:44,281 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:06:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:06:44,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813904170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:44,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-04-13 17:06:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823686448] [2025-04-13 17:06:44,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:44,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 17:06:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 17:06:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=1768, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:06:44,693 INFO L87 Difference]: Start difference. First operand 315 states and 834 transitions. Second operand has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 47 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:45,608 INFO L93 Difference]: Finished difference Result 681 states and 1837 transitions. [2025-04-13 17:06:45,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 17:06:45,609 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 47 states have internal predecessors, (98), 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 48 [2025-04-13 17:06:45,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:45,612 INFO L225 Difference]: With dead ends: 681 [2025-04-13 17:06:45,612 INFO L226 Difference]: Without dead ends: 591 [2025-04-13 17:06:45,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2522, Invalid=6598, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 17:06:45,615 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 737 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:45,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:06:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-04-13 17:06:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 501. [2025-04-13 17:06:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 2.772) internal successors, (1386), 500 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1386 transitions. [2025-04-13 17:06:45,627 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1386 transitions. Word has length 48 [2025-04-13 17:06:45,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:45,627 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1386 transitions. [2025-04-13 17:06:45,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 47 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:45,628 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1386 transitions. [2025-04-13 17:06:45,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 17:06:45,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:45,630 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:45,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:45,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:45,830 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:06:45,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -404106755, now seen corresponding path program 5 times [2025-04-13 17:06:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:45,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821658580] [2025-04-13 17:06:45,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:06:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:45,836 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 19 equivalence classes. [2025-04-13 17:06:45,846 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 17:06:45,846 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-04-13 17:06:45,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 17:06:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:45,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821658580] [2025-04-13 17:06:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821658580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:06:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:06:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:06:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509232074] [2025-04-13 17:06:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:06:45,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:06:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:45,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:06:45,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:06:45,953 INFO L87 Difference]: Start difference. First operand 501 states and 1386 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:06:46,065 INFO L93 Difference]: Finished difference Result 2560 states and 7105 transitions. [2025-04-13 17:06:46,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:06:46,065 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 50 [2025-04-13 17:06:46,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:06:46,067 INFO L225 Difference]: With dead ends: 2560 [2025-04-13 17:06:46,067 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:06:46,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:06:46,070 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:46,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 113 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:06:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:06:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:06:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:06:46,071 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-04-13 17:06:46,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:46,071 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:06:46,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:46,072 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:06:46,072 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:06:46,074 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:46,074 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:46,074 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:46,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:06:46,076 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2025-04-13 17:06:46,077 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:46,078 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:46,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:46 BasicIcfg [2025-04-13 17:06:46,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:46,080 INFO L158 Benchmark]: Toolchain (without parser) took 9689.82ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 97.6MB in the beginning and 275.7MB in the end (delta: -178.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.23ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 74.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.32ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: RCFGBuilder took 289.16ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 51.1MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 17:06:46,080 INFO L158 Benchmark]: TraceAbstraction took 8953.68ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.3MB in the beginning and 275.7MB in the end (delta: -225.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:46,082 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.23ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 74.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.32ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 71.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 289.16ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 51.1MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8953.68ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.3MB in the beginning and 275.7MB in the end (delta: -225.4MB). There was no memory consumed. 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: 8.9s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2580 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2580 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3096 IncrementalHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 35 mSDtfsCounter, 3096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 218 SyntacticMatches, 8 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6310 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=9, InterpolantAutomatonStates: 251, 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, 10 MinimizatonAttempts, 574 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 58 NumberOfNonLiveVariables, 698 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 265/1431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:06:46,093 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...