/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:32:58,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:32:58,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:32:58,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:32:58,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:32:58,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:32:58,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:32:58,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:32:58,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:32:58,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:32:58,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:32:58,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:32:58,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:32:58,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:32:58,347 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:32:58,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:32:58,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:32:58,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:32:58,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:32:58,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:32:58,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:32:58,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:32:58,349 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:32:58,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:32:58,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:32:58,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:32:58,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:32:58,551 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:32:58,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-13 22:32:59,808 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0228493b5/1caeffd880eb4fcd9446c66fe7741b16/FLAG45342960c [2025-04-13 22:32:59,990 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:32:59,990 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-13 22:32:59,997 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0228493b5/1caeffd880eb4fcd9446c66fe7741b16/FLAG45342960c [2025-04-13 22:33:01,009 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0228493b5/1caeffd880eb4fcd9446c66fe7741b16 [2025-04-13 22:33:01,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:33:01,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:33:01,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:01,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:33:01,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:33:01,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:01" (1/1) ... [2025-04-13 22:33:01,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c62fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:01, skipping insertion in model container [2025-04-13 22:33:01,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:01" (1/1) ... [2025-04-13 22:33:01,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:33:01,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-04-13 22:33:01,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:01,168 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:33:01,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-04-13 22:33:01,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:01,200 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:33:01,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:01 WrapperNode [2025-04-13 22:33:01,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:01,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:01,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:33:01,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:33:01,208 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:01" (1/1) ... [2025-04-13 22:33:01,214 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:01" (1/1) ... [2025-04-13 22:33:01,226 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-13 22:33:01,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:01,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:33:01,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:33:01,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:33:01,232 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:01" (1/1) ... [2025-04-13 22:33:01,232 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:01" (1/1) ... [2025-04-13 22:33:01,239 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:01" (1/1) ... [2025-04-13 22:33:01,253 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:01,253 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:01" (1/1) ... [2025-04-13 22:33:01,254 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:01" (1/1) ... [2025-04-13 22:33:01,256 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:01" (1/1) ... [2025-04-13 22:33:01,256 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:01" (1/1) ... [2025-04-13 22:33:01,257 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:01" (1/1) ... [2025-04-13 22:33:01,261 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:01" (1/1) ... [2025-04-13 22:33:01,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:33:01,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:33:01,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:33:01,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:33:01,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:01" (1/1) ... [2025-04-13 22:33:01,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:01,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:01,299 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:01,301 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:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:33:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:33:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:33:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:33:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:33:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:33:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:33:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:33:01,320 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:01,386 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:33:01,388 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:33:01,556 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:33:01,556 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:33:01,556 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:33:01,687 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:33:01,696 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:33:01,706 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:33:01,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:01 BoogieIcfgContainer [2025-04-13 22:33:01,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:33:01,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:33:01,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:33:01,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:33:01,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:33:01" (1/3) ... [2025-04-13 22:33:01,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6d0bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:01, skipping insertion in model container [2025-04-13 22:33:01,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:01" (2/3) ... [2025-04-13 22:33:01,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6d0bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:01, skipping insertion in model container [2025-04-13 22:33:01,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:01" (3/3) ... [2025-04-13 22:33:01,712 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-04-13 22:33:01,721 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:33:01,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 23 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 22:33:01,722 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:33:01,761 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:33:01,786 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 32 transitions, 78 flow [2025-04-13 22:33:01,808 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 83 states, 82 states have (on average 3.524390243902439) internal successors, (289), 82 states have internal predecessors, (289), 0 states have call successors, (0), 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:01,827 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:33:01,836 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;@11a708c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:33:01,836 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:33:01,838 INFO L278 IsEmpty]: Start isEmpty. Operand has 83 states, 82 states have (on average 3.524390243902439) internal successors, (289), 82 states have internal predecessors, (289), 0 states have call successors, (0), 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:01,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 22:33:01,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:01,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:01,846 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:01,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1688058764, now seen corresponding path program 1 times [2025-04-13 22:33:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:01,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111227211] [2025-04-13 22:33:01,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:01,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 22:33:01,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 22:33:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:01,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:02,086 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:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:02,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111227211] [2025-04-13 22:33:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111227211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:02,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:33:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808176122] [2025-04-13 22:33:02,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:02,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:02,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:02,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:02,108 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 3.524390243902439) internal successors, (289), 82 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:02,234 INFO L93 Difference]: Finished difference Result 125 states and 393 transitions. [2025-04-13 22:33:02,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:02,235 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 22:33:02,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:02,241 INFO L225 Difference]: With dead ends: 125 [2025-04-13 22:33:02,241 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 22:33:02,243 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:02,245 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:02,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 22:33:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2025-04-13 22:33:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 3.4157303370786516) internal successors, (304), 89 states have internal predecessors, (304), 0 states have call successors, (0), 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:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 304 transitions. [2025-04-13 22:33:02,270 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 304 transitions. Word has length 12 [2025-04-13 22:33:02,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:02,271 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 304 transitions. [2025-04-13 22:33:02,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,271 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 304 transitions. [2025-04-13 22:33:02,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:33:02,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:02,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:02,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:33:02,272 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:02,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1281900817, now seen corresponding path program 1 times [2025-04-13 22:33:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:02,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115819861] [2025-04-13 22:33:02,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:02,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:33:02,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:33:02,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:02,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:02,450 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:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:02,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115819861] [2025-04-13 22:33:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115819861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:02,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313928810] [2025-04-13 22:33:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:02,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:02,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:02,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:02,452 INFO L87 Difference]: Start difference. First operand 90 states and 304 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:02,627 INFO L93 Difference]: Finished difference Result 166 states and 568 transitions. [2025-04-13 22:33:02,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:02,627 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:33:02,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:02,629 INFO L225 Difference]: With dead ends: 166 [2025-04-13 22:33:02,629 INFO L226 Difference]: Without dead ends: 151 [2025-04-13 22:33:02,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:02,630 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:02,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-13 22:33:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 88. [2025-04-13 22:33:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.413793103448276) internal successors, (297), 87 states have internal predecessors, (297), 0 states have call successors, (0), 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:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 297 transitions. [2025-04-13 22:33:02,637 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 297 transitions. Word has length 14 [2025-04-13 22:33:02,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:02,637 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 297 transitions. [2025-04-13 22:33:02,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,638 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 297 transitions. [2025-04-13 22:33:02,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:33:02,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:02,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:02,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:33:02,639 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:02,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1741527017, now seen corresponding path program 1 times [2025-04-13 22:33:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:02,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21394995] [2025-04-13 22:33:02,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:33:02,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:33:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:02,739 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:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:02,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21394995] [2025-04-13 22:33:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21394995] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362123506] [2025-04-13 22:33:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:02,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:02,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:02,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:02,741 INFO L87 Difference]: Start difference. First operand 88 states and 297 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:02,854 INFO L93 Difference]: Finished difference Result 179 states and 587 transitions. [2025-04-13 22:33:02,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:02,854 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:33:02,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:02,856 INFO L225 Difference]: With dead ends: 179 [2025-04-13 22:33:02,856 INFO L226 Difference]: Without dead ends: 165 [2025-04-13 22:33:02,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:02,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:02,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-13 22:33:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 88. [2025-04-13 22:33:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.32183908045977) internal successors, (289), 87 states have internal predecessors, (289), 0 states have call successors, (0), 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:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 289 transitions. [2025-04-13 22:33:02,863 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 289 transitions. Word has length 14 [2025-04-13 22:33:02,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:02,863 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 289 transitions. [2025-04-13 22:33:02,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:02,863 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 289 transitions. [2025-04-13 22:33:02,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:33:02,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:02,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:02,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:33:02,864 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:02,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash 776337511, now seen corresponding path program 2 times [2025-04-13 22:33:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:02,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570628895] [2025-04-13 22:33:02,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:02,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:33:02,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:33:02,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:02,922 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:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:02,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570628895] [2025-04-13 22:33:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570628895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848727709] [2025-04-13 22:33:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:02,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:02,924 INFO L87 Difference]: Start difference. First operand 88 states and 289 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,052 INFO L93 Difference]: Finished difference Result 156 states and 527 transitions. [2025-04-13 22:33:03,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:03,053 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:33:03,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,054 INFO L225 Difference]: With dead ends: 156 [2025-04-13 22:33:03,054 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 22:33:03,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:03,055 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 22:33:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 83. [2025-04-13 22:33:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 3.3536585365853657) internal successors, (275), 82 states have internal predecessors, (275), 0 states have call successors, (0), 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:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 275 transitions. [2025-04-13 22:33:03,067 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 275 transitions. Word has length 14 [2025-04-13 22:33:03,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,068 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 275 transitions. [2025-04-13 22:33:03,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,068 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 275 transitions. [2025-04-13 22:33:03,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:33:03,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:33:03,069 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1056457479, now seen corresponding path program 2 times [2025-04-13 22:33:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329377213] [2025-04-13 22:33:03,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:33:03,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:33:03,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:03,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,127 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:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329377213] [2025-04-13 22:33:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329377213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672441754] [2025-04-13 22:33:03,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:03,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:03,128 INFO L87 Difference]: Start difference. First operand 83 states and 275 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,223 INFO L93 Difference]: Finished difference Result 151 states and 513 transitions. [2025-04-13 22:33:03,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:03,223 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:33:03,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,225 INFO L225 Difference]: With dead ends: 151 [2025-04-13 22:33:03,225 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 22:33:03,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:03,229 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 22:33:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2025-04-13 22:33:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 3.2195121951219514) internal successors, (264), 82 states have internal predecessors, (264), 0 states have call successors, (0), 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:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 264 transitions. [2025-04-13 22:33:03,234 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 264 transitions. Word has length 14 [2025-04-13 22:33:03,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,234 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 264 transitions. [2025-04-13 22:33:03,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,235 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 264 transitions. [2025-04-13 22:33:03,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:33:03,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:33:03,235 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1438517236, now seen corresponding path program 1 times [2025-04-13 22:33:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846225425] [2025-04-13 22:33:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:33:03,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:33:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,372 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:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846225425] [2025-04-13 22:33:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846225425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438485803] [2025-04-13 22:33:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:03,374 INFO L87 Difference]: Start difference. First operand 83 states and 264 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,436 INFO L93 Difference]: Finished difference Result 137 states and 439 transitions. [2025-04-13 22:33:03,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:33:03,436 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:33:03,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,438 INFO L225 Difference]: With dead ends: 137 [2025-04-13 22:33:03,438 INFO L226 Difference]: Without dead ends: 122 [2025-04-13 22:33:03,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:03,438 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-13 22:33:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-13 22:33:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 3.28099173553719) internal successors, (397), 121 states have internal predecessors, (397), 0 states have call successors, (0), 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:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 397 transitions. [2025-04-13 22:33:03,444 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 397 transitions. Word has length 16 [2025-04-13 22:33:03,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,444 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 397 transitions. [2025-04-13 22:33:03,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:03,445 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 397 transitions. [2025-04-13 22:33:03,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:33:03,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,446 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:33:03,446 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1623040535, now seen corresponding path program 1 times [2025-04-13 22:33:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343918736] [2025-04-13 22:33:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:33:03,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:33:03,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343918736] [2025-04-13 22:33:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343918736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024515592] [2025-04-13 22:33:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:03,531 INFO L87 Difference]: Start difference. First operand 122 states and 397 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,579 INFO L93 Difference]: Finished difference Result 202 states and 691 transitions. [2025-04-13 22:33:03,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:03,579 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 22:33:03,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,581 INFO L225 Difference]: With dead ends: 202 [2025-04-13 22:33:03,581 INFO L226 Difference]: Without dead ends: 148 [2025-04-13 22:33:03,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:03,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:33:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-13 22:33:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-04-13 22:33:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.3333333333333335) internal successors, (490), 147 states have internal predecessors, (490), 0 states have call successors, (0), 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:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 490 transitions. [2025-04-13 22:33:03,587 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 490 transitions. Word has length 18 [2025-04-13 22:33:03,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,587 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 490 transitions. [2025-04-13 22:33:03,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:03,587 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 490 transitions. [2025-04-13 22:33:03,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:33:03,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:33:03,588 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2013496019, now seen corresponding path program 1 times [2025-04-13 22:33:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186091776] [2025-04-13 22:33:03,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:33:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:33:03,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186091776] [2025-04-13 22:33:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186091776] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776088534] [2025-04-13 22:33:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:03,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:03,678 INFO L87 Difference]: Start difference. First operand 148 states and 490 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,738 INFO L93 Difference]: Finished difference Result 270 states and 892 transitions. [2025-04-13 22:33:03,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:33:03,738 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 22:33:03,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,740 INFO L225 Difference]: With dead ends: 270 [2025-04-13 22:33:03,740 INFO L226 Difference]: Without dead ends: 236 [2025-04-13 22:33:03,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:03,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-13 22:33:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-13 22:33:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.3276595744680852) internal successors, (782), 235 states have internal predecessors, (782), 0 states have call successors, (0), 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:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 782 transitions. [2025-04-13 22:33:03,757 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 782 transitions. Word has length 18 [2025-04-13 22:33:03,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,757 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 782 transitions. [2025-04-13 22:33:03,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:03,757 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 782 transitions. [2025-04-13 22:33:03,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:03,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,758 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:33:03,758 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -379503312, now seen corresponding path program 1 times [2025-04-13 22:33:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220496833] [2025-04-13 22:33:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:03,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:03,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220496833] [2025-04-13 22:33:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220496833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334571452] [2025-04-13 22:33:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:03,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:03,837 INFO L87 Difference]: Start difference. First operand 236 states and 782 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,893 INFO L93 Difference]: Finished difference Result 358 states and 1184 transitions. [2025-04-13 22:33:03,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:03,894 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:03,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,895 INFO L225 Difference]: With dead ends: 358 [2025-04-13 22:33:03,896 INFO L226 Difference]: Without dead ends: 236 [2025-04-13 22:33:03,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:03,896 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-13 22:33:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-13 22:33:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.1404255319148935) internal successors, (738), 235 states have internal predecessors, (738), 0 states have call successors, (0), 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:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 738 transitions. [2025-04-13 22:33:03,903 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 738 transitions. Word has length 20 [2025-04-13 22:33:03,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,903 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 738 transitions. [2025-04-13 22:33:03,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:03,903 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 738 transitions. [2025-04-13 22:33:03,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:03,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,904 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:03,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:33:03,904 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:03,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2076603693, now seen corresponding path program 1 times [2025-04-13 22:33:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881795293] [2025-04-13 22:33:03,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:03,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:03,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,030 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:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:04,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881795293] [2025-04-13 22:33:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881795293] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:04,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202519941] [2025-04-13 22:33:04,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:04,032 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:04,034 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:04,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:04,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:04,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:04,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:33:04,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:04,154 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:04,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:04,208 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:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202519941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:04,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 22:33:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273178002] [2025-04-13 22:33:04,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:04,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:04,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:04,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:04,209 INFO L87 Difference]: Start difference. First operand 236 states and 738 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:04,329 INFO L93 Difference]: Finished difference Result 392 states and 1158 transitions. [2025-04-13 22:33:04,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:04,330 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:04,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:04,333 INFO L225 Difference]: With dead ends: 392 [2025-04-13 22:33:04,333 INFO L226 Difference]: Without dead ends: 387 [2025-04-13 22:33:04,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:04,333 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:04,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-04-13 22:33:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 305. [2025-04-13 22:33:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.1842105263157894) internal successors, (968), 304 states have internal predecessors, (968), 0 states have call successors, (0), 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:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 968 transitions. [2025-04-13 22:33:04,343 INFO L79 Accepts]: Start accepts. Automaton has 305 states and 968 transitions. Word has length 20 [2025-04-13 22:33:04,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:04,343 INFO L485 AbstractCegarLoop]: Abstraction has 305 states and 968 transitions. [2025-04-13 22:33:04,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:04,343 INFO L278 IsEmpty]: Start isEmpty. Operand 305 states and 968 transitions. [2025-04-13 22:33:04,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:04,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:04,344 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:04,351 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:04,550 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,SelfDestructingSolverStorable9 [2025-04-13 22:33:04,550 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:04,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2111054419, now seen corresponding path program 2 times [2025-04-13 22:33:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:04,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486598858] [2025-04-13 22:33:04,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:04,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:04,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:04,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,739 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:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:04,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486598858] [2025-04-13 22:33:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486598858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:04,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800830600] [2025-04-13 22:33:04,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:04,742 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:04,743 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:04,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:04,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:04,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:33:04,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:04,915 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:04,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:04,974 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:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800830600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:04,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 22:33:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678913092] [2025-04-13 22:33:04,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:04,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:04,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:04,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:04,975 INFO L87 Difference]: Start difference. First operand 305 states and 968 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:05,169 INFO L93 Difference]: Finished difference Result 617 states and 1836 transitions. [2025-04-13 22:33:05,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:05,169 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:05,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:05,172 INFO L225 Difference]: With dead ends: 617 [2025-04-13 22:33:05,172 INFO L226 Difference]: Without dead ends: 612 [2025-04-13 22:33:05,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:05,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:05,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:33:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-04-13 22:33:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 447. [2025-04-13 22:33:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.1502242152466366) internal successors, (1405), 446 states have internal predecessors, (1405), 0 states have call successors, (0), 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:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1405 transitions. [2025-04-13 22:33:05,188 INFO L79 Accepts]: Start accepts. Automaton has 447 states and 1405 transitions. Word has length 20 [2025-04-13 22:33:05,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:05,188 INFO L485 AbstractCegarLoop]: Abstraction has 447 states and 1405 transitions. [2025-04-13 22:33:05,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:05,188 INFO L278 IsEmpty]: Start isEmpty. Operand 447 states and 1405 transitions. [2025-04-13 22:33:05,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:05,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:05,189 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:05,196 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:05,389 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,SelfDestructingSolverStorable10 [2025-04-13 22:33:05,390 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:05,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1400297425, now seen corresponding path program 1 times [2025-04-13 22:33:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:05,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885381735] [2025-04-13 22:33:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:05,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:05,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:05,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:05,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:05,524 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:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:05,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885381735] [2025-04-13 22:33:05,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885381735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:05,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227886690] [2025-04-13 22:33:05,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:05,528 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:05,529 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:05,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:05,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:05,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:33:05,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:05,617 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:05,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:05,665 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:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227886690] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:05,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 22:33:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620493825] [2025-04-13 22:33:05,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:05,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:05,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:05,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:05,666 INFO L87 Difference]: Start difference. First operand 447 states and 1405 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:05,787 INFO L93 Difference]: Finished difference Result 623 states and 1878 transitions. [2025-04-13 22:33:05,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:05,787 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:05,787 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:05,791 INFO L225 Difference]: With dead ends: 623 [2025-04-13 22:33:05,791 INFO L226 Difference]: Without dead ends: 618 [2025-04-13 22:33:05,791 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:05,792 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:05,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-04-13 22:33:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 515. [2025-04-13 22:33:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 3.184824902723735) internal successors, (1637), 514 states have internal predecessors, (1637), 0 states have call successors, (0), 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:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1637 transitions. [2025-04-13 22:33:05,814 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1637 transitions. Word has length 20 [2025-04-13 22:33:05,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:05,815 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1637 transitions. [2025-04-13 22:33:05,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:05,815 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1637 transitions. [2025-04-13 22:33:05,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:05,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:05,816 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:05,825 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:06,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:06,017 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:06,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 839106669, now seen corresponding path program 2 times [2025-04-13 22:33:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:06,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612368067] [2025-04-13 22:33:06,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:06,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:06,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:06,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:06,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:06,161 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:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:06,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612368067] [2025-04-13 22:33:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612368067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:06,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995864032] [2025-04-13 22:33:06,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:06,164 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:06,166 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:06,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:06,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:06,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:06,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:33:06,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:06,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:06,333 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:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995864032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:06,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 22:33:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614790981] [2025-04-13 22:33:06,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:06,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:06,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:06,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:06,335 INFO L87 Difference]: Start difference. First operand 515 states and 1637 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:06,546 INFO L93 Difference]: Finished difference Result 956 states and 2929 transitions. [2025-04-13 22:33:06,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:06,546 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:06,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:06,552 INFO L225 Difference]: With dead ends: 956 [2025-04-13 22:33:06,552 INFO L226 Difference]: Without dead ends: 951 [2025-04-13 22:33:06,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:06,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:06,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:33:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-04-13 22:33:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 643. [2025-04-13 22:33:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.250778816199377) internal successors, (2087), 642 states have internal predecessors, (2087), 0 states have call successors, (0), 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:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2087 transitions. [2025-04-13 22:33:06,578 INFO L79 Accepts]: Start accepts. Automaton has 643 states and 2087 transitions. Word has length 20 [2025-04-13 22:33:06,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:06,578 INFO L485 AbstractCegarLoop]: Abstraction has 643 states and 2087 transitions. [2025-04-13 22:33:06,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:06,579 INFO L278 IsEmpty]: Start isEmpty. Operand 643 states and 2087 transitions. [2025-04-13 22:33:06,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:06,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:06,581 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:06,587 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:06,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:06,785 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:06,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1429939470, now seen corresponding path program 1 times [2025-04-13 22:33:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:06,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989404580] [2025-04-13 22:33:06,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:06,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:06,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:06,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:06,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989404580] [2025-04-13 22:33:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989404580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:06,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:06,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040449650] [2025-04-13 22:33:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:06,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:06,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:06,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:06,845 INFO L87 Difference]: Start difference. First operand 643 states and 2087 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:06,894 INFO L93 Difference]: Finished difference Result 878 states and 2802 transitions. [2025-04-13 22:33:06,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:06,894 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:06,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:06,897 INFO L225 Difference]: With dead ends: 878 [2025-04-13 22:33:06,897 INFO L226 Difference]: Without dead ends: 541 [2025-04-13 22:33:06,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:06,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:06,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:33:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-04-13 22:33:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 503. [2025-04-13 22:33:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 3.095617529880478) internal successors, (1554), 502 states have internal predecessors, (1554), 0 states have call successors, (0), 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:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1554 transitions. [2025-04-13 22:33:06,911 INFO L79 Accepts]: Start accepts. Automaton has 503 states and 1554 transitions. Word has length 20 [2025-04-13 22:33:06,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:06,911 INFO L485 AbstractCegarLoop]: Abstraction has 503 states and 1554 transitions. [2025-04-13 22:33:06,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:06,912 INFO L278 IsEmpty]: Start isEmpty. Operand 503 states and 1554 transitions. [2025-04-13 22:33:06,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:06,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:06,913 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:06,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:33:06,913 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:06,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 542882577, now seen corresponding path program 1 times [2025-04-13 22:33:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:06,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126427584] [2025-04-13 22:33:06,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:06,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:06,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:06,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:07,041 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:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:07,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126427584] [2025-04-13 22:33:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126427584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:07,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075251224] [2025-04-13 22:33:07,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:07,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:07,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:07,043 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:07,044 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:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:07,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:07,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:07,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:33:07,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:07,133 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:07,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:07,182 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:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075251224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:07,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 22:33:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589066714] [2025-04-13 22:33:07,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:07,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:07,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:07,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:07,183 INFO L87 Difference]: Start difference. First operand 503 states and 1554 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:07,298 INFO L93 Difference]: Finished difference Result 656 states and 1941 transitions. [2025-04-13 22:33:07,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:07,298 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:07,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:07,301 INFO L225 Difference]: With dead ends: 656 [2025-04-13 22:33:07,301 INFO L226 Difference]: Without dead ends: 651 [2025-04-13 22:33:07,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:07,302 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:07,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-04-13 22:33:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 576. [2025-04-13 22:33:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.102608695652174) internal successors, (1784), 575 states have internal predecessors, (1784), 0 states have call successors, (0), 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:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1784 transitions. [2025-04-13 22:33:07,316 INFO L79 Accepts]: Start accepts. Automaton has 576 states and 1784 transitions. Word has length 20 [2025-04-13 22:33:07,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:07,316 INFO L485 AbstractCegarLoop]: Abstraction has 576 states and 1784 transitions. [2025-04-13 22:33:07,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:07,316 INFO L278 IsEmpty]: Start isEmpty. Operand 576 states and 1784 transitions. [2025-04-13 22:33:07,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:07,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:07,317 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:07,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:07,521 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,SelfDestructingSolverStorable14 [2025-04-13 22:33:07,521 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:07,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2053090003, now seen corresponding path program 2 times [2025-04-13 22:33:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:07,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555478273] [2025-04-13 22:33:07,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:07,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:07,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:07,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:07,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:07,616 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:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:07,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555478273] [2025-04-13 22:33:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555478273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:07,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637449694] [2025-04-13 22:33:07,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:07,618 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:07,620 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:07,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:33:07,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:07,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:07,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:07,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:33:07,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:07,717 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:07,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:07,761 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:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637449694] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:07,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 22:33:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863043207] [2025-04-13 22:33:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:07,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:07,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:07,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:07,763 INFO L87 Difference]: Start difference. First operand 576 states and 1784 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:07,913 INFO L93 Difference]: Finished difference Result 775 states and 2314 transitions. [2025-04-13 22:33:07,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:07,913 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:07,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:07,917 INFO L225 Difference]: With dead ends: 775 [2025-04-13 22:33:07,917 INFO L226 Difference]: Without dead ends: 770 [2025-04-13 22:33:07,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:07,918 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:07,918 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-04-13 22:33:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 645. [2025-04-13 22:33:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 3.1816770186335406) internal successors, (2049), 644 states have internal predecessors, (2049), 0 states have call successors, (0), 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:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2049 transitions. [2025-04-13 22:33:07,939 INFO L79 Accepts]: Start accepts. Automaton has 645 states and 2049 transitions. Word has length 20 [2025-04-13 22:33:07,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:07,939 INFO L485 AbstractCegarLoop]: Abstraction has 645 states and 2049 transitions. [2025-04-13 22:33:07,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:07,939 INFO L278 IsEmpty]: Start isEmpty. Operand 645 states and 2049 transitions. [2025-04-13 22:33:07,940 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:07,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:07,941 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:07,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:08,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:33:08,141 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:08,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash -512495995, now seen corresponding path program 3 times [2025-04-13 22:33:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:08,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222298514] [2025-04-13 22:33:08,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:08,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:08,155 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:08,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:08,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,251 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:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:08,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222298514] [2025-04-13 22:33:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222298514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:33:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212589641] [2025-04-13 22:33:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:08,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:08,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:08,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:08,252 INFO L87 Difference]: Start difference. First operand 645 states and 2049 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:08,441 INFO L93 Difference]: Finished difference Result 963 states and 2910 transitions. [2025-04-13 22:33:08,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:08,441 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:08,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:08,447 INFO L225 Difference]: With dead ends: 963 [2025-04-13 22:33:08,447 INFO L226 Difference]: Without dead ends: 958 [2025-04-13 22:33:08,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:08,448 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:08,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:33:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-04-13 22:33:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 660. [2025-04-13 22:33:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 3.1760242792109254) internal successors, (2093), 659 states have internal predecessors, (2093), 0 states have call successors, (0), 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:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 2093 transitions. [2025-04-13 22:33:08,467 INFO L79 Accepts]: Start accepts. Automaton has 660 states and 2093 transitions. Word has length 20 [2025-04-13 22:33:08,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:08,467 INFO L485 AbstractCegarLoop]: Abstraction has 660 states and 2093 transitions. [2025-04-13 22:33:08,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:08,467 INFO L278 IsEmpty]: Start isEmpty. Operand 660 states and 2093 transitions. [2025-04-13 22:33:08,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:08,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:08,469 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:08,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:33:08,469 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:08,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2054043315, now seen corresponding path program 1 times [2025-04-13 22:33:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:08,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929513753] [2025-04-13 22:33:08,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:08,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:08,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:08,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:08,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:08,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929513753] [2025-04-13 22:33:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929513753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395537224] [2025-04-13 22:33:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:08,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:33:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:08,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:33:08,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:33:08,535 INFO L87 Difference]: Start difference. First operand 660 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:08,576 INFO L93 Difference]: Finished difference Result 794 states and 2460 transitions. [2025-04-13 22:33:08,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:33:08,577 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:08,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:08,580 INFO L225 Difference]: With dead ends: 794 [2025-04-13 22:33:08,580 INFO L226 Difference]: Without dead ends: 592 [2025-04-13 22:33:08,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:08,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:08,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:33:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-13 22:33:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 519. [2025-04-13 22:33:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.882239382239382) internal successors, (1493), 518 states have internal predecessors, (1493), 0 states have call successors, (0), 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:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1493 transitions. [2025-04-13 22:33:08,593 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1493 transitions. Word has length 20 [2025-04-13 22:33:08,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:08,593 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1493 transitions. [2025-04-13 22:33:08,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:08,593 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1493 transitions. [2025-04-13 22:33:08,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:08,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:08,594 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:08,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:33:08,594 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:08,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash -160341615, now seen corresponding path program 1 times [2025-04-13 22:33:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:08,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107833036] [2025-04-13 22:33:08,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:08,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:08,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:33:08,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:08,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,680 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:08,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:08,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107833036] [2025-04-13 22:33:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107833036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093233120] [2025-04-13 22:33:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:08,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:33:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:08,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:33:08,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:08,681 INFO L87 Difference]: Start difference. First operand 519 states and 1493 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:08,783 INFO L93 Difference]: Finished difference Result 622 states and 1728 transitions. [2025-04-13 22:33:08,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:33:08,784 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:08,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:08,787 INFO L225 Difference]: With dead ends: 622 [2025-04-13 22:33:08,787 INFO L226 Difference]: Without dead ends: 617 [2025-04-13 22:33:08,787 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:33:08,788 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:08,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:33:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-04-13 22:33:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 557. [2025-04-13 22:33:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.9100719424460433) internal successors, (1618), 556 states have internal predecessors, (1618), 0 states have call successors, (0), 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:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1618 transitions. [2025-04-13 22:33:08,802 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 1618 transitions. Word has length 20 [2025-04-13 22:33:08,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:08,802 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 1618 transitions. [2025-04-13 22:33:08,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:08,802 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 1618 transitions. [2025-04-13 22:33:08,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:33:08,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:08,804 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:08,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:33:08,804 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:08,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 937756993, now seen corresponding path program 2 times [2025-04-13 22:33:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:08,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845048361] [2025-04-13 22:33:08,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:08,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:33:08,816 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:08,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,911 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:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:08,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845048361] [2025-04-13 22:33:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845048361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:33:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758643425] [2025-04-13 22:33:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:08,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:08,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:08,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:08,913 INFO L87 Difference]: Start difference. First operand 557 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:09,087 INFO L93 Difference]: Finished difference Result 749 states and 2012 transitions. [2025-04-13 22:33:09,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:09,087 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:33:09,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:09,090 INFO L225 Difference]: With dead ends: 749 [2025-04-13 22:33:09,090 INFO L226 Difference]: Without dead ends: 744 [2025-04-13 22:33:09,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:09,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:09,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:33:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-04-13 22:33:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 487. [2025-04-13 22:33:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 2.8497942386831276) internal successors, (1385), 486 states have internal predecessors, (1385), 0 states have call successors, (0), 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:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1385 transitions. [2025-04-13 22:33:09,103 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1385 transitions. Word has length 20 [2025-04-13 22:33:09,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:09,103 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1385 transitions. [2025-04-13 22:33:09,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:09,104 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1385 transitions. [2025-04-13 22:33:09,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:33:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:09,104 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] [2025-04-13 22:33:09,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:33:09,105 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:09,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1544327542, now seen corresponding path program 1 times [2025-04-13 22:33:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:09,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104880226] [2025-04-13 22:33:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:09,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:33:09,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:33:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:10,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104880226] [2025-04-13 22:33:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104880226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:10,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279550176] [2025-04-13 22:33:10,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:10,989 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:10,990 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:11,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:33:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:33:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:11,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:33:11,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:11,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279550176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:11,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-04-13 22:33:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035908230] [2025-04-13 22:33:11,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:11,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:33:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:11,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:33:11,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:33:11,464 INFO L87 Difference]: Start difference. First operand 487 states and 1385 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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:13,775 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:17,673 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:19,847 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:24,197 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:25,302 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:28,339 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:31,254 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:35,362 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:39,980 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:41,413 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:48,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:48,547 INFO L93 Difference]: Finished difference Result 1713 states and 4903 transitions. [2025-04-13 22:33:48,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:33:48,548 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 22 [2025-04-13 22:33:48,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:48,555 INFO L225 Difference]: With dead ends: 1713 [2025-04-13 22:33:48,555 INFO L226 Difference]: Without dead ends: 1565 [2025-04-13 22:33:48,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:48,556 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 121 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:48,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 892 Invalid, 2 Unknown, 0 Unchecked, 36.5s Time] [2025-04-13 22:33:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-04-13 22:33:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1357. [2025-04-13 22:33:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 2.9631268436578173) internal successors, (4018), 1356 states have internal predecessors, (4018), 0 states have call successors, (0), 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 4018 transitions. [2025-04-13 22:33:48,590 INFO L79 Accepts]: Start accepts. Automaton has 1357 states and 4018 transitions. Word has length 22 [2025-04-13 22:33:48,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:48,590 INFO L485 AbstractCegarLoop]: Abstraction has 1357 states and 4018 transitions. [2025-04-13 22:33:48,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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:48,591 INFO L278 IsEmpty]: Start isEmpty. Operand 1357 states and 4018 transitions. [2025-04-13 22:33:48,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:33:48,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:48,593 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] [2025-04-13 22:33:48,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:33:48,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:48,797 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:33:48,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -896435882, now seen corresponding path program 1 times [2025-04-13 22:33:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:48,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368569482] [2025-04-13 22:33:48,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:48,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:33:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:33:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:48,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368569482] [2025-04-13 22:33:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368569482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:48,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243128231] [2025-04-13 22:33:48,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:48,953 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:48,954 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:48,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:33:49,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:33:49,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:49,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:33:49,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:49,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:33:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243128231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:33:49,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:33:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 22:33:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29745495] [2025-04-13 22:33:49,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:49,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:33:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:49,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:33:49,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:33:49,391 INFO L87 Difference]: Start difference. First operand 1357 states and 4018 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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:54,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:58,625 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:33:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:59,938 INFO L93 Difference]: Finished difference Result 1733 states and 4923 transitions. [2025-04-13 22:33:59,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:33:59,940 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:33:59,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:59,947 INFO L225 Difference]: With dead ends: 1733 [2025-04-13 22:33:59,947 INFO L226 Difference]: Without dead ends: 1686 [2025-04-13 22:33:59,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:33:59,949 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:59,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 553 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2025-04-13 22:33:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-04-13 22:33:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1460. [2025-04-13 22:33:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 2.9307745030843044) internal successors, (4276), 1459 states have internal predecessors, (4276), 0 states have call successors, (0), 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:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 4276 transitions. [2025-04-13 22:33:59,986 INFO L79 Accepts]: Start accepts. Automaton has 1460 states and 4276 transitions. Word has length 22 [2025-04-13 22:33:59,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:59,986 INFO L485 AbstractCegarLoop]: Abstraction has 1460 states and 4276 transitions. [2025-04-13 22:33:59,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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:59,986 INFO L278 IsEmpty]: Start isEmpty. Operand 1460 states and 4276 transitions. [2025-04-13 22:33:59,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:33:59,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:59,989 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] [2025-04-13 22:33:59,997 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:34:00,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,SelfDestructingSolverStorable21 [2025-04-13 22:34:00,190 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:34:00,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash -430149552, now seen corresponding path program 2 times [2025-04-13 22:34:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:00,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634696617] [2025-04-13 22:34:00,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:00,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:34:00,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:34:00,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:00,367 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:34:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:00,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634696617] [2025-04-13 22:34:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634696617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:00,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:00,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:34:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100628368] [2025-04-13 22:34:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:00,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:34:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:00,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:34:00,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:34:00,369 INFO L87 Difference]: Start difference. First operand 1460 states and 4276 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,586 INFO L93 Difference]: Finished difference Result 1578 states and 4593 transitions. [2025-04-13 22:34:00,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:00,586 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:34:00,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:00,592 INFO L225 Difference]: With dead ends: 1578 [2025-04-13 22:34:00,592 INFO L226 Difference]: Without dead ends: 1548 [2025-04-13 22:34:00,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:34:00,593 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:00,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-04-13 22:34:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1428. [2025-04-13 22:34:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 2.918009810791871) internal successors, (4164), 1427 states have internal predecessors, (4164), 0 states have call successors, (0), 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,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 4164 transitions. [2025-04-13 22:34:00,618 INFO L79 Accepts]: Start accepts. Automaton has 1428 states and 4164 transitions. Word has length 22 [2025-04-13 22:34:00,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:00,618 INFO L485 AbstractCegarLoop]: Abstraction has 1428 states and 4164 transitions. [2025-04-13 22:34:00,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,618 INFO L278 IsEmpty]: Start isEmpty. Operand 1428 states and 4164 transitions. [2025-04-13 22:34:00,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:34:00,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:00,621 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] [2025-04-13 22:34:00,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:34:00,621 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:34:00,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 184256272, now seen corresponding path program 3 times [2025-04-13 22:34:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:00,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376933144] [2025-04-13 22:34:00,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:00,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:34:00,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 22:34:00,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:00,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376933144] [2025-04-13 22:34:00,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376933144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:00,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:00,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:34:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570725443] [2025-04-13 22:34:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:00,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:34:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:00,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:34:00,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:34:00,742 INFO L87 Difference]: Start difference. First operand 1428 states and 4164 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,910 INFO L93 Difference]: Finished difference Result 1746 states and 5071 transitions. [2025-04-13 22:34:00,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:00,910 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:34:00,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:00,917 INFO L225 Difference]: With dead ends: 1746 [2025-04-13 22:34:00,917 INFO L226 Difference]: Without dead ends: 1672 [2025-04-13 22:34:00,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:34:00,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:00,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-04-13 22:34:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1480. [2025-04-13 22:34:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 2.8329952670723464) internal successors, (4190), 1479 states have internal predecessors, (4190), 0 states have call successors, (0), 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,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 4190 transitions. [2025-04-13 22:34:00,947 INFO L79 Accepts]: Start accepts. Automaton has 1480 states and 4190 transitions. Word has length 22 [2025-04-13 22:34:00,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:00,947 INFO L485 AbstractCegarLoop]: Abstraction has 1480 states and 4190 transitions. [2025-04-13 22:34:00,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,947 INFO L278 IsEmpty]: Start isEmpty. Operand 1480 states and 4190 transitions. [2025-04-13 22:34:00,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:34:00,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:00,950 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:00,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:34:00,950 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:34:00,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 461771015, now seen corresponding path program 4 times [2025-04-13 22:34:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:00,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805799801] [2025-04-13 22:34:00,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:00,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:34:00,969 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:34:00,969 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:00,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:01,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805799801] [2025-04-13 22:34:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805799801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:01,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296635192] [2025-04-13 22:34:01,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:01,121 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:34:01,122 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:34:01,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:34:01,269 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:34:01,269 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:34:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:01,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296635192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:01,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-04-13 22:34:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531552838] [2025-04-13 22:34:01,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:01,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:34:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:01,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:34:01,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:34:01,871 INFO L87 Difference]: Start difference. First operand 1480 states and 4190 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 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:06,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:10,452 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:14,779 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:18,783 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:22,822 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:27,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:31,724 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:35,807 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:36,072 INFO L93 Difference]: Finished difference Result 1979 states and 5283 transitions. [2025-04-13 22:34:36,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:34:36,072 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 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:34:36,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:36,084 INFO L225 Difference]: With dead ends: 1979 [2025-04-13 22:34:36,084 INFO L226 Difference]: Without dead ends: 1852 [2025-04-13 22:34:36,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:34:36,086 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 56 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:36,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 996 Invalid, 8 Unknown, 0 Unchecked, 33.7s Time] [2025-04-13 22:34:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-04-13 22:34:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1640. [2025-04-13 22:34:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 2.771201952410006) internal successors, (4542), 1639 states have internal predecessors, (4542), 0 states have call successors, (0), 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:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 4542 transitions. [2025-04-13 22:34:36,123 INFO L79 Accepts]: Start accepts. Automaton has 1640 states and 4542 transitions. Word has length 26 [2025-04-13 22:34:36,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:36,124 INFO L485 AbstractCegarLoop]: Abstraction has 1640 states and 4542 transitions. [2025-04-13 22:34:36,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 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:36,124 INFO L278 IsEmpty]: Start isEmpty. Operand 1640 states and 4542 transitions. [2025-04-13 22:34:36,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:34:36,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:36,127 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:36,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:36,331 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,SelfDestructingSolverStorable24 [2025-04-13 22:34:36,331 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:34:36,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1161781636, now seen corresponding path program 2 times [2025-04-13 22:34:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:36,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926610405] [2025-04-13 22:34:36,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:36,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:34:36,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:34:36,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:36,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:36,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926610405] [2025-04-13 22:34:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926610405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:36,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119201634] [2025-04-13 22:34:36,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:36,507 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:36,509 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:36,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:34:36,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:34:36,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:36,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:36,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:34:36,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:36,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119201634] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:37,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 22:34:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483029970] [2025-04-13 22:34:37,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:37,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:34:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:37,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:34:37,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:34:37,070 INFO L87 Difference]: Start difference. First operand 1640 states and 4542 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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:51,185 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:54,082 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:58,177 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:34:59,498 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:03,559 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:17,667 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:21,670 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:23,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:29,037 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:33,699 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:35:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:38,449 INFO L93 Difference]: Finished difference Result 2752 states and 7668 transitions. [2025-04-13 22:35:38,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:35:38,450 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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:35:38,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:38,456 INFO L225 Difference]: With dead ends: 2752 [2025-04-13 22:35:38,456 INFO L226 Difference]: Without dead ends: 2678 [2025-04-13 22:35:38,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=360, Invalid=1279, Unknown=1, NotChecked=0, Total=1640 [2025-04-13 22:35:38,458 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 122 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:38,458 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 971 Invalid, 6 Unknown, 0 Unchecked, 36.2s Time] [2025-04-13 22:35:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-04-13 22:35:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2160. [2025-04-13 22:35:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 2.842982862436313) internal successors, (6138), 2159 states have internal predecessors, (6138), 0 states have call successors, (0), 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:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 6138 transitions. [2025-04-13 22:35:38,497 INFO L79 Accepts]: Start accepts. Automaton has 2160 states and 6138 transitions. Word has length 26 [2025-04-13 22:35:38,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:38,497 INFO L485 AbstractCegarLoop]: Abstraction has 2160 states and 6138 transitions. [2025-04-13 22:35:38,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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:38,498 INFO L278 IsEmpty]: Start isEmpty. Operand 2160 states and 6138 transitions. [2025-04-13 22:35:38,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:35:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:38,503 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:38,509 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:35:38,703 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,SelfDestructingSolverStorable25 [2025-04-13 22:35:38,703 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:35:38,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 360862625, now seen corresponding path program 5 times [2025-04-13 22:35:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:38,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092056986] [2025-04-13 22:35:38,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:38,707 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:35:38,731 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:35:38,731 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:35:38,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:35:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:38,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092056986] [2025-04-13 22:35:38,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092056986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:38,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13796261] [2025-04-13 22:35:38,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:38,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:38,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:38,884 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:35:38,885 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:35:38,914 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:35:38,957 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:35:38,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:35:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:38,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:35:38,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:35:39,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:35:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13796261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:39,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-13 22:35:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687756781] [2025-04-13 22:35:39,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:39,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:35:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:39,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:35:39,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:35:39,523 INFO L87 Difference]: Start difference. First operand 2160 states and 6138 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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:35:57,314 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 22:36:01,317 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 22:36:09,015 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 22:36:19,555 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:36:24,941 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 22:36:29,307 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 22:36:41,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:36:45,796 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:36:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:50,719 INFO L93 Difference]: Finished difference Result 3263 states and 9258 transitions. [2025-04-13 22:36:50,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:36:50,719 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 26 [2025-04-13 22:36:50,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:50,727 INFO L225 Difference]: With dead ends: 3263 [2025-04-13 22:36:50,727 INFO L226 Difference]: Without dead ends: 3210 [2025-04-13 22:36:50,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=250, Invalid=737, Unknown=5, NotChecked=0, Total=992 [2025-04-13 22:36:50,728 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 115 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:50,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 816 Invalid, 7 Unknown, 0 Unchecked, 34.9s Time] [2025-04-13 22:36:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-04-13 22:36:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2620. [2025-04-13 22:36:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 2619 states have (on average 2.8835433371515844) internal successors, (7552), 2619 states have internal predecessors, (7552), 0 states have call successors, (0), 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:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 7552 transitions. [2025-04-13 22:36:50,767 INFO L79 Accepts]: Start accepts. Automaton has 2620 states and 7552 transitions. Word has length 26 [2025-04-13 22:36:50,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:50,767 INFO L485 AbstractCegarLoop]: Abstraction has 2620 states and 7552 transitions. [2025-04-13 22:36:50,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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:36:50,767 INFO L278 IsEmpty]: Start isEmpty. Operand 2620 states and 7552 transitions. [2025-04-13 22:36:50,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:36:50,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:50,771 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:50,778 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:36:50,972 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,SelfDestructingSolverStorable26 [2025-04-13 22:36:50,972 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:36:50,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1878486058, now seen corresponding path program 3 times [2025-04-13 22:36:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:50,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847441388] [2025-04-13 22:36:50,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:50,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:36:50,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:36:50,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:50,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:51,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847441388] [2025-04-13 22:36:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847441388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:51,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016861257] [2025-04-13 22:36:51,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:51,112 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:36:51,113 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:36:51,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:36:51,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:36:51,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:51,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:51,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:36:51,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:51,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:51,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016861257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:51,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 22:36:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504193916] [2025-04-13 22:36:51,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:51,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:51,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:51,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:51,534 INFO L87 Difference]: Start difference. First operand 2620 states and 7552 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:53,505 INFO L93 Difference]: Finished difference Result 2918 states and 8319 transitions. [2025-04-13 22:36:53,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:36:53,505 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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:36:53,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:53,513 INFO L225 Difference]: With dead ends: 2918 [2025-04-13 22:36:53,513 INFO L226 Difference]: Without dead ends: 2892 [2025-04-13 22:36:53,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:36:53,514 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:53,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:36:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-04-13 22:36:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2516. [2025-04-13 22:36:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2515 states have (on average 2.862823061630219) internal successors, (7200), 2515 states have internal predecessors, (7200), 0 states have call successors, (0), 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:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 7200 transitions. [2025-04-13 22:36:53,576 INFO L79 Accepts]: Start accepts. Automaton has 2516 states and 7200 transitions. Word has length 26 [2025-04-13 22:36:53,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:53,576 INFO L485 AbstractCegarLoop]: Abstraction has 2516 states and 7200 transitions. [2025-04-13 22:36:53,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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:53,576 INFO L278 IsEmpty]: Start isEmpty. Operand 2516 states and 7200 transitions. [2025-04-13 22:36:53,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:36:53,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:53,580 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:53,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 22:36:53,780 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,SelfDestructingSolverStorable27 [2025-04-13 22:36:53,781 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:36:53,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1618694021, now seen corresponding path program 1 times [2025-04-13 22:36:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:53,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145040081] [2025-04-13 22:36:53,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:36:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:53,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:36:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:36:53,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:36:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:54,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145040081] [2025-04-13 22:36:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145040081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:54,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53865010] [2025-04-13 22:36:54,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:36:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:54,768 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:36:54,768 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:36:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:36:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:36:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:55,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:36:55,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:00,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53865010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:37:00,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:37:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-13 22:37:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889450342] [2025-04-13 22:37:00,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:37:00,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:37:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:00,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:37:00,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:37:00,923 INFO L87 Difference]: Start difference. First operand 2516 states and 7200 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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:37:02,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:15,180 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:20,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:24,110 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:29,787 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:33,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:44,367 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:48,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:49,518 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:52,963 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:37:57,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:38:06,578 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:38:10,587 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:38:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:10,666 INFO L93 Difference]: Finished difference Result 2924 states and 8126 transitions. [2025-04-13 22:38:10,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:38:10,666 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 30 [2025-04-13 22:38:10,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:10,674 INFO L225 Difference]: With dead ends: 2924 [2025-04-13 22:38:10,674 INFO L226 Difference]: Without dead ends: 2830 [2025-04-13 22:38:10,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=167, Invalid=700, Unknown=3, NotChecked=0, Total=870 [2025-04-13 22:38:10,679 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 75 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:10,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1123 Invalid, 7 Unknown, 0 Unchecked, 51.9s Time] [2025-04-13 22:38:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-04-13 22:38:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2741. [2025-04-13 22:38:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2740 states have (on average 2.8394160583941606) internal successors, (7780), 2740 states have internal predecessors, (7780), 0 states have call successors, (0), 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:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 7780 transitions. [2025-04-13 22:38:10,720 INFO L79 Accepts]: Start accepts. Automaton has 2741 states and 7780 transitions. Word has length 30 [2025-04-13 22:38:10,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:10,720 INFO L485 AbstractCegarLoop]: Abstraction has 2741 states and 7780 transitions. [2025-04-13 22:38:10,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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:38:10,721 INFO L278 IsEmpty]: Start isEmpty. Operand 2741 states and 7780 transitions. [2025-04-13 22:38:10,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:38:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:10,725 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:10,731 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:38:10,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 22:38:10,925 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:38:10,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2046607205, now seen corresponding path program 1 times [2025-04-13 22:38:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:10,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944737004] [2025-04-13 22:38:10,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:38:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:10,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:38:10,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:38:10,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:10,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:38:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:11,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944737004] [2025-04-13 22:38:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944737004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:11,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243568928] [2025-04-13 22:38:11,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:38:11,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:11,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:11,230 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:38:11,231 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:38:11,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:38:11,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:38:11,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:11,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:11,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:38:11,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:38:11,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:38:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243568928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:38:20,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:38:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 11] total 23 [2025-04-13 22:38:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743893433] [2025-04-13 22:38:20,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:38:20,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:38:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:20,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:38:20,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=399, Unknown=1, NotChecked=0, Total=506 [2025-04-13 22:38:20,014 INFO L87 Difference]: Start difference. First operand 2741 states and 7780 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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:24,084 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:38:27,516 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:38:41,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:39:09,793 WARN L286 SmtUtils]: Spent 11.98s on a formula simplification. DAG size of input: 39 DAG size of output: 22 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:39:23,646 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 56 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:39:50,394 WARN L286 SmtUtils]: Spent 15.30s on a formula simplification. DAG size of input: 50 DAG size of output: 28 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:39:54,889 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:39:59,332 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:40:02,971 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:40:20,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:40:24,921 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:01,009 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:05,016 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:09,024 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:13,036 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:27,100 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:29,349 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:33,368 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:42,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:43,956 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:47,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:50,999 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:53,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:41:57,544 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:01,700 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:05,704 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:09,802 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:26,117 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:28,203 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:40,515 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:45,603 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:46,808 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:50,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:54,833 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:42:58,836 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:04,213 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:11,843 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:43:15,874 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:19,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:28,826 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:30,787 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:39,149 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:43,207 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:46,656 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:50,676 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:54,682 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:58,688 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:43:59,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:01,771 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:04,396 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:08,410 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:33,329 WARN L286 SmtUtils]: Spent 24.10s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:44:37,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:42,063 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:46,069 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:50,082 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:54,087 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:44:58,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:02,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:06,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:10,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:14,168 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:16,612 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:18,787 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:23,711 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:26,014 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:45:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:27,958 INFO L93 Difference]: Finished difference Result 4186 states and 11342 transitions. [2025-04-13 22:45:27,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:45:27,958 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:45:27,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:27,967 INFO L225 Difference]: With dead ends: 4186 [2025-04-13 22:45:27,967 INFO L226 Difference]: Without dead ends: 4050 [2025-04-13 22:45:27,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 207.8s TimeCoverageRelationStatistics Valid=490, Invalid=2142, Unknown=20, NotChecked=0, Total=2652 [2025-04-13 22:45:27,970 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 134 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 227.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 228.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:27,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1906 Invalid, 41 Unknown, 0 Unchecked, 228.0s Time] [2025-04-13 22:45:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2025-04-13 22:45:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3006. [2025-04-13 22:45:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 3005 states have (on average 2.832945091514143) internal successors, (8513), 3005 states have internal predecessors, (8513), 0 states have call successors, (0), 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:45:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 8513 transitions. [2025-04-13 22:45:28,038 INFO L79 Accepts]: Start accepts. Automaton has 3006 states and 8513 transitions. Word has length 30 [2025-04-13 22:45:28,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:28,038 INFO L485 AbstractCegarLoop]: Abstraction has 3006 states and 8513 transitions. [2025-04-13 22:45:28,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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:45:28,038 INFO L278 IsEmpty]: Start isEmpty. Operand 3006 states and 8513 transitions. [2025-04-13 22:45:28,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:45:28,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:28,043 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:28,049 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:45:28,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:28,243 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:45:28,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1277465819, now seen corresponding path program 2 times [2025-04-13 22:45:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:28,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175911053] [2025-04-13 22:45:28,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:45:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:28,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:45:28,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:45:28,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:45:28,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:28,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175911053] [2025-04-13 22:45:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175911053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:28,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89384769] [2025-04-13 22:45:28,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:45:28,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:28,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:28,561 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:45:28,561 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:45:28,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:45:28,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:45:28,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:45:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:28,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:45:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:29,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89384769] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:30,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-04-13 22:45:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430966039] [2025-04-13 22:45:30,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:30,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:45:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:30,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:45:30,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:45:30,343 INFO L87 Difference]: Start difference. First operand 3006 states and 8513 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 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:45:37,370 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:45:41,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:45:51,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:45:55,677 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:11,064 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:16,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:17,855 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:19,871 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:21,506 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:27,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:30,070 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:34,590 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:35,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:38,887 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:43,899 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:48,438 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:53,944 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:46:58,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:47:02,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:47:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:03,283 INFO L93 Difference]: Finished difference Result 4888 states and 13402 transitions. [2025-04-13 22:47:03,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:47:03,283 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:47:03,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:03,292 INFO L225 Difference]: With dead ends: 4888 [2025-04-13 22:47:03,292 INFO L226 Difference]: Without dead ends: 4670 [2025-04-13 22:47:03,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=503, Invalid=2465, Unknown=2, NotChecked=0, Total=2970 [2025-04-13 22:47:03,294 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 209 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:03,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1846 Invalid, 9 Unknown, 0 Unchecked, 72.0s Time] [2025-04-13 22:47:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2025-04-13 22:47:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 3838. [2025-04-13 22:47:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3837 states have (on average 2.9051342194422727) internal successors, (11147), 3837 states have internal predecessors, (11147), 0 states have call successors, (0), 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:47:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 11147 transitions. [2025-04-13 22:47:03,373 INFO L79 Accepts]: Start accepts. Automaton has 3838 states and 11147 transitions. Word has length 30 [2025-04-13 22:47:03,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:03,373 INFO L485 AbstractCegarLoop]: Abstraction has 3838 states and 11147 transitions. [2025-04-13 22:47:03,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 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:47:03,373 INFO L278 IsEmpty]: Start isEmpty. Operand 3838 states and 11147 transitions. [2025-04-13 22:47:03,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:47:03,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:03,378 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:03,384 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:47:03,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:03,579 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:47:03,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1764501601, now seen corresponding path program 2 times [2025-04-13 22:47:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:03,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123653806] [2025-04-13 22:47:03,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:47:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:03,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:47:03,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:03,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:47:03,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:03,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123653806] [2025-04-13 22:47:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123653806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:03,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257030778] [2025-04-13 22:47:03,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:47:03,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:03,736 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:47:03,737 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:47:03,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:47:03,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:47:03,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:47:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:03,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:47:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:04,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:47:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257030778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:04,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2025-04-13 22:47:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024536667] [2025-04-13 22:47:04,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:04,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:47:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:04,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:47:04,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:47:04,513 INFO L87 Difference]: Start difference. First operand 3838 states and 11147 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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:47:12,184 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 46 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:47:18,216 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:47:27,247 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:47:33,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 22:47:37,187 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:47:37,188 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:47:38,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:47:38,388 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 22:47:38,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 22:47:38,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:47:38,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:47:38,408 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 72 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:38,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 815 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2025-04-13 22:47:38,411 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:47:38,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:47:38,411 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (3838states) and FLOYD_HOARE automaton (currently 20 states, 22 states before enhancement),while executing Executor. [2025-04-13 22:47:38,412 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:47:38,412 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:47:38,414 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:38,416 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:47:38,416 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:47:38,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:47:38 BasicIcfg [2025-04-13 22:47:38,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:47:38,417 INFO L158 Benchmark]: Toolchain (without parser) took 877405.41ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 109.5MB in the beginning and 105.8MB in the end (delta: 3.6MB). Peak memory consumption was 73.0MB. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: CDTParser took 3.69ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.89ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 94.7MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.84ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: Boogie Preprocessor took 37.77ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: IcfgBuilder took 437.74ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 60.3MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 22:47:38,417 INFO L158 Benchmark]: TraceAbstraction took 876709.10ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 59.5MB in the beginning and 105.8MB in the end (delta: -46.3MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2025-04-13 22:47:38,418 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.69ms. Allocated memory is still 163.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.89ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 94.7MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.84ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.77ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 437.74ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 60.3MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 876709.10ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 59.5MB in the beginning and 105.8MB in the end (delta: -46.3MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (3838states) and FLOYD_HOARE automaton (currently 20 states, 22 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3838states) and FLOYD_HOARE automaton (currently 20 states, 22 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3838states) and FLOYD_HOARE automaton (currently 20 states, 22 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 36 locations, 55 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 876.6s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 843.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 83 mSolverCounterUnknown, 3043 SdHoareTripleChecker+Valid, 518.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3043 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 516.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13973 IncrementalHoareTripleChecker+Invalid, 15170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1114 mSolverCounterUnsat, 0 mSDtfsCounter, 13973 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1131 GetRequests, 671 SyntacticMatches, 66 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 340.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3838occurred in iteration=31, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 6270 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1384 ConstructedInterpolants, 23 QuantifiedInterpolants, 14516 SizeOfPredicates, 87 NumberOfNonLiveVariables, 2494 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 64 InterpolantComputations, 16 PerfectInterpolantSequences, 67/248 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