/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:33:24,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:33:25,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:33:25,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:33:25,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:33:25,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:33:25,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:33:25,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:33:25,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:33:25,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:33:25,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:33:25,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:33:25,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:33:25,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:33:25,070 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:33:25,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:33:25,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:33:25,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:25,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:25,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:33:25,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:33:25,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:33:25,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:33:25,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:33:25,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:33:25,295 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:33:25,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2025-04-13 22:33:26,608 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bae9bdc/9c0e7e6fb5f144858dbd17f3493a5702/FLAG1a9a216e6 [2025-04-13 22:33:26,777 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:33:26,788 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2025-04-13 22:33:26,801 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bae9bdc/9c0e7e6fb5f144858dbd17f3493a5702/FLAG1a9a216e6 [2025-04-13 22:33:27,609 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bae9bdc/9c0e7e6fb5f144858dbd17f3493a5702 [2025-04-13 22:33:27,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:33:27,612 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:33:27,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:27,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:33:27,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:33:27,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4b642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27, skipping insertion in model container [2025-04-13 22:33:27,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:33:27,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3066,3079] [2025-04-13 22:33:27,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:27,779 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:33:27,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3066,3079] [2025-04-13 22:33:27,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:27,816 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:33:27,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27 WrapperNode [2025-04-13 22:33:27,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:27,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:27,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:33:27,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:33:27,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,848 INFO L138 Inliner]: procedures = 21, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-04-13 22:33:27,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:27,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:33:27,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:33:27,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:33:27,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 22:33:27,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:33:27,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:33:27,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:33:27,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:33:27,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (1/1) ... [2025-04-13 22:33:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:27,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:33:27,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:33:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:33:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:33:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:33:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:33:27,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:33:27,927 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:33:27,990 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:33:27,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:33:28,141 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:33:28,141 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:33:28,141 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:33:28,293 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:33:28,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:28 BoogieIcfgContainer [2025-04-13 22:33:28,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:33:28,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:33:28,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:33:28,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:33:28,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:33:27" (1/3) ... [2025-04-13 22:33:28,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d46acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:28, skipping insertion in model container [2025-04-13 22:33:28,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:27" (2/3) ... [2025-04-13 22:33:28,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d46acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:28, skipping insertion in model container [2025-04-13 22:33:28,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:28" (3/3) ... [2025-04-13 22:33:28,300 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-04-13 22:33:28,309 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:33:28,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-5.wvr.c that has 4 procedures, 31 locations, 31 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 22:33:28,311 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:33:28,361 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:33:28,385 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 34 transitions, 89 flow [2025-04-13 22:33:28,437 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 540 states, 539 states have (on average 3.3951762523191094) internal successors, (1830), 539 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:28,461 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:33:28,470 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;@459ef8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:33:28,471 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:33:28,476 INFO L278 IsEmpty]: Start isEmpty. Operand has 540 states, 539 states have (on average 3.3951762523191094) internal successors, (1830), 539 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:28,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:28,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:28,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:28,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:28,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1138694495, now seen corresponding path program 1 times [2025-04-13 22:33:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:28,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100855824] [2025-04-13 22:33:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:28,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:28,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:28,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:28,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:28,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:28,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100855824] [2025-04-13 22:33:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100855824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:28,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193066827] [2025-04-13 22:33:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:28,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:28,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:28,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:28,881 INFO L87 Difference]: Start difference. First operand has 540 states, 539 states have (on average 3.3951762523191094) internal successors, (1830), 539 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:29,063 INFO L93 Difference]: Finished difference Result 698 states and 2340 transitions. [2025-04-13 22:33:29,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:29,065 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:29,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:29,078 INFO L225 Difference]: With dead ends: 698 [2025-04-13 22:33:29,078 INFO L226 Difference]: Without dead ends: 592 [2025-04-13 22:33:29,081 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:29,082 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:29,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 14 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-13 22:33:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 508. [2025-04-13 22:33:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 3.447731755424063) internal successors, (1748), 507 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1748 transitions. [2025-04-13 22:33:29,155 INFO L79 Accepts]: Start accepts. Automaton has 508 states and 1748 transitions. Word has length 20 [2025-04-13 22:33:29,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:29,155 INFO L485 AbstractCegarLoop]: Abstraction has 508 states and 1748 transitions. [2025-04-13 22:33:29,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,155 INFO L278 IsEmpty]: Start isEmpty. Operand 508 states and 1748 transitions. [2025-04-13 22:33:29,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:29,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:29,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:29,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:33:29,159 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:29,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash -54891211, now seen corresponding path program 2 times [2025-04-13 22:33:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:29,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749990164] [2025-04-13 22:33:29,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:29,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:29,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:29,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:29,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:29,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749990164] [2025-04-13 22:33:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749990164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772182581] [2025-04-13 22:33:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:29,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:29,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:29,358 INFO L87 Difference]: Start difference. First operand 508 states and 1748 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:29,490 INFO L93 Difference]: Finished difference Result 682 states and 2332 transitions. [2025-04-13 22:33:29,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:29,491 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:29,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:29,495 INFO L225 Difference]: With dead ends: 682 [2025-04-13 22:33:29,498 INFO L226 Difference]: Without dead ends: 608 [2025-04-13 22:33:29,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:29,500 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:29,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 14 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-04-13 22:33:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 506. [2025-04-13 22:33:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.495049504950495) internal successors, (1765), 505 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1765 transitions. [2025-04-13 22:33:29,551 INFO L79 Accepts]: Start accepts. Automaton has 506 states and 1765 transitions. Word has length 20 [2025-04-13 22:33:29,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:29,553 INFO L485 AbstractCegarLoop]: Abstraction has 506 states and 1765 transitions. [2025-04-13 22:33:29,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,553 INFO L278 IsEmpty]: Start isEmpty. Operand 506 states and 1765 transitions. [2025-04-13 22:33:29,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:29,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:29,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:29,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:33:29,555 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:29,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 208232001, now seen corresponding path program 3 times [2025-04-13 22:33:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:29,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586631566] [2025-04-13 22:33:29,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:29,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:29,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:29,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:29,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:29,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586631566] [2025-04-13 22:33:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586631566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:29,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:29,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526148734] [2025-04-13 22:33:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:29,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:29,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:29,758 INFO L87 Difference]: Start difference. First operand 506 states and 1765 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:29,961 INFO L93 Difference]: Finished difference Result 1154 states and 4084 transitions. [2025-04-13 22:33:29,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:29,961 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:29,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:29,966 INFO L225 Difference]: With dead ends: 1154 [2025-04-13 22:33:29,967 INFO L226 Difference]: Without dead ends: 690 [2025-04-13 22:33:29,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:33:29,969 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 98 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:29,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 17 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-04-13 22:33:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-04-13 22:33:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 3.447024673439768) internal successors, (2375), 689 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2375 transitions. [2025-04-13 22:33:30,015 INFO L79 Accepts]: Start accepts. Automaton has 690 states and 2375 transitions. Word has length 20 [2025-04-13 22:33:30,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:30,015 INFO L485 AbstractCegarLoop]: Abstraction has 690 states and 2375 transitions. [2025-04-13 22:33:30,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,015 INFO L278 IsEmpty]: Start isEmpty. Operand 690 states and 2375 transitions. [2025-04-13 22:33:30,017 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:33:30,017 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:30,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:30,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:33:30,017 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:30,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1113424362, now seen corresponding path program 1 times [2025-04-13 22:33:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:30,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335533695] [2025-04-13 22:33:30,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:30,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 22:33:30,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:33:30,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:30,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:30,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335533695] [2025-04-13 22:33:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335533695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:30,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:33:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106318062] [2025-04-13 22:33:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:30,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:30,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:30,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:30,071 INFO L87 Difference]: Start difference. First operand 690 states and 2375 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:30,171 INFO L93 Difference]: Finished difference Result 1376 states and 4831 transitions. [2025-04-13 22:33:30,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:30,171 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:33:30,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:30,177 INFO L225 Difference]: With dead ends: 1376 [2025-04-13 22:33:30,177 INFO L226 Difference]: Without dead ends: 926 [2025-04-13 22:33:30,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:30,178 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:30,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:33:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-04-13 22:33:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 800. [2025-04-13 22:33:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.458072590738423) internal successors, (2763), 799 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2763 transitions. [2025-04-13 22:33:30,266 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2763 transitions. Word has length 23 [2025-04-13 22:33:30,266 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:30,267 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2763 transitions. [2025-04-13 22:33:30,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,267 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2763 transitions. [2025-04-13 22:33:30,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 22:33:30,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:30,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:30,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:33:30,270 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:30,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1284084478, now seen corresponding path program 1 times [2025-04-13 22:33:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:30,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334895145] [2025-04-13 22:33:30,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:30,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 22:33:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 22:33:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:30,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334895145] [2025-04-13 22:33:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334895145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:33:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664395652] [2025-04-13 22:33:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:30,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:30,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:30,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:30,317 INFO L87 Difference]: Start difference. First operand 800 states and 2763 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:30,478 INFO L93 Difference]: Finished difference Result 1556 states and 5502 transitions. [2025-04-13 22:33:30,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:30,478 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 22:33:30,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:30,485 INFO L225 Difference]: With dead ends: 1556 [2025-04-13 22:33:30,485 INFO L226 Difference]: Without dead ends: 1040 [2025-04-13 22:33:30,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:30,487 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:30,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-04-13 22:33:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 918. [2025-04-13 22:33:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.4645583424209376) internal successors, (3177), 917 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 3177 transitions. [2025-04-13 22:33:30,579 INFO L79 Accepts]: Start accepts. Automaton has 918 states and 3177 transitions. Word has length 23 [2025-04-13 22:33:30,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:30,579 INFO L485 AbstractCegarLoop]: Abstraction has 918 states and 3177 transitions. [2025-04-13 22:33:30,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:30,579 INFO L278 IsEmpty]: Start isEmpty. Operand 918 states and 3177 transitions. [2025-04-13 22:33:30,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:33:30,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:30,582 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:30,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:33:30,582 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:30,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -363793497, now seen corresponding path program 1 times [2025-04-13 22:33:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:30,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667730946] [2025-04-13 22:33:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:30,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:33:30,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:33:30,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:30,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:30,759 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 22:33:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:30,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667730946] [2025-04-13 22:33:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667730946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:30,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343421445] [2025-04-13 22:33:30,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:30,762 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 22:33:30,764 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 22:33:30,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:33:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:33:30,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:30,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:33:30,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:30,963 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 22:33:30,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:31,107 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 22:33:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343421445] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:31,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 14 [2025-04-13 22:33:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829943251] [2025-04-13 22:33:31,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:31,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:33:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:31,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:33:31,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:33:31,108 INFO L87 Difference]: Start difference. First operand 918 states and 3177 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 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 22:33:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:32,107 INFO L93 Difference]: Finished difference Result 3458 states and 12136 transitions. [2025-04-13 22:33:32,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:33:32,107 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 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 26 [2025-04-13 22:33:32,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:32,122 INFO L225 Difference]: With dead ends: 3458 [2025-04-13 22:33:32,122 INFO L226 Difference]: Without dead ends: 2614 [2025-04-13 22:33:32,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=1099, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:33:32,128 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 417 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:32,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 114 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:33:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2025-04-13 22:33:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 1122. [2025-04-13 22:33:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 3.4513826940231938) internal successors, (3869), 1121 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 3869 transitions. [2025-04-13 22:33:32,215 INFO L79 Accepts]: Start accepts. Automaton has 1122 states and 3869 transitions. Word has length 26 [2025-04-13 22:33:32,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:32,215 INFO L485 AbstractCegarLoop]: Abstraction has 1122 states and 3869 transitions. [2025-04-13 22:33:32,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 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 22:33:32,215 INFO L278 IsEmpty]: Start isEmpty. Operand 1122 states and 3869 transitions. [2025-04-13 22:33:32,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:33:32,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:32,218 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:32,224 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 22:33:32,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:33:32,423 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:32,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1552747496, now seen corresponding path program 2 times [2025-04-13 22:33:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:32,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575575829] [2025-04-13 22:33:32,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:32,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:33:32,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:33:32,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:32,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:32,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575575829] [2025-04-13 22:33:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575575829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607508617] [2025-04-13 22:33:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:32,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:32,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:32,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:32,494 INFO L87 Difference]: Start difference. First operand 1122 states and 3869 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:32,715 INFO L93 Difference]: Finished difference Result 2792 states and 9782 transitions. [2025-04-13 22:33:32,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:33:32,716 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:33:32,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:32,729 INFO L225 Difference]: With dead ends: 2792 [2025-04-13 22:33:32,729 INFO L226 Difference]: Without dead ends: 2050 [2025-04-13 22:33:32,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:32,732 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:32,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-04-13 22:33:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1714. [2025-04-13 22:33:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 3.489200233508465) internal successors, (5977), 1713 states have internal predecessors, (5977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 5977 transitions. [2025-04-13 22:33:32,862 INFO L79 Accepts]: Start accepts. Automaton has 1714 states and 5977 transitions. Word has length 29 [2025-04-13 22:33:32,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:32,863 INFO L485 AbstractCegarLoop]: Abstraction has 1714 states and 5977 transitions. [2025-04-13 22:33:32,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:32,863 INFO L278 IsEmpty]: Start isEmpty. Operand 1714 states and 5977 transitions. [2025-04-13 22:33:32,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:33:32,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:32,868 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:32,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:33:32,868 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:32,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -988640818, now seen corresponding path program 1 times [2025-04-13 22:33:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:32,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950551553] [2025-04-13 22:33:32,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:32,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:33:32,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:33:32,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950551553] [2025-04-13 22:33:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950551553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368739640] [2025-04-13 22:33:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:32,929 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 22:33:32,931 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 22:33:32,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:33:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:33:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:32,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:32,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 22:33:32,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:33,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368739640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:33,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-04-13 22:33:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608684190] [2025-04-13 22:33:33,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:33,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:33,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:33,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:33,047 INFO L87 Difference]: Start difference. First operand 1714 states and 5977 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:33,408 INFO L93 Difference]: Finished difference Result 4924 states and 17568 transitions. [2025-04-13 22:33:33,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:33:33,408 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:33:33,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:33,431 INFO L225 Difference]: With dead ends: 4924 [2025-04-13 22:33:33,431 INFO L226 Difference]: Without dead ends: 3548 [2025-04-13 22:33:33,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:33,435 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:33,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-04-13 22:33:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3038. [2025-04-13 22:33:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 3037 states have (on average 3.5512018439249258) internal successors, (10785), 3037 states have internal predecessors, (10785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 10785 transitions. [2025-04-13 22:33:33,660 INFO L79 Accepts]: Start accepts. Automaton has 3038 states and 10785 transitions. Word has length 29 [2025-04-13 22:33:33,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:33,660 INFO L485 AbstractCegarLoop]: Abstraction has 3038 states and 10785 transitions. [2025-04-13 22:33:33,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:33,661 INFO L278 IsEmpty]: Start isEmpty. Operand 3038 states and 10785 transitions. [2025-04-13 22:33:33,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:33:33,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:33,669 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:33,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:33,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 22:33:33,873 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:33,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1247520793, now seen corresponding path program 3 times [2025-04-13 22:33:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:33,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401286998] [2025-04-13 22:33:33,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:33,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 22:33:33,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:33:33,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:33:33,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:33:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:34,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401286998] [2025-04-13 22:33:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401286998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:34,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803288002] [2025-04-13 22:33:34,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:34,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:34,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:34,056 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 22:33:34,057 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 22:33:34,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-04-13 22:33:34,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:33:34,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:33:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:34,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:33:34,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:34,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803288002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:34,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 22 [2025-04-13 22:33:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65038856] [2025-04-13 22:33:34,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:34,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:33:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:34,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:33:34,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:33:34,434 INFO L87 Difference]: Start difference. First operand 3038 states and 10785 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:36,165 INFO L93 Difference]: Finished difference Result 12236 states and 43889 transitions. [2025-04-13 22:33:36,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:33:36,165 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 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 32 [2025-04-13 22:33:36,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:36,210 INFO L225 Difference]: With dead ends: 12236 [2025-04-13 22:33:36,211 INFO L226 Difference]: Without dead ends: 9676 [2025-04-13 22:33:36,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=574, Invalid=1876, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:33:36,217 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 608 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:36,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 167 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:33:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9676 states. [2025-04-13 22:33:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9676 to 2946. [2025-04-13 22:33:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2945 states have (on average 3.4835314091680813) internal successors, (10259), 2945 states have internal predecessors, (10259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 10259 transitions. [2025-04-13 22:33:36,496 INFO L79 Accepts]: Start accepts. Automaton has 2946 states and 10259 transitions. Word has length 32 [2025-04-13 22:33:36,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:36,496 INFO L485 AbstractCegarLoop]: Abstraction has 2946 states and 10259 transitions. [2025-04-13 22:33:36,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:36,496 INFO L278 IsEmpty]: Start isEmpty. Operand 2946 states and 10259 transitions. [2025-04-13 22:33:36,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:33:36,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:36,503 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:36,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:36,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:36,707 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:36,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1712570456, now seen corresponding path program 4 times [2025-04-13 22:33:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:36,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741476535] [2025-04-13 22:33:36,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:36,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:33:36,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:33:36,725 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:33:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:33:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:36,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741476535] [2025-04-13 22:33:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741476535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:36,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802489684] [2025-04-13 22:33:36,781 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:36,783 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 22:33:36,785 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 22:33:36,820 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:33:36,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:33:36,837 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:33:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:36,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 22:33:36,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:33:36,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:33:36,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802489684] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:36,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:36,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-04-13 22:33:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107000570] [2025-04-13 22:33:36,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:36,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:36,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:36,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:36,890 INFO L87 Difference]: Start difference. First operand 2946 states and 10259 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:37,422 INFO L93 Difference]: Finished difference Result 7898 states and 27965 transitions. [2025-04-13 22:33:37,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:37,423 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:33:37,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:37,448 INFO L225 Difference]: With dead ends: 7898 [2025-04-13 22:33:37,448 INFO L226 Difference]: Without dead ends: 6230 [2025-04-13 22:33:37,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:37,452 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 86 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:37,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2025-04-13 22:33:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 4672. [2025-04-13 22:33:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 4671 states have (on average 3.557910511667737) internal successors, (16619), 4671 states have internal predecessors, (16619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 16619 transitions. [2025-04-13 22:33:37,898 INFO L79 Accepts]: Start accepts. Automaton has 4672 states and 16619 transitions. Word has length 35 [2025-04-13 22:33:37,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:37,898 INFO L485 AbstractCegarLoop]: Abstraction has 4672 states and 16619 transitions. [2025-04-13 22:33:37,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:37,898 INFO L278 IsEmpty]: Start isEmpty. Operand 4672 states and 16619 transitions. [2025-04-13 22:33:37,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:33:37,907 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:37,907 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:37,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:38,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:38,113 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:38,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1026845292, now seen corresponding path program 2 times [2025-04-13 22:33:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:38,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677801157] [2025-04-13 22:33:38,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:38,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:33:38,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:33:38,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:38,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:38,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677801157] [2025-04-13 22:33:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677801157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:38,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244597152] [2025-04-13 22:33:38,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:38,189 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 22:33:38,191 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 22:33:38,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:33:38,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:33:38,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:38,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:38,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 22:33:38,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:33:38,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:38,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244597152] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:38,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-04-13 22:33:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792134621] [2025-04-13 22:33:38,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:38,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:38,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:38,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:38,306 INFO L87 Difference]: Start difference. First operand 4672 states and 16619 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:39,009 INFO L93 Difference]: Finished difference Result 11474 states and 41209 transitions. [2025-04-13 22:33:39,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:39,010 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 35 [2025-04-13 22:33:39,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:39,042 INFO L225 Difference]: With dead ends: 11474 [2025-04-13 22:33:39,043 INFO L226 Difference]: Without dead ends: 9226 [2025-04-13 22:33:39,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:39,048 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 102 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:39,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 16 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9226 states. [2025-04-13 22:33:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9226 to 6406. [2025-04-13 22:33:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 6405 states have (on average 3.5837626854020295) internal successors, (22954), 6405 states have internal predecessors, (22954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 22954 transitions. [2025-04-13 22:33:39,690 INFO L79 Accepts]: Start accepts. Automaton has 6406 states and 22954 transitions. Word has length 35 [2025-04-13 22:33:39,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:39,690 INFO L485 AbstractCegarLoop]: Abstraction has 6406 states and 22954 transitions. [2025-04-13 22:33:39,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:39,691 INFO L278 IsEmpty]: Start isEmpty. Operand 6406 states and 22954 transitions. [2025-04-13 22:33:39,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:33:39,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:39,703 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:39,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:33:39,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 22:33:39,904 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:39,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1435217817, now seen corresponding path program 5 times [2025-04-13 22:33:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:39,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610255796] [2025-04-13 22:33:39,905 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:39,911 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 22:33:39,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:33:39,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:33:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:33:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:40,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610255796] [2025-04-13 22:33:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610255796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:40,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243377815] [2025-04-13 22:33:40,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:40,107 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 22:33:40,108 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 22:33:40,145 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 22:33:40,166 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:33:40,166 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:33:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:40,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:33:40,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:40,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243377815] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:40,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:40,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 24 [2025-04-13 22:33:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980693459] [2025-04-13 22:33:40,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:40,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:33:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:40,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:33:40,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:33:40,539 INFO L87 Difference]: Start difference. First operand 6406 states and 22954 transitions. Second operand has 25 states, 25 states have (on average 3.36) internal successors, (84), 24 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:45,690 INFO L93 Difference]: Finished difference Result 37228 states and 137314 transitions. [2025-04-13 22:33:45,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 22:33:45,691 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.36) internal successors, (84), 24 states have internal predecessors, (84), 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 38 [2025-04-13 22:33:45,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:45,892 INFO L225 Difference]: With dead ends: 37228 [2025-04-13 22:33:45,892 INFO L226 Difference]: Without dead ends: 29612 [2025-04-13 22:33:45,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1961, Invalid=7741, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 22:33:45,909 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 832 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:45,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 268 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:33:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29612 states. [2025-04-13 22:33:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29612 to 6888. [2025-04-13 22:33:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6887 states have (on average 3.571656744591259) internal successors, (24598), 6887 states have internal predecessors, (24598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 24598 transitions. [2025-04-13 22:33:46,584 INFO L79 Accepts]: Start accepts. Automaton has 6888 states and 24598 transitions. Word has length 38 [2025-04-13 22:33:46,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:46,584 INFO L485 AbstractCegarLoop]: Abstraction has 6888 states and 24598 transitions. [2025-04-13 22:33:46,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.36) internal successors, (84), 24 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:46,584 INFO L278 IsEmpty]: Start isEmpty. Operand 6888 states and 24598 transitions. [2025-04-13 22:33:46,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:33:46,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:46,595 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:46,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:33:46,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:46,799 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:46,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1347193048, now seen corresponding path program 6 times [2025-04-13 22:33:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:46,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577630341] [2025-04-13 22:33:46,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:46,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 5 equivalence classes. [2025-04-13 22:33:46,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:33:46,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 22:33:46,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:33:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:46,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577630341] [2025-04-13 22:33:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577630341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:46,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526489938] [2025-04-13 22:33:46,902 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:46,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:46,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:46,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:33:46,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:33:46,943 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 5 equivalence classes. [2025-04-13 22:33:46,965 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:33:46,965 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 22:33:46,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:33:46,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:33:46,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:33:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526489938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:47,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 6 [2025-04-13 22:33:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392554722] [2025-04-13 22:33:47,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:47,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:33:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:33:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:33:47,031 INFO L87 Difference]: Start difference. First operand 6888 states and 24598 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:48,448 INFO L93 Difference]: Finished difference Result 16442 states and 58872 transitions. [2025-04-13 22:33:48,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:48,449 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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 41 [2025-04-13 22:33:48,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:48,502 INFO L225 Difference]: With dead ends: 16442 [2025-04-13 22:33:48,503 INFO L226 Difference]: Without dead ends: 13796 [2025-04-13 22:33:48,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:33:48,513 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 106 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:48,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 21 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13796 states. [2025-04-13 22:33:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13796 to 8956. [2025-04-13 22:33:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8956 states, 8955 states have (on average 3.5828029034059186) internal successors, (32084), 8955 states have internal predecessors, (32084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8956 states to 8956 states and 32084 transitions. [2025-04-13 22:33:49,555 INFO L79 Accepts]: Start accepts. Automaton has 8956 states and 32084 transitions. Word has length 41 [2025-04-13 22:33:49,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:49,556 INFO L485 AbstractCegarLoop]: Abstraction has 8956 states and 32084 transitions. [2025-04-13 22:33:49,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:49,556 INFO L278 IsEmpty]: Start isEmpty. Operand 8956 states and 32084 transitions. [2025-04-13 22:33:49,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:33:49,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:49,571 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:49,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:49,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:49,772 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:49,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -576767292, now seen corresponding path program 3 times [2025-04-13 22:33:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:49,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298604393] [2025-04-13 22:33:49,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:49,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 5 equivalence classes. [2025-04-13 22:33:49,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:33:49,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:33:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:49,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298604393] [2025-04-13 22:33:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298604393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:49,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443776844] [2025-04-13 22:33:49,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:49,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:33:49,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:33:49,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 5 equivalence classes. [2025-04-13 22:33:49,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:33:49,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:33:49,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:49,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:33:49,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:49,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443776844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:50,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 6 [2025-04-13 22:33:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711691826] [2025-04-13 22:33:50,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:50,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:33:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:50,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:33:50,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:33:50,049 INFO L87 Difference]: Start difference. First operand 8956 states and 32084 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:51,819 INFO L93 Difference]: Finished difference Result 21264 states and 76531 transitions. [2025-04-13 22:33:51,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:51,819 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 41 [2025-04-13 22:33:51,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:51,881 INFO L225 Difference]: With dead ends: 21264 [2025-04-13 22:33:51,881 INFO L226 Difference]: Without dead ends: 17928 [2025-04-13 22:33:51,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:33:51,889 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:51,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 20 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2025-04-13 22:33:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 11600. [2025-04-13 22:33:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11600 states, 11599 states have (on average 3.594878868868006) internal successors, (41697), 11599 states have internal predecessors, (41697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11600 states to 11600 states and 41697 transitions. [2025-04-13 22:33:52,972 INFO L79 Accepts]: Start accepts. Automaton has 11600 states and 41697 transitions. Word has length 41 [2025-04-13 22:33:52,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:52,972 INFO L485 AbstractCegarLoop]: Abstraction has 11600 states and 41697 transitions. [2025-04-13 22:33:52,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:52,972 INFO L278 IsEmpty]: Start isEmpty. Operand 11600 states and 41697 transitions. [2025-04-13 22:33:52,988 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:33:52,988 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:52,988 INFO L218 NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:52,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:33:53,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 22:33:53,190 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:53,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash 364231847, now seen corresponding path program 7 times [2025-04-13 22:33:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:53,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137536532] [2025-04-13 22:33:53,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:33:53,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:33:53,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:33:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:53,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137536532] [2025-04-13 22:33:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137536532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:53,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847790790] [2025-04-13 22:33:53,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:53,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:53,418 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:33:53,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:33:53,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:33:53,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:33:53,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:53,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:53,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:33:53,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:33:53,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:33:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847790790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:53,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:53,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 17 [2025-04-13 22:33:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589382642] [2025-04-13 22:33:53,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:53,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:33:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:53,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:33:53,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:33:53,669 INFO L87 Difference]: Start difference. First operand 11600 states and 41697 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,874 INFO L93 Difference]: Finished difference Result 45156 states and 169454 transitions. [2025-04-13 22:34:00,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:34:00,874 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 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 44 [2025-04-13 22:34:00,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:01,004 INFO L225 Difference]: With dead ends: 45156 [2025-04-13 22:34:01,004 INFO L226 Difference]: Without dead ends: 35228 [2025-04-13 22:34:01,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 74 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=803, Invalid=2389, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:34:01,025 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 586 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:01,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 217 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:34:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35228 states. [2025-04-13 22:34:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35228 to 12184. [2025-04-13 22:34:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12184 states, 12183 states have (on average 3.586555035705491) internal successors, (43695), 12183 states have internal predecessors, (43695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12184 states to 12184 states and 43695 transitions. [2025-04-13 22:34:02,394 INFO L79 Accepts]: Start accepts. Automaton has 12184 states and 43695 transitions. Word has length 44 [2025-04-13 22:34:02,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:02,394 INFO L485 AbstractCegarLoop]: Abstraction has 12184 states and 43695 transitions. [2025-04-13 22:34:02,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:02,395 INFO L278 IsEmpty]: Start isEmpty. Operand 12184 states and 43695 transitions. [2025-04-13 22:34:02,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:34:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:02,412 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:02,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:34:02,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:34:02,613 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:02,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 570925800, now seen corresponding path program 8 times [2025-04-13 22:34:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:02,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334332137] [2025-04-13 22:34:02,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:02,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:34:02,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:34:02,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:34:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:02,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334332137] [2025-04-13 22:34:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334332137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:02,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955557257] [2025-04-13 22:34:02,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:02,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 22:34:02,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:34:02,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:34:02,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:02,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:34:02,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:34:02,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:34:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955557257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:02,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 7 [2025-04-13 22:34:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227459365] [2025-04-13 22:34:02,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:02,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:34:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:02,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:34:02,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:02,856 INFO L87 Difference]: Start difference. First operand 12184 states and 43695 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:05,501 INFO L93 Difference]: Finished difference Result 28466 states and 102129 transitions. [2025-04-13 22:34:05,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:05,502 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 47 [2025-04-13 22:34:05,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:05,600 INFO L225 Difference]: With dead ends: 28466 [2025-04-13 22:34:05,600 INFO L226 Difference]: Without dead ends: 24626 [2025-04-13 22:34:05,615 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:05,616 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 169 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:05,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 23 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24626 states. [2025-04-13 22:34:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24626 to 15258. [2025-04-13 22:34:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15258 states, 15257 states have (on average 3.5914662122304515) internal successors, (54795), 15257 states have internal predecessors, (54795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15258 states to 15258 states and 54795 transitions. [2025-04-13 22:34:07,237 INFO L79 Accepts]: Start accepts. Automaton has 15258 states and 54795 transitions. Word has length 47 [2025-04-13 22:34:07,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:07,237 INFO L485 AbstractCegarLoop]: Abstraction has 15258 states and 54795 transitions. [2025-04-13 22:34:07,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:07,237 INFO L278 IsEmpty]: Start isEmpty. Operand 15258 states and 54795 transitions. [2025-04-13 22:34:07,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:34:07,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:07,257 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:07,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:34:07,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:34:07,457 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:07,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1815185708, now seen corresponding path program 4 times [2025-04-13 22:34:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:07,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698424757] [2025-04-13 22:34:07,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:07,463 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:34:07,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:34:07,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:07,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:34:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:07,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698424757] [2025-04-13 22:34:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698424757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:07,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030803458] [2025-04-13 22:34:07,545 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:07,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:07,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:07,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 22:34:07,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:34:07,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:34:07,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:07,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:07,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:34:07,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:34:07,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:34:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030803458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:07,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 7 [2025-04-13 22:34:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757820610] [2025-04-13 22:34:07,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:07,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:34:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:07,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:34:07,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:07,703 INFO L87 Difference]: Start difference. First operand 15258 states and 54795 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:11,170 INFO L93 Difference]: Finished difference Result 35370 states and 127301 transitions. [2025-04-13 22:34:11,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:11,171 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 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 47 [2025-04-13 22:34:11,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:11,284 INFO L225 Difference]: With dead ends: 35370 [2025-04-13 22:34:11,284 INFO L226 Difference]: Without dead ends: 30730 [2025-04-13 22:34:11,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:11,299 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 235 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:11,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 19 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30730 states. [2025-04-13 22:34:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30730 to 19004. [2025-04-13 22:34:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19004 states, 19003 states have (on average 3.597221491343472) internal successors, (68358), 19003 states have internal predecessors, (68358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19004 states to 19004 states and 68358 transitions. [2025-04-13 22:34:13,412 INFO L79 Accepts]: Start accepts. Automaton has 19004 states and 68358 transitions. Word has length 47 [2025-04-13 22:34:13,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:13,412 INFO L485 AbstractCegarLoop]: Abstraction has 19004 states and 68358 transitions. [2025-04-13 22:34:13,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:13,412 INFO L278 IsEmpty]: Start isEmpty. Operand 19004 states and 68358 transitions. [2025-04-13 22:34:13,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 22:34:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:13,436 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:13,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 22:34:13,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 22:34:13,637 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:13,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -893809369, now seen corresponding path program 9 times [2025-04-13 22:34:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:13,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248264395] [2025-04-13 22:34:13,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:13,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 6 equivalence classes. [2025-04-13 22:34:13,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:34:13,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 22:34:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:34:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:13,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248264395] [2025-04-13 22:34:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248264395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:13,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229604244] [2025-04-13 22:34:13,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:13,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:13,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 22:34:13,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 6 equivalence classes. [2025-04-13 22:34:13,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 22:34:13,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 22:34:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:13,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:34:13,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 33 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:34:14,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:34:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229604244] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:14,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 31 [2025-04-13 22:34:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495844423] [2025-04-13 22:34:14,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:14,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:34:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:34:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:14,371 INFO L87 Difference]: Start difference. First operand 19004 states and 68358 transitions. Second operand has 32 states, 32 states have (on average 3.375) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:35,556 INFO L93 Difference]: Finished difference Result 105072 states and 399743 transitions. [2025-04-13 22:34:35,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 22:34:35,557 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 31 states have internal predecessors, (108), 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 22:34:35,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:35,975 INFO L225 Difference]: With dead ends: 105072 [2025-04-13 22:34:35,975 INFO L226 Difference]: Without dead ends: 87754 [2025-04-13 22:34:36,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4078 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2196, Invalid=8310, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 22:34:36,020 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 1106 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 3203 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:36,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 359 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3203 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:34:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87754 states. [2025-04-13 22:34:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87754 to 19690. [2025-04-13 22:34:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19690 states, 19689 states have (on average 3.5913454213012344) internal successors, (70710), 19689 states have internal predecessors, (70710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19690 states to 19690 states and 70710 transitions. [2025-04-13 22:34:39,007 INFO L79 Accepts]: Start accepts. Automaton has 19690 states and 70710 transitions. Word has length 50 [2025-04-13 22:34:39,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:39,007 INFO L485 AbstractCegarLoop]: Abstraction has 19690 states and 70710 transitions. [2025-04-13 22:34:39,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,007 INFO L278 IsEmpty]: Start isEmpty. Operand 19690 states and 70710 transitions. [2025-04-13 22:34:39,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:34:39,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:39,032 INFO L218 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:39,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:39,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:34:39,232 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:39,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 149684840, now seen corresponding path program 10 times [2025-04-13 22:34:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:39,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957416494] [2025-04-13 22:34:39,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:39,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:34:39,249 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:34:39,249 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 75 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:34:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:39,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957416494] [2025-04-13 22:34:39,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957416494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:39,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712504361] [2025-04-13 22:34:39,335 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:39,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:39,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:39,336 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:39,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:34:39,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:34:39,402 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:34:39,402 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:39,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:34:39,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 75 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:34:39,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 75 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:34:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712504361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:39,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 8 [2025-04-13 22:34:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283386673] [2025-04-13 22:34:39,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:39,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:34:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:39,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:34:39,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:39,496 INFO L87 Difference]: Start difference. First operand 19690 states and 70710 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:44,757 INFO L93 Difference]: Finished difference Result 45210 states and 162240 transitions. [2025-04-13 22:34:44,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:34:44,757 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 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 53 [2025-04-13 22:34:44,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:44,914 INFO L225 Difference]: With dead ends: 45210 [2025-04-13 22:34:44,915 INFO L226 Difference]: Without dead ends: 39960 [2025-04-13 22:34:44,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:44,933 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 190 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:44,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 25 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39960 states. [2025-04-13 22:34:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39960 to 23962. [2025-04-13 22:34:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23962 states, 23961 states have (on average 3.5931722382204416) internal successors, (86096), 23961 states have internal predecessors, (86096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23962 states to 23962 states and 86096 transitions. [2025-04-13 22:34:48,061 INFO L79 Accepts]: Start accepts. Automaton has 23962 states and 86096 transitions. Word has length 53 [2025-04-13 22:34:48,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:48,061 INFO L485 AbstractCegarLoop]: Abstraction has 23962 states and 86096 transitions. [2025-04-13 22:34:48,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:48,061 INFO L278 IsEmpty]: Start isEmpty. Operand 23962 states and 86096 transitions. [2025-04-13 22:34:48,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:34:48,092 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:48,092 INFO L218 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:48,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:34:48,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:48,293 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:48,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash 211053572, now seen corresponding path program 5 times [2025-04-13 22:34:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:48,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657467054] [2025-04-13 22:34:48,294 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:48,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:48,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 7 equivalence classes. [2025-04-13 22:34:48,304 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:34:48,305 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-13 22:34:48,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:34:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:48,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657467054] [2025-04-13 22:34:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657467054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:48,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304166083] [2025-04-13 22:34:48,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:48,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:48,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:48,386 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:48,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:34:48,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 7 equivalence classes. [2025-04-13 22:34:48,453 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:34:48,453 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-13 22:34:48,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:48,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:34:48,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:34:48,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:34:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304166083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:48,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 8 [2025-04-13 22:34:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882195849] [2025-04-13 22:34:48,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:48,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:34:48,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:48,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:34:48,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:48,550 INFO L87 Difference]: Start difference. First operand 23962 states and 86096 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 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 22:34:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:55,161 INFO L93 Difference]: Finished difference Result 54560 states and 196207 transitions. [2025-04-13 22:34:55,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:34:55,161 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 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 53 [2025-04-13 22:34:55,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:55,354 INFO L225 Difference]: With dead ends: 54560 [2025-04-13 22:34:55,354 INFO L226 Difference]: Without dead ends: 48400 [2025-04-13 22:34:55,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:55,373 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 145 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:55,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 28 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48400 states. [2025-04-13 22:34:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48400 to 29002. [2025-04-13 22:34:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29002 states, 29001 states have (on average 3.5957725595669117) internal successors, (104281), 29001 states have internal predecessors, (104281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29002 states to 29002 states and 104281 transitions. [2025-04-13 22:34:59,268 INFO L79 Accepts]: Start accepts. Automaton has 29002 states and 104281 transitions. Word has length 53 [2025-04-13 22:34:59,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:59,268 INFO L485 AbstractCegarLoop]: Abstraction has 29002 states and 104281 transitions. [2025-04-13 22:34:59,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 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 22:34:59,268 INFO L278 IsEmpty]: Start isEmpty. Operand 29002 states and 104281 transitions. [2025-04-13 22:34:59,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:59,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:59,303 INFO L218 NwaCegarLoop]: trace histogram [12, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:59,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:59,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:59,504 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:59,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 531562855, now seen corresponding path program 11 times [2025-04-13 22:34:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:59,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939906055] [2025-04-13 22:34:59,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:59,509 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 7 equivalence classes. [2025-04-13 22:34:59,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:59,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-13 22:34:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 65 proven. 76 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:34:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:59,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939906055] [2025-04-13 22:34:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939906055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:59,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776970961] [2025-04-13 22:34:59,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:59,690 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:59,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:34:59,733 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 7 equivalence classes. [2025-04-13 22:34:59,758 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:59,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-13 22:34:59,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:59,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:59,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 51 proven. 97 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:59,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 68 proven. 80 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776970961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:00,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 17] total 32 [2025-04-13 22:35:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709460465] [2025-04-13 22:35:00,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:00,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:35:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:00,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:35:00,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:00,162 INFO L87 Difference]: Start difference. First operand 29002 states and 104281 transitions. Second operand has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:46,654 INFO L93 Difference]: Finished difference Result 163652 states and 625545 transitions. [2025-04-13 22:35:46,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-13 22:35:46,655 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 states have internal predecessors, (117), 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 56 [2025-04-13 22:35:46,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:47,259 INFO L225 Difference]: With dead ends: 163652 [2025-04-13 22:35:47,259 INFO L226 Difference]: Without dead ends: 136892 [2025-04-13 22:35:47,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4974 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2606, Invalid=9826, Unknown=0, NotChecked=0, Total=12432 [2025-04-13 22:35:47,324 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 1073 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:47,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 413 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:35:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136892 states. [2025-04-13 22:35:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136892 to 29790. [2025-04-13 22:35:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29790 states, 29789 states have (on average 3.591493504313673) internal successors, (106987), 29789 states have internal predecessors, (106987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29790 states to 29790 states and 106987 transitions. [2025-04-13 22:35:52,288 INFO L79 Accepts]: Start accepts. Automaton has 29790 states and 106987 transitions. Word has length 56 [2025-04-13 22:35:52,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:52,288 INFO L485 AbstractCegarLoop]: Abstraction has 29790 states and 106987 transitions. [2025-04-13 22:35:52,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:52,288 INFO L278 IsEmpty]: Start isEmpty. Operand 29790 states and 106987 transitions. [2025-04-13 22:35:52,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-13 22:35:52,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:52,321 INFO L218 NwaCegarLoop]: trace histogram [13, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:52,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 22:35:52,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:52,524 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:52,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -928045528, now seen corresponding path program 12 times [2025-04-13 22:35:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:52,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91698644] [2025-04-13 22:35:52,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:52,529 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-04-13 22:35:52,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:35:52,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-13 22:35:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 65 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:35:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:52,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91698644] [2025-04-13 22:35:52,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91698644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:52,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340539271] [2025-04-13 22:35:52,635 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:52,637 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:35:52,683 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-04-13 22:35:52,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:35:52,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-13 22:35:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:52,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:35:52,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 65 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:35:52,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 65 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:35:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340539271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:52,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 9 [2025-04-13 22:35:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336649786] [2025-04-13 22:35:52,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:52,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:35:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:52,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:35:52,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:35:52,828 INFO L87 Difference]: Start difference. First operand 29790 states and 106987 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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 22:36:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:01,921 INFO L93 Difference]: Finished difference Result 67442 states and 241893 transitions. [2025-04-13 22:36:01,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:01,921 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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 59 [2025-04-13 22:36:01,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:02,167 INFO L225 Difference]: With dead ends: 67442 [2025-04-13 22:36:02,167 INFO L226 Difference]: Without dead ends: 60566 [2025-04-13 22:36:02,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 12 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:36:02,191 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 400 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:02,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 28 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:36:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60566 states. [2025-04-13 22:36:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60566 to 35452. [2025-04-13 22:36:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35452 states, 35451 states have (on average 3.591746354122592) internal successors, (127331), 35451 states have internal predecessors, (127331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35452 states to 35452 states and 127331 transitions. [2025-04-13 22:36:07,286 INFO L79 Accepts]: Start accepts. Automaton has 35452 states and 127331 transitions. Word has length 59 [2025-04-13 22:36:07,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:07,286 INFO L485 AbstractCegarLoop]: Abstraction has 35452 states and 127331 transitions. [2025-04-13 22:36:07,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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 22:36:07,286 INFO L278 IsEmpty]: Start isEmpty. Operand 35452 states and 127331 transitions. [2025-04-13 22:36:07,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-13 22:36:07,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:07,327 INFO L218 NwaCegarLoop]: trace histogram [13, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:07,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:07,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 22:36:07,527 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:07,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1062238228, now seen corresponding path program 6 times [2025-04-13 22:36:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:07,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279131724] [2025-04-13 22:36:07,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:07,534 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-04-13 22:36:07,549 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:36:07,549 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-13 22:36:07,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:36:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:07,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279131724] [2025-04-13 22:36:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279131724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:07,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009869197] [2025-04-13 22:36:07,645 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:07,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:07,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:07,647 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:36:07,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:36:07,689 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-04-13 22:36:07,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:36:07,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-13 22:36:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:36:07,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 77 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:36:07,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:36:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009869197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:07,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 9 [2025-04-13 22:36:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783567645] [2025-04-13 22:36:07,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:07,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:36:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:36:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:36:07,825 INFO L87 Difference]: Start difference. First operand 35452 states and 127331 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:19,128 INFO L93 Difference]: Finished difference Result 79602 states and 285937 transitions. [2025-04-13 22:36:19,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:19,128 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 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 59 [2025-04-13 22:36:19,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:19,418 INFO L225 Difference]: With dead ends: 79602 [2025-04-13 22:36:19,419 INFO L226 Difference]: Without dead ends: 71706 [2025-04-13 22:36:19,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 12 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:36:19,445 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 259 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:19,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 29 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:36:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71706 states. [2025-04-13 22:36:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71706 to 41978. [2025-04-13 22:36:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41978 states, 41977 states have (on average 3.592681706648879) internal successors, (150810), 41977 states have internal predecessors, (150810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41978 states to 41978 states and 150810 transitions. [2025-04-13 22:36:25,926 INFO L79 Accepts]: Start accepts. Automaton has 41978 states and 150810 transitions. Word has length 59 [2025-04-13 22:36:25,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:25,926 INFO L485 AbstractCegarLoop]: Abstraction has 41978 states and 150810 transitions. [2025-04-13 22:36:25,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:25,926 INFO L278 IsEmpty]: Start isEmpty. Operand 41978 states and 150810 transitions. [2025-04-13 22:36:25,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-13 22:36:25,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:25,977 INFO L218 NwaCegarLoop]: trace histogram [14, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:25,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:26,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:26,177 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:26,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1712368103, now seen corresponding path program 13 times [2025-04-13 22:36:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:26,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399689894] [2025-04-13 22:36:26,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:26,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 22:36:26,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 22:36:26,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:26,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 93 proven. 106 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:36:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:26,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399689894] [2025-04-13 22:36:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399689894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:26,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868015230] [2025-04-13 22:36:26,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:26,373 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:36:26,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:36:26,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-13 22:36:26,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-13 22:36:26,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:26,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:26,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:36:26,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 87 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:36:26,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 93 proven. 106 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:36:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868015230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:26,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 20 [2025-04-13 22:36:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057569956] [2025-04-13 22:36:26,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:26,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:36:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:26,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:36:26,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:36:26,666 INFO L87 Difference]: Start difference. First operand 41978 states and 150810 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:32,659 INFO L93 Difference]: Finished difference Result 168696 states and 642498 transitions. [2025-04-13 22:37:32,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 22:37:32,660 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 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 62 [2025-04-13 22:37:32,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:33,474 INFO L225 Difference]: With dead ends: 168696 [2025-04-13 22:37:33,475 INFO L226 Difference]: Without dead ends: 130822 [2025-04-13 22:37:33,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1385, Invalid=4165, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 22:37:33,566 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 730 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:33,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 285 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:37:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130822 states. [2025-04-13 22:37:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130822 to 42868. [2025-04-13 22:37:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42868 states, 42867 states have (on average 3.589474420883197) internal successors, (153870), 42867 states have internal predecessors, (153870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42868 states to 42868 states and 153870 transitions. [2025-04-13 22:37:43,311 INFO L79 Accepts]: Start accepts. Automaton has 42868 states and 153870 transitions. Word has length 62 [2025-04-13 22:37:43,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:43,311 INFO L485 AbstractCegarLoop]: Abstraction has 42868 states and 153870 transitions. [2025-04-13 22:37:43,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:43,315 INFO L278 IsEmpty]: Start isEmpty. Operand 42868 states and 153870 transitions. [2025-04-13 22:37:43,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-13 22:37:43,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:43,486 INFO L218 NwaCegarLoop]: trace histogram [15, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:43,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 22:37:43,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:43,690 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:43,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 658943400, now seen corresponding path program 14 times [2025-04-13 22:37:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:43,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811096418] [2025-04-13 22:37:43,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:43,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-13 22:37:43,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-13 22:37:43,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:43,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 93 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:37:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:44,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811096418] [2025-04-13 22:37:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811096418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:44,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187988907] [2025-04-13 22:37:44,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:44,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:44,327 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:37:44,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 22:37:44,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-13 22:37:44,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-13 22:37:44,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:44,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:37:44,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 93 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:37:44,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 93 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:37:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187988907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:37:44,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:37:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-04-13 22:37:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824348641] [2025-04-13 22:37:44,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:37:44,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:44,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:44,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:44,717 INFO L87 Difference]: Start difference. First operand 42868 states and 153870 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:02,112 INFO L93 Difference]: Finished difference Result 95930 states and 343776 transitions. [2025-04-13 22:38:02,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:38:02,112 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 65 [2025-04-13 22:38:02,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:02,770 INFO L225 Difference]: With dead ends: 95930 [2025-04-13 22:38:02,770 INFO L226 Difference]: Without dead ends: 87212 [2025-04-13 22:38:02,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 14 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:02,817 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 335 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:02,818 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 30 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87212 states. [2025-04-13 22:38:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87212 to 50112. [2025-04-13 22:38:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50112 states, 50111 states have (on average 3.5889126139969267) internal successors, (179844), 50111 states have internal predecessors, (179844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50112 states to 50112 states and 179844 transitions. [2025-04-13 22:38:12,818 INFO L79 Accepts]: Start accepts. Automaton has 50112 states and 179844 transitions. Word has length 65 [2025-04-13 22:38:12,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:12,818 INFO L485 AbstractCegarLoop]: Abstraction has 50112 states and 179844 transitions. [2025-04-13 22:38:12,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:12,819 INFO L278 IsEmpty]: Start isEmpty. Operand 50112 states and 179844 transitions. [2025-04-13 22:38:12,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-13 22:38:12,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:12,890 INFO L218 NwaCegarLoop]: trace histogram [15, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:12,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 22:38:13,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:13,091 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:13,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1403174212, now seen corresponding path program 7 times [2025-04-13 22:38:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:13,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564111134] [2025-04-13 22:38:13,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:13,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-13 22:38:13,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-13 22:38:13,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:13,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 138 proven. 77 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:38:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:13,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564111134] [2025-04-13 22:38:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564111134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:13,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155409437] [2025-04-13 22:38:13,282 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:13,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:13,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:13,286 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:38:13,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 22:38:13,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-13 22:38:13,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-13 22:38:13,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:13,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:13,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:38:13,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 138 proven. 77 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:38:13,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 138 proven. 77 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:38:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155409437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:38:13,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:38:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-04-13 22:38:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303031895] [2025-04-13 22:38:13,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:38:13,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:13,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:13,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:13,573 INFO L87 Difference]: Start difference. First operand 50112 states and 179844 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:35,322 INFO L93 Difference]: Finished difference Result 111264 states and 399179 transitions. [2025-04-13 22:38:35,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:38:35,322 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 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 65 [2025-04-13 22:38:35,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:35,833 INFO L225 Difference]: With dead ends: 111264 [2025-04-13 22:38:35,833 INFO L226 Difference]: Without dead ends: 101416 [2025-04-13 22:38:35,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 14 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:35,876 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 220 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:35,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 34 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101416 states. [2025-04-13 22:38:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101416 to 58316. [2025-04-13 22:38:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58316 states, 58315 states have (on average 3.588939380948298) internal successors, (209289), 58315 states have internal predecessors, (209289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58316 states to 58316 states and 209289 transitions. [2025-04-13 22:38:47,692 INFO L79 Accepts]: Start accepts. Automaton has 58316 states and 209289 transitions. Word has length 65 [2025-04-13 22:38:47,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:47,693 INFO L485 AbstractCegarLoop]: Abstraction has 58316 states and 209289 transitions. [2025-04-13 22:38:47,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:47,693 INFO L278 IsEmpty]: Start isEmpty. Operand 58316 states and 209289 transitions. [2025-04-13 22:38:47,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:38:47,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:47,774 INFO L218 NwaCegarLoop]: trace histogram [16, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 22:38:47,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 22:38:47,979 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:47,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1073732057, now seen corresponding path program 15 times [2025-04-13 22:38:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:47,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106558700] [2025-04-13 22:38:47,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:48,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 9 equivalence classes. [2025-04-13 22:38:48,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:38:48,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-13 22:38:48,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 141 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:38:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:48,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106558700] [2025-04-13 22:38:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106558700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:48,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762567620] [2025-04-13 22:38:48,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:48,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:48,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:48,542 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:38:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 22:38:48,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 9 equivalence classes. [2025-04-13 22:38:48,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:38:48,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-13 22:38:48,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:48,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:38:48,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 119 proven. 148 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:38:48,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 141 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:38:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762567620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:38:49,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:38:49,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 21 [2025-04-13 22:38:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331488720] [2025-04-13 22:38:49,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:38:49,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:38:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:49,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:38:49,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:38:49,094 INFO L87 Difference]: Start difference. First operand 58316 states and 209289 transitions. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:17,747 INFO L93 Difference]: Finished difference Result 214052 states and 824120 transitions. [2025-04-13 22:40:17,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:40:17,747 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 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 68 [2025-04-13 22:40:17,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:18,548 INFO L225 Difference]: With dead ends: 214052 [2025-04-13 22:40:18,549 INFO L226 Difference]: Without dead ends: 159152 [2025-04-13 22:40:18,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 17 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=756, Invalid=2106, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:40:18,658 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 693 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:18,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 320 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:40:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159152 states. [2025-04-13 22:40:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159152 to 59308. [2025-04-13 22:40:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59308 states, 59307 states have (on average 3.5864737720673783) internal successors, (212703), 59307 states have internal predecessors, (212703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59308 states to 59308 states and 212703 transitions. [2025-04-13 22:40:31,050 INFO L79 Accepts]: Start accepts. Automaton has 59308 states and 212703 transitions. Word has length 68 [2025-04-13 22:40:31,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:31,050 INFO L485 AbstractCegarLoop]: Abstraction has 59308 states and 212703 transitions. [2025-04-13 22:40:31,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:31,050 INFO L278 IsEmpty]: Start isEmpty. Operand 59308 states and 212703 transitions. [2025-04-13 22:40:31,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-13 22:40:31,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:31,136 INFO L218 NwaCegarLoop]: trace histogram [17, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:31,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 22:40:31,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:40:31,340 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:40:31,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 192072040, now seen corresponding path program 16 times [2025-04-13 22:40:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:31,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077954828] [2025-04-13 22:40:31,341 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:40:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:31,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-13 22:40:31,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-13 22:40:31,368 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:40:31,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 180 proven. 126 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:40:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:31,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077954828] [2025-04-13 22:40:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077954828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:31,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986562421] [2025-04-13 22:40:31,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:40:31,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:31,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:31,816 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:40:31,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 22:40:31,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-13 22:40:31,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-13 22:40:31,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:40:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:31,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:40:31,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 180 proven. 126 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:40:31,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 180 proven. 126 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:40:32,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986562421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:32,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-04-13 22:40:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349587918] [2025-04-13 22:40:32,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:32,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:40:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:32,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:40:32,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:40:32,200 INFO L87 Difference]: Start difference. First operand 59308 states and 212703 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:56,930 INFO L93 Difference]: Finished difference Result 131442 states and 470577 transitions. [2025-04-13 22:40:56,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:40:56,931 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2025-04-13 22:40:56,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:57,505 INFO L225 Difference]: With dead ends: 131442 [2025-04-13 22:40:57,505 INFO L226 Difference]: Without dead ends: 120666 [2025-04-13 22:40:57,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 132 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:40:57,553 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 357 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:57,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 36 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:40:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120666 states. [2025-04-13 22:41:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120666 to 68326. [2025-04-13 22:41:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68326 states, 68325 states have (on average 3.5854957921697768) internal successors, (244979), 68325 states have internal predecessors, (244979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68326 states to 68326 states and 244979 transitions. [2025-04-13 22:41:10,807 INFO L79 Accepts]: Start accepts. Automaton has 68326 states and 244979 transitions. Word has length 71 [2025-04-13 22:41:10,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:10,808 INFO L485 AbstractCegarLoop]: Abstraction has 68326 states and 244979 transitions. [2025-04-13 22:41:10,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:10,808 INFO L278 IsEmpty]: Start isEmpty. Operand 68326 states and 244979 transitions. [2025-04-13 22:41:10,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-13 22:41:10,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:10,900 INFO L218 NwaCegarLoop]: trace histogram [17, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:10,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 22:41:11,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:41:11,104 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:41:11,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -27158188, now seen corresponding path program 8 times [2025-04-13 22:41:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:11,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755088323] [2025-04-13 22:41:11,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:11,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-04-13 22:41:11,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-13 22:41:11,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:11,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 180 proven. 141 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:41:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:11,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755088323] [2025-04-13 22:41:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755088323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:11,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157411738] [2025-04-13 22:41:11,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:11,505 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:11,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 22:41:11,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-04-13 22:41:11,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-13 22:41:11,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:11,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:41:11,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 180 proven. 142 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:41:11,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 180 proven. 141 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:41:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157411738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:11,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-04-13 22:41:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567802973] [2025-04-13 22:41:11,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:11,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:41:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:11,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:41:11,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:11,797 INFO L87 Difference]: Start difference. First operand 68326 states and 244979 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:43,474 INFO L93 Difference]: Finished difference Result 150314 states and 538621 transitions. [2025-04-13 22:41:43,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:41:43,475 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 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 71 [2025-04-13 22:41:43,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:44,285 INFO L225 Difference]: With dead ends: 150314 [2025-04-13 22:41:44,285 INFO L226 Difference]: Without dead ends: 138298 [2025-04-13 22:41:44,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 132 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:44,378 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 368 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:44,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 33 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:41:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138298 states. [2025-04-13 22:42:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138298 to 78400. [2025-04-13 22:42:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78400 states, 78399 states have (on average 3.585020217094606) internal successors, (281062), 78399 states have internal predecessors, (281062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78400 states to 78400 states and 281062 transitions. [2025-04-13 22:42:00,732 INFO L79 Accepts]: Start accepts. Automaton has 78400 states and 281062 transitions. Word has length 71 [2025-04-13 22:42:00,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:00,733 INFO L485 AbstractCegarLoop]: Abstraction has 78400 states and 281062 transitions. [2025-04-13 22:42:00,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,733 INFO L278 IsEmpty]: Start isEmpty. Operand 78400 states and 281062 transitions. [2025-04-13 22:42:00,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-13 22:42:00,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:00,843 INFO L218 NwaCegarLoop]: trace histogram [18, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:00,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:42:01,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:01,047 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:42:01,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1620466009, now seen corresponding path program 17 times [2025-04-13 22:42:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:01,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440951965] [2025-04-13 22:42:01,048 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:01,054 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 10 equivalence classes. [2025-04-13 22:42:01,064 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 74 of 74 statements. [2025-04-13 22:42:01,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-04-13 22:42:01,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 164 proven. 181 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:42:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:01,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440951965] [2025-04-13 22:42:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440951965] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:01,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454146719] [2025-04-13 22:42:01,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:01,302 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:01,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 22:42:01,897 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 10 equivalence classes. [2025-04-13 22:42:01,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 74 of 74 statements. [2025-04-13 22:42:01,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-04-13 22:42:01,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:01,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:42:01,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:42:02,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 11 proven. 346 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:42:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454146719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:02,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 22] total 53 [2025-04-13 22:42:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139555286] [2025-04-13 22:42:02,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:02,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:42:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:02,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:42:02,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=2158, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:42:02,974 INFO L87 Difference]: Start difference. First operand 78400 states and 281062 transitions. Second operand has 54 states, 54 states have (on average 3.5555555555555554) internal successors, (192), 53 states have internal predecessors, (192), 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) Received shutdown request... [2025-04-13 22:44:58,262 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:44:58,262 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:44:58,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 854 states. [2025-04-13 22:44:58,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454925 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=141634, Invalid=662078, Unknown=0, NotChecked=0, Total=803712 [2025-04-13 22:44:58,319 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 7343 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 11078 mSolverCounterSat, 1309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7343 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 12387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1309 IncrementalHoareTripleChecker+Valid, 11078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:58,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7343 Valid, 1003 Invalid, 12387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1309 Valid, 11078 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-04-13 22:44:58,322 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:44:58,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 22:44:58,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:58,523 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (78400states) and FLOYD_HOARE automaton (currently 854 states, 54 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 897 known predicates. [2025-04-13 22:44:58,526 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:44:58,526 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:44:58,526 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:44:58,534 INFO L422 BasicCegarLoop]: Path program histogram: [17, 8, 3, 1, 1] [2025-04-13 22:44:58,539 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:44:58,539 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:44:58,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:44:58 BasicIcfg [2025-04-13 22:44:58,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:44:58,546 INFO L158 Benchmark]: Toolchain (without parser) took 690934.91ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 98.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 22:44:58,546 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:44:58,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.84ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.8MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:44:58,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.33ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:44:58,547 INFO L158 Benchmark]: Boogie Preprocessor took 35.83ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:44:58,547 INFO L158 Benchmark]: IcfgBuilder took 409.00ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 43.8MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 22:44:58,547 INFO L158 Benchmark]: TraceAbstraction took 690250.94ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 42.9MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 22:44:58,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.84ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.8MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.33ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.83ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 409.00ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 43.8MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 690250.94ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 42.9MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. 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 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (78400states) and FLOYD_HOARE automaton (currently 854 states, 54 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 897 known predicates. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (78400states) and FLOYD_HOARE automaton (currently 854 states, 54 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 897 known predicates. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (78400states) and FLOYD_HOARE automaton (currently 854 states, 54 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 897 known predicates. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (78400states) and FLOYD_HOARE automaton (currently 854 states, 54 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 897 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 690.1s, OverallIterations: 30, TraceHistogramMax: 18, PathProgramHistogramMax: 17, EmptinessCheckTime: 1.0s, AutomataDifference: 560.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16786 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 3590 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3177 mSDsCounter, 1995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32440 IncrementalHoareTripleChecker+Invalid, 34435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1995 mSolverCounterUnsat, 413 mSDtfsCounter, 32440 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3969 GetRequests, 2181 SyntacticMatches, 202 SemanticMatches, 1585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473473 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78400occurred in iteration=29, InterpolantAutomatonStates: 659, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 737550 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 193 NumberOfCheckSat, 3720 ConstructedInterpolants, 0 QuantifiedInterpolants, 12151 SizeOfPredicates, 105 NumberOfNonLiveVariables, 5581 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 78 InterpolantComputations, 6 PerfectInterpolantSequences, 5295/9746 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown