/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/popl20-threaded-sum-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:17:30,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:17:30,631 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 23:17:30,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:17:30,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:17:30,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:17:30,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:17:30,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:17:30,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:17:30,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:17:30,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:17:30,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:17:30,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:17:30,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:17:30,668 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:17:30,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:17:30,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:17:30,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:17:30,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:30,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:17:30,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:30,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:17:30,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:17:30,670 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 23:17:30,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:17:30,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:17:30,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:17:30,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:17:30,859 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:17:30,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-13 23:17:32,109 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f531695/b37b44c5ad3c4c4a8ab82cf366920cb3/FLAGc8d0becd6 [2025-04-13 23:17:32,333 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:17:32,340 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-13 23:17:32,351 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f531695/b37b44c5ad3c4c4a8ab82cf366920cb3/FLAGc8d0becd6 [2025-04-13 23:17:33,159 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f531695/b37b44c5ad3c4c4a8ab82cf366920cb3 [2025-04-13 23:17:33,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:17:33,162 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:17:33,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:17:33,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:17:33,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:17:33,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391921ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33, skipping insertion in model container [2025-04-13 23:17:33,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:17:33,349 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/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-13 23:17:33,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:17:33,365 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:17:33,403 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/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-13 23:17:33,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:17:33,420 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:17:33,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33 WrapperNode [2025-04-13 23:17:33,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:17:33,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:17:33,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:17:33,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:17:33,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,445 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-04-13 23:17:33,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:17:33,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:17:33,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:17:33,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:17:33,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,470 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 23:17:33,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:17:33,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:17:33,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:17:33,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:17:33,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (1/1) ... [2025-04-13 23:17:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:33,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:33,502 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 23:17:33,504 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 23:17:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:17:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:17:33,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:17:33,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:17:33,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:17:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:17:33,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:17:33,520 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 23:17:33,586 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:17:33,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:17:33,719 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:17:33,720 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:17:33,720 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:17:33,864 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:17:33,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:17:33 BoogieIcfgContainer [2025-04-13 23:17:33,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:17:33,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:17:33,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:17:33,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:17:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:17:33" (1/3) ... [2025-04-13 23:17:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cb7b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:17:33, skipping insertion in model container [2025-04-13 23:17:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:33" (2/3) ... [2025-04-13 23:17:33,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cb7b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:17:33, skipping insertion in model container [2025-04-13 23:17:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:17:33" (3/3) ... [2025-04-13 23:17:33,871 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-04-13 23:17:33,881 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:17:33,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 32 locations, 31 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:17:33,882 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:17:33,925 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:17:33,947 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 34 transitions, 89 flow [2025-04-13 23:17:34,002 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:34,024 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:17:34,032 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;@14a1e864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:17:34,032 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:17:34,035 INFO L278 IsEmpty]: Start isEmpty. Operand has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:34,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:17:34,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:34,050 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 23:17:34,050 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:34,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash 94439003, now seen corresponding path program 1 times [2025-04-13 23:17:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:34,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389133022] [2025-04-13 23:17:34,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:34,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:17:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:17:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:34,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:34,608 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 23:17:34,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:34,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389133022] [2025-04-13 23:17:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389133022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:34,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061858350] [2025-04-13 23:17:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:34,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:34,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:34,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:34,628 INFO L87 Difference]: Start difference. First operand has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:34,891 INFO L93 Difference]: Finished difference Result 1264 states and 4311 transitions. [2025-04-13 23:17:34,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:34,893 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:17:34,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:34,915 INFO L225 Difference]: With dead ends: 1264 [2025-04-13 23:17:34,915 INFO L226 Difference]: Without dead ends: 1105 [2025-04-13 23:17:34,919 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 23:17:34,924 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:34,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 23 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2025-04-13 23:17:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 937. [2025-04-13 23:17:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 3.388888888888889) internal successors, (3172), 936 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 3172 transitions. [2025-04-13 23:17:35,041 INFO L79 Accepts]: Start accepts. Automaton has 937 states and 3172 transitions. Word has length 20 [2025-04-13 23:17:35,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:35,042 INFO L485 AbstractCegarLoop]: Abstraction has 937 states and 3172 transitions. [2025-04-13 23:17:35,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:35,043 INFO L278 IsEmpty]: Start isEmpty. Operand 937 states and 3172 transitions. [2025-04-13 23:17:35,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:17:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:35,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:35,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:17:35,048 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:35,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1130658387, now seen corresponding path program 1 times [2025-04-13 23:17:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:35,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931084058] [2025-04-13 23:17:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:35,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:17:35,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:17:35,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:35,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:35,274 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 23:17:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:35,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931084058] [2025-04-13 23:17:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931084058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953682880] [2025-04-13 23:17:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:35,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:35,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:35,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:35,276 INFO L87 Difference]: Start difference. First operand 937 states and 3172 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:35,516 INFO L93 Difference]: Finished difference Result 1430 states and 4906 transitions. [2025-04-13 23:17:35,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:35,516 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:17:35,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:35,524 INFO L225 Difference]: With dead ends: 1430 [2025-04-13 23:17:35,525 INFO L226 Difference]: Without dead ends: 1211 [2025-04-13 23:17:35,527 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 23:17:35,528 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:35,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 21 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-04-13 23:17:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 829. [2025-04-13 23:17:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.4106280193236715) internal successors, (2824), 828 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2824 transitions. [2025-04-13 23:17:35,600 INFO L79 Accepts]: Start accepts. Automaton has 829 states and 2824 transitions. Word has length 23 [2025-04-13 23:17:35,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:35,601 INFO L485 AbstractCegarLoop]: Abstraction has 829 states and 2824 transitions. [2025-04-13 23:17:35,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:35,601 INFO L278 IsEmpty]: Start isEmpty. Operand 829 states and 2824 transitions. [2025-04-13 23:17:35,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:17:35,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:35,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:35,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:17:35,605 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:35,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1553935190, now seen corresponding path program 1 times [2025-04-13 23:17:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:35,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419962094] [2025-04-13 23:17:35,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:35,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:17:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:17:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:35,851 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 23:17:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:35,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419962094] [2025-04-13 23:17:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419962094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:17:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283901494] [2025-04-13 23:17:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:35,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:17:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:35,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:17:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:17:35,852 INFO L87 Difference]: Start difference. First operand 829 states and 2824 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:36,174 INFO L93 Difference]: Finished difference Result 1263 states and 4137 transitions. [2025-04-13 23:17:36,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:17:36,174 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:17:36,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:36,182 INFO L225 Difference]: With dead ends: 1263 [2025-04-13 23:17:36,182 INFO L226 Difference]: Without dead ends: 1121 [2025-04-13 23:17:36,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:17:36,185 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 57 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:36,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-04-13 23:17:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 846. [2025-04-13 23:17:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 3.395266272189349) internal successors, (2869), 845 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2869 transitions. [2025-04-13 23:17:36,286 INFO L79 Accepts]: Start accepts. Automaton has 846 states and 2869 transitions. Word has length 24 [2025-04-13 23:17:36,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:36,286 INFO L485 AbstractCegarLoop]: Abstraction has 846 states and 2869 transitions. [2025-04-13 23:17:36,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,286 INFO L278 IsEmpty]: Start isEmpty. Operand 846 states and 2869 transitions. [2025-04-13 23:17:36,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:17:36,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:36,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:36,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:17:36,289 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:36,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2051809290, now seen corresponding path program 2 times [2025-04-13 23:17:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:36,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193605610] [2025-04-13 23:17:36,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:36,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:17:36,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:17:36,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:17:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:36,531 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 23:17:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:36,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193605610] [2025-04-13 23:17:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193605610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:17:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201331359] [2025-04-13 23:17:36,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:36,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:17:36,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:36,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:17:36,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:17:36,532 INFO L87 Difference]: Start difference. First operand 846 states and 2869 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:36,797 INFO L93 Difference]: Finished difference Result 1420 states and 4694 transitions. [2025-04-13 23:17:36,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:17:36,797 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:17:36,797 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:36,804 INFO L225 Difference]: With dead ends: 1420 [2025-04-13 23:17:36,804 INFO L226 Difference]: Without dead ends: 1308 [2025-04-13 23:17:36,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:17:36,805 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:36,805 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-04-13 23:17:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 871. [2025-04-13 23:17:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 3.432183908045977) internal successors, (2986), 870 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2986 transitions. [2025-04-13 23:17:36,886 INFO L79 Accepts]: Start accepts. Automaton has 871 states and 2986 transitions. Word has length 24 [2025-04-13 23:17:36,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:36,886 INFO L485 AbstractCegarLoop]: Abstraction has 871 states and 2986 transitions. [2025-04-13 23:17:36,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:36,886 INFO L278 IsEmpty]: Start isEmpty. Operand 871 states and 2986 transitions. [2025-04-13 23:17:36,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:17:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:36,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:36,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:17:36,888 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:36,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash 130729376, now seen corresponding path program 3 times [2025-04-13 23:17:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:36,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935184318] [2025-04-13 23:17:36,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:36,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:17:36,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:17:36,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:17:36,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:37,013 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 23:17:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:37,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935184318] [2025-04-13 23:17:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935184318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638464219] [2025-04-13 23:17:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:37,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:37,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:37,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:37,014 INFO L87 Difference]: Start difference. First operand 871 states and 2986 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:37,169 INFO L93 Difference]: Finished difference Result 1093 states and 3653 transitions. [2025-04-13 23:17:37,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:17:37,169 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:17:37,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:37,175 INFO L225 Difference]: With dead ends: 1093 [2025-04-13 23:17:37,175 INFO L226 Difference]: Without dead ends: 981 [2025-04-13 23:17:37,176 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 23:17:37,176 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:37,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 20 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-04-13 23:17:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 921. [2025-04-13 23:17:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 3.4304347826086956) internal successors, (3156), 920 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 3156 transitions. [2025-04-13 23:17:37,258 INFO L79 Accepts]: Start accepts. Automaton has 921 states and 3156 transitions. Word has length 24 [2025-04-13 23:17:37,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:37,258 INFO L485 AbstractCegarLoop]: Abstraction has 921 states and 3156 transitions. [2025-04-13 23:17:37,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,259 INFO L278 IsEmpty]: Start isEmpty. Operand 921 states and 3156 transitions. [2025-04-13 23:17:37,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:17:37,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:37,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:37,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:17:37,263 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:37,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 728066034, now seen corresponding path program 4 times [2025-04-13 23:17:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:37,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598806957] [2025-04-13 23:17:37,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:37,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:37,269 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:17:37,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:17:37,281 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:37,387 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 23:17:37,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:37,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598806957] [2025-04-13 23:17:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598806957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:37,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:37,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362680451] [2025-04-13 23:17:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:37,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:37,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:37,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:37,388 INFO L87 Difference]: Start difference. First operand 921 states and 3156 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:37,645 INFO L93 Difference]: Finished difference Result 1798 states and 6221 transitions. [2025-04-13 23:17:37,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:37,645 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:17:37,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:37,658 INFO L225 Difference]: With dead ends: 1798 [2025-04-13 23:17:37,658 INFO L226 Difference]: Without dead ends: 1687 [2025-04-13 23:17:37,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:17:37,659 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:37,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 21 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2025-04-13 23:17:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1029. [2025-04-13 23:17:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 3.4396887159533076) internal successors, (3536), 1028 states have internal predecessors, (3536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 3536 transitions. [2025-04-13 23:17:37,760 INFO L79 Accepts]: Start accepts. Automaton has 1029 states and 3536 transitions. Word has length 24 [2025-04-13 23:17:37,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:37,760 INFO L485 AbstractCegarLoop]: Abstraction has 1029 states and 3536 transitions. [2025-04-13 23:17:37,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:37,760 INFO L278 IsEmpty]: Start isEmpty. Operand 1029 states and 3536 transitions. [2025-04-13 23:17:37,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:17:37,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:37,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:37,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:17:37,763 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:37,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 22298026, now seen corresponding path program 1 times [2025-04-13 23:17:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:37,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930360076] [2025-04-13 23:17:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:37,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:17:37,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:17:37,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:37,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:37,964 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 23:17:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:37,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930360076] [2025-04-13 23:17:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930360076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:17:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455614934] [2025-04-13 23:17:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:37,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:17:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:37,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:17:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:17:37,966 INFO L87 Difference]: Start difference. First operand 1029 states and 3536 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:38,155 INFO L93 Difference]: Finished difference Result 1456 states and 5000 transitions. [2025-04-13 23:17:38,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:38,156 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:17:38,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:38,163 INFO L225 Difference]: With dead ends: 1456 [2025-04-13 23:17:38,164 INFO L226 Difference]: Without dead ends: 1364 [2025-04-13 23:17:38,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:17:38,165 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:38,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-04-13 23:17:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1114. [2025-04-13 23:17:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 3.442048517520216) internal successors, (3831), 1113 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3831 transitions. [2025-04-13 23:17:38,271 INFO L79 Accepts]: Start accepts. Automaton has 1114 states and 3831 transitions. Word has length 27 [2025-04-13 23:17:38,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:38,273 INFO L485 AbstractCegarLoop]: Abstraction has 1114 states and 3831 transitions. [2025-04-13 23:17:38,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:38,273 INFO L278 IsEmpty]: Start isEmpty. Operand 1114 states and 3831 transitions. [2025-04-13 23:17:38,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:17:38,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:38,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:38,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:17:38,276 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:38,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 810181116, now seen corresponding path program 2 times [2025-04-13 23:17:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:38,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974120438] [2025-04-13 23:17:38,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:38,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:17:38,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:17:38,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:38,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:39,788 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 23:17:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:39,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974120438] [2025-04-13 23:17:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974120438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:39,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993039567] [2025-04-13 23:17:39,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:39,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:39,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:39,791 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 23:17:39,792 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 23:17:39,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:17:39,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:17:39,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:39,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:39,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 23:17:39,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:40,478 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 23:17:40,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:45,059 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 23:17:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993039567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:45,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2025-04-13 23:17:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297622308] [2025-04-13 23:17:45,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:45,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:17:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:45,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:17:45,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=369, Unknown=1, NotChecked=0, Total=462 [2025-04-13 23:17:45,062 INFO L87 Difference]: Start difference. First operand 1114 states and 3831 transitions. Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:00,793 INFO L93 Difference]: Finished difference Result 8382 states and 29024 transitions. [2025-04-13 23:18:00,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-04-13 23:18:00,793 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:18:00,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:00,836 INFO L225 Difference]: With dead ends: 8382 [2025-04-13 23:18:00,836 INFO L226 Difference]: Without dead ends: 7196 [2025-04-13 23:18:00,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4234 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2083, Invalid=10348, Unknown=1, NotChecked=0, Total=12432 [2025-04-13 23:18:00,842 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 819 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:00,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 581 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 23:18:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2025-04-13 23:18:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 2308. [2025-04-13 23:18:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 3.540962288686606) internal successors, (8169), 2307 states have internal predecessors, (8169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 8169 transitions. [2025-04-13 23:18:01,438 INFO L79 Accepts]: Start accepts. Automaton has 2308 states and 8169 transitions. Word has length 27 [2025-04-13 23:18:01,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:01,439 INFO L485 AbstractCegarLoop]: Abstraction has 2308 states and 8169 transitions. [2025-04-13 23:18:01,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:01,439 INFO L278 IsEmpty]: Start isEmpty. Operand 2308 states and 8169 transitions. [2025-04-13 23:18:01,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:18:01,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:01,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:01,451 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 23:18:01,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:01,648 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:18:01,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -726126312, now seen corresponding path program 3 times [2025-04-13 23:18:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:01,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753819664] [2025-04-13 23:18:01,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:18:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:01,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:18:01,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:01,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:18:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:02,681 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 23:18:02,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:02,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753819664] [2025-04-13 23:18:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753819664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:02,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135613799] [2025-04-13 23:18:02,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:18:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:02,683 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 23:18:02,684 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 23:18:02,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:18:02,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:02,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:18:02,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:02,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 23:18:02,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:03,250 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 23:18:03,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:20,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 23:18:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135613799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:20,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2025-04-13 23:18:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284399451] [2025-04-13 23:18:20,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:20,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:18:20,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:20,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:18:20,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=375, Unknown=4, NotChecked=0, Total=462 [2025-04-13 23:18:20,762 INFO L87 Difference]: Start difference. First operand 2308 states and 8169 transitions. Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:57,958 WARN L286 SmtUtils]: Spent 23.89s on a formula simplification. DAG size of input: 97 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:19:02,866 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 23:19:06,869 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 23:19:10,872 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 23:19:14,876 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 23:19:18,879 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 23:19:22,882 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 23:19:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:27,958 INFO L93 Difference]: Finished difference Result 8528 states and 29142 transitions. [2025-04-13 23:19:27,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-04-13 23:19:27,959 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:19:27,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:27,992 INFO L225 Difference]: With dead ends: 8528 [2025-04-13 23:19:27,992 INFO L226 Difference]: Without dead ends: 7051 [2025-04-13 23:19:27,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=1573, Invalid=9135, Unknown=4, NotChecked=0, Total=10712 [2025-04-13 23:19:27,997 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 922 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 81 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:27,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 629 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3091 Invalid, 6 Unknown, 0 Unchecked, 28.7s Time] [2025-04-13 23:19:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7051 states. [2025-04-13 23:19:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7051 to 3524. [2025-04-13 23:19:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 3523 states have (on average 3.6162361623616235) internal successors, (12740), 3523 states have internal predecessors, (12740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 12740 transitions. [2025-04-13 23:19:29,092 INFO L79 Accepts]: Start accepts. Automaton has 3524 states and 12740 transitions. Word has length 27 [2025-04-13 23:19:29,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:29,092 INFO L485 AbstractCegarLoop]: Abstraction has 3524 states and 12740 transitions. [2025-04-13 23:19:29,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:29,092 INFO L278 IsEmpty]: Start isEmpty. Operand 3524 states and 12740 transitions. [2025-04-13 23:19:29,100 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:19:29,100 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:29,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:29,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:19:29,300 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,SelfDestructingSolverStorable8 [2025-04-13 23:19:29,301 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:29,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1866792306, now seen corresponding path program 1 times [2025-04-13 23:19:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:29,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523401555] [2025-04-13 23:19:29,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:19:29,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:19:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:31,697 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 23:19:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:31,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523401555] [2025-04-13 23:19:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523401555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:31,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309169949] [2025-04-13 23:19:31,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:31,699 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 23:19:31,700 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 23:19:31,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:19:31,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:19:31,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:31,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:31,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 23:19:31,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:32,475 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 23:19:32,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:36,866 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 23:19:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309169949] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:36,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:36,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2025-04-13 23:19:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146077632] [2025-04-13 23:19:36,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:36,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:19:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:19:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:19:36,867 INFO L87 Difference]: Start difference. First operand 3524 states and 12740 transitions. Second operand has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:55,900 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:20:17,533 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 23:20:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:19,246 INFO L93 Difference]: Finished difference Result 12560 states and 43506 transitions. [2025-04-13 23:20:19,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-13 23:20:19,246 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 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 23:20:19,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:19,283 INFO L225 Difference]: With dead ends: 12560 [2025-04-13 23:20:19,283 INFO L226 Difference]: Without dead ends: 11568 [2025-04-13 23:20:19,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5303 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=2711, Invalid=12541, Unknown=0, NotChecked=0, Total=15252 [2025-04-13 23:20:19,292 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 987 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 148 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:19,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 752 Invalid, 3473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3324 Invalid, 1 Unknown, 0 Unchecked, 13.9s Time] [2025-04-13 23:20:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11568 states. [2025-04-13 23:20:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11568 to 4320. [2025-04-13 23:20:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 4319 states have (on average 3.652234313498495) internal successors, (15774), 4319 states have internal predecessors, (15774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 15774 transitions. [2025-04-13 23:20:20,930 INFO L79 Accepts]: Start accepts. Automaton has 4320 states and 15774 transitions. Word has length 30 [2025-04-13 23:20:20,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:20,931 INFO L485 AbstractCegarLoop]: Abstraction has 4320 states and 15774 transitions. [2025-04-13 23:20:20,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:20,931 INFO L278 IsEmpty]: Start isEmpty. Operand 4320 states and 15774 transitions. [2025-04-13 23:20:20,940 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:20:20,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:20,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:20,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:20:21,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:21,142 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:21,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 641593104, now seen corresponding path program 1 times [2025-04-13 23:20:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:21,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146318167] [2025-04-13 23:20:21,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:21,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:20:21,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:20:21,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:20:21,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:21,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146318167] [2025-04-13 23:20:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146318167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:21,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:21,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:20:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414045485] [2025-04-13 23:20:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:21,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:20:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:21,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:20:21,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:20:21,251 INFO L87 Difference]: Start difference. First operand 4320 states and 15774 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:23,495 INFO L93 Difference]: Finished difference Result 5200 states and 18707 transitions. [2025-04-13 23:20:23,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:20:23,496 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:20:23,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:23,513 INFO L225 Difference]: With dead ends: 5200 [2025-04-13 23:20:23,514 INFO L226 Difference]: Without dead ends: 4710 [2025-04-13 23:20:23,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:20:23,517 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:23,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 22 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2025-04-13 23:20:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 4404. [2025-04-13 23:20:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4403 states have (on average 3.650011355893709) internal successors, (16071), 4403 states have internal predecessors, (16071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 16071 transitions. [2025-04-13 23:20:25,264 INFO L79 Accepts]: Start accepts. Automaton has 4404 states and 16071 transitions. Word has length 30 [2025-04-13 23:20:25,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:25,264 INFO L485 AbstractCegarLoop]: Abstraction has 4404 states and 16071 transitions. [2025-04-13 23:20:25,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:25,265 INFO L278 IsEmpty]: Start isEmpty. Operand 4404 states and 16071 transitions. [2025-04-13 23:20:25,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:20:25,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:25,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:25,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:20:25,271 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:25,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1473754254, now seen corresponding path program 2 times [2025-04-13 23:20:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:25,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027977991] [2025-04-13 23:20:25,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:20:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:25,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:20:25,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:20:25,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:20:25,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:26,309 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 23:20:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:26,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027977991] [2025-04-13 23:20:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027977991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:26,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795303628] [2025-04-13 23:20:26,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:20:26,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:26,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:26,312 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 23:20:26,313 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 23:20:26,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:20:26,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:20:26,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:20:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:26,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:20:26,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:27,182 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 23:20:27,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:27,935 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 23:20:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795303628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:20:27,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:20:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2025-04-13 23:20:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876732858] [2025-04-13 23:20:27,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:20:27,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:20:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:27,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:20:27,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:20:27,936 INFO L87 Difference]: Start difference. First operand 4404 states and 16071 transitions. Second operand has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:58,101 INFO L93 Difference]: Finished difference Result 13254 states and 47395 transitions. [2025-04-13 23:20:58,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 23:20:58,101 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 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 23:20:58,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:58,136 INFO L225 Difference]: With dead ends: 13254 [2025-04-13 23:20:58,136 INFO L226 Difference]: Without dead ends: 12700 [2025-04-13 23:20:58,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7116 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3743, Invalid=18013, Unknown=0, NotChecked=0, Total=21756 [2025-04-13 23:20:58,145 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 957 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 5480 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 5566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:58,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1050 Invalid, 5566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5480 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-04-13 23:20:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12700 states. [2025-04-13 23:21:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12700 to 5176. [2025-04-13 23:21:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5176 states, 5175 states have (on average 3.687536231884058) internal successors, (19083), 5175 states have internal predecessors, (19083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 19083 transitions. [2025-04-13 23:21:00,390 INFO L79 Accepts]: Start accepts. Automaton has 5176 states and 19083 transitions. Word has length 30 [2025-04-13 23:21:00,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:00,390 INFO L485 AbstractCegarLoop]: Abstraction has 5176 states and 19083 transitions. [2025-04-13 23:21:00,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:00,390 INFO L278 IsEmpty]: Start isEmpty. Operand 5176 states and 19083 transitions. [2025-04-13 23:21:00,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:21:00,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:00,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:21:00,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:21:00,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:00,600 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:21:00,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 722992160, now seen corresponding path program 3 times [2025-04-13 23:21:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:00,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154956944] [2025-04-13 23:21:00,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:21:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:00,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:21:00,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-04-13 23:21:00,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:21:00,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:21:00,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:00,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154956944] [2025-04-13 23:21:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154956944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:21:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:21:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:21:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361482379] [2025-04-13 23:21:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:21:00,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:21:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:00,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:21:00,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:21:00,708 INFO L87 Difference]: Start difference. First operand 5176 states and 19083 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:21:04,333 INFO L93 Difference]: Finished difference Result 7065 states and 25936 transitions. [2025-04-13 23:21:04,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:21:04,334 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:21:04,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:21:04,354 INFO L225 Difference]: With dead ends: 7065 [2025-04-13 23:21:04,354 INFO L226 Difference]: Without dead ends: 6709 [2025-04-13 23:21:04,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:21:04,357 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:21:04,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 42 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:21:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2025-04-13 23:21:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 4890. [2025-04-13 23:21:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4889 states have (on average 3.690529760687257) internal successors, (18043), 4889 states have internal predecessors, (18043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 18043 transitions. [2025-04-13 23:21:06,532 INFO L79 Accepts]: Start accepts. Automaton has 4890 states and 18043 transitions. Word has length 30 [2025-04-13 23:21:06,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:06,532 INFO L485 AbstractCegarLoop]: Abstraction has 4890 states and 18043 transitions. [2025-04-13 23:21:06,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:06,533 INFO L278 IsEmpty]: Start isEmpty. Operand 4890 states and 18043 transitions. [2025-04-13 23:21:06,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:21:06,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:06,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:21:06,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:21:06,541 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:21:06,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash 465174056, now seen corresponding path program 4 times [2025-04-13 23:21:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:06,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474714463] [2025-04-13 23:21:06,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:21:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:06,545 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:21:06,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:21:06,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:21:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:07,227 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 23:21:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:07,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474714463] [2025-04-13 23:21:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474714463] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:21:07,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302586037] [2025-04-13 23:21:07,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:21:07,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:21:07,229 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 23:21:07,233 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 23:21:07,258 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:21:07,355 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:21:07,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:21:07,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:07,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 23:21:07,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:21:08,131 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 23:21:08,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:21:23,780 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 23:21:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302586037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:21:23,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:21:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2025-04-13 23:21:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854931937] [2025-04-13 23:21:23,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:21:23,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:21:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:23,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:21:23,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=543, Unknown=1, NotChecked=0, Total=702 [2025-04-13 23:21:23,781 INFO L87 Difference]: Start difference. First operand 4890 states and 18043 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:09,863 INFO L93 Difference]: Finished difference Result 11517 states and 41350 transitions. [2025-04-13 23:22:09,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-13 23:22:09,864 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 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 23:22:09,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:09,894 INFO L225 Difference]: With dead ends: 11517 [2025-04-13 23:22:09,894 INFO L226 Difference]: Without dead ends: 10960 [2025-04-13 23:22:09,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4000 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=1941, Invalid=9610, Unknown=5, NotChecked=0, Total=11556 [2025-04-13 23:22:09,899 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 544 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 3346 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:09,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 716 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3346 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-04-13 23:22:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10960 states. [2025-04-13 23:22:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10960 to 5460. [2025-04-13 23:22:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 3.697014105147463) internal successors, (20182), 5459 states have internal predecessors, (20182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 20182 transitions. [2025-04-13 23:22:12,443 INFO L79 Accepts]: Start accepts. Automaton has 5460 states and 20182 transitions. Word has length 30 [2025-04-13 23:22:12,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:12,443 INFO L485 AbstractCegarLoop]: Abstraction has 5460 states and 20182 transitions. [2025-04-13 23:22:12,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:12,443 INFO L278 IsEmpty]: Start isEmpty. Operand 5460 states and 20182 transitions. [2025-04-13 23:22:12,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:22:12,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:12,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:12,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:22:12,654 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,SelfDestructingSolverStorable13 [2025-04-13 23:22:12,654 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:22:12,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 731861954, now seen corresponding path program 5 times [2025-04-13 23:22:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:12,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059725524] [2025-04-13 23:22:12,655 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:12,661 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:22:12,673 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:22:12,678 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:13,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059725524] [2025-04-13 23:22:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059725524] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:22:13,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001124964] [2025-04-13 23:22:13,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:13,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:13,213 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 23:22:13,214 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 23:22:13,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:22:13,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:22:13,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:13,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 23:22:13,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:22:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:13,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:22:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001124964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:22:26,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:22:26,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-04-13 23:22:26,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021869588] [2025-04-13 23:22:26,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:22:26,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:22:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:26,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:22:26,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=460, Unknown=3, NotChecked=0, Total=600 [2025-04-13 23:22:26,823 INFO L87 Difference]: Start difference. First operand 5460 states and 20182 transitions. Second operand has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:12,119 WARN L286 SmtUtils]: Spent 32.15s on a formula simplification. DAG size of input: 82 DAG size of output: 66 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:23:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:40,608 INFO L93 Difference]: Finished difference Result 14720 states and 52720 transitions. [2025-04-13 23:23:40,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 23:23:40,608 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 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 23:23:40,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:40,650 INFO L225 Difference]: With dead ends: 14720 [2025-04-13 23:23:40,650 INFO L226 Difference]: Without dead ends: 13829 [2025-04-13 23:23:40,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=1682, Invalid=6321, Unknown=7, NotChecked=0, Total=8010 [2025-04-13 23:23:40,656 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 715 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:40,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 532 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 23:23:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2025-04-13 23:23:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 6562. [2025-04-13 23:23:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 3.719250114311843) internal successors, (24402), 6561 states have internal predecessors, (24402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 24402 transitions. [2025-04-13 23:23:43,869 INFO L79 Accepts]: Start accepts. Automaton has 6562 states and 24402 transitions. Word has length 30 [2025-04-13 23:23:43,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:43,870 INFO L485 AbstractCegarLoop]: Abstraction has 6562 states and 24402 transitions. [2025-04-13 23:23:43,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:43,870 INFO L278 IsEmpty]: Start isEmpty. Operand 6562 states and 24402 transitions. [2025-04-13 23:23:43,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 23:23:43,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:43,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:43,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:23:44,082 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,SelfDestructingSolverStorable14 [2025-04-13 23:23:44,082 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:23:44,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 321185297, now seen corresponding path program 4 times [2025-04-13 23:23:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:44,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401220711] [2025-04-13 23:23:44,083 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:44,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 23:23:44,090 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:23:44,090 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:44,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:44,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401220711] [2025-04-13 23:23:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401220711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:44,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473825953] [2025-04-13 23:23:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:44,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:23:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:44,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:23:44,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:23:44,162 INFO L87 Difference]: Start difference. First operand 6562 states and 24402 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:50,184 INFO L93 Difference]: Finished difference Result 9096 states and 33973 transitions. [2025-04-13 23:23:50,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:50,184 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-04-13 23:23:50,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:50,217 INFO L225 Difference]: With dead ends: 9096 [2025-04-13 23:23:50,217 INFO L226 Difference]: Without dead ends: 8970 [2025-04-13 23:23:50,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:23:50,221 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:50,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 36 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2025-04-13 23:23:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 5662. [2025-04-13 23:23:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5662 states, 5661 states have (on average 3.735735735735736) internal successors, (21148), 5661 states have internal predecessors, (21148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5662 states to 5662 states and 21148 transitions. [2025-04-13 23:23:53,377 INFO L79 Accepts]: Start accepts. Automaton has 5662 states and 21148 transitions. Word has length 31 [2025-04-13 23:23:53,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:53,377 INFO L485 AbstractCegarLoop]: Abstraction has 5662 states and 21148 transitions. [2025-04-13 23:23:53,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:53,377 INFO L278 IsEmpty]: Start isEmpty. Operand 5662 states and 21148 transitions. [2025-04-13 23:23:53,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 23:23:53,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:53,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:53,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:23:53,389 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:23:53,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -949233325, now seen corresponding path program 6 times [2025-04-13 23:23:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:53,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193230432] [2025-04-13 23:23:53,389 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:53,393 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 23:23:53,407 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:23:53,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:53,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:54,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193230432] [2025-04-13 23:23:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193230432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:54,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604092098] [2025-04-13 23:23:54,486 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:54,489 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 23:23:54,490 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 23:23:54,518 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 23:23:54,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:23:54,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:23:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:54,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:23:54,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:55,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604092098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:56,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:56,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 33 [2025-04-13 23:23:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281687740] [2025-04-13 23:23:56,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:56,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:23:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:56,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:23:56,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:23:56,825 INFO L87 Difference]: Start difference. First operand 5662 states and 21148 transitions. Second operand has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:48,080 INFO L93 Difference]: Finished difference Result 17218 states and 61492 transitions. [2025-04-13 23:24:48,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2025-04-13 23:24:48,080 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2025-04-13 23:24:48,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:48,130 INFO L225 Difference]: With dead ends: 17218 [2025-04-13 23:24:48,130 INFO L226 Difference]: Without dead ends: 16707 [2025-04-13 23:24:48,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15754 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=6842, Invalid=36214, Unknown=0, NotChecked=0, Total=43056 [2025-04-13 23:24:48,136 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 1202 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 5426 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 5426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:48,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1140 Invalid, 5581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 5426 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-04-13 23:24:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16707 states. [2025-04-13 23:24:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16707 to 6688. [2025-04-13 23:24:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 3.775235531628533) internal successors, (25245), 6687 states have internal predecessors, (25245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 25245 transitions. [2025-04-13 23:24:51,996 INFO L79 Accepts]: Start accepts. Automaton has 6688 states and 25245 transitions. Word has length 31 [2025-04-13 23:24:51,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:51,996 INFO L485 AbstractCegarLoop]: Abstraction has 6688 states and 25245 transitions. [2025-04-13 23:24:51,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:51,996 INFO L278 IsEmpty]: Start isEmpty. Operand 6688 states and 25245 transitions. [2025-04-13 23:24:52,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:24:52,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:52,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:52,014 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 23:24:52,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:52,209 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:24:52,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1981344966, now seen corresponding path program 5 times [2025-04-13 23:24:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:52,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444299238] [2025-04-13 23:24:52,209 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:52,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:24:52,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:24:52,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:24:52,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:54,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444299238] [2025-04-13 23:24:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444299238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:24:54,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628789237] [2025-04-13 23:24:54,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:54,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:24:54,548 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 23:24:54,549 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 23:24:54,577 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:24:54,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:24:54,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:24:54,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:54,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:24:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:00,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628789237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:49,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2025-04-13 23:25:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580505727] [2025-04-13 23:25:49,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:49,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:25:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:49,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:25:49,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=695, Unknown=7, NotChecked=0, Total=870 [2025-04-13 23:25:49,114 INFO L87 Difference]: Start difference. First operand 6688 states and 25245 transitions. Second operand has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:17,999 WARN L286 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 99 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:26:49,315 WARN L286 SmtUtils]: Spent 28.91s on a formula simplification. DAG size of input: 135 DAG size of output: 87 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:27:05,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:27:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:53,743 INFO L93 Difference]: Finished difference Result 18002 states and 64247 transitions. [2025-04-13 23:27:53,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 23:27:53,744 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 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 33 [2025-04-13 23:27:53,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:53,800 INFO L225 Difference]: With dead ends: 18002 [2025-04-13 23:27:53,800 INFO L226 Difference]: Without dead ends: 15798 [2025-04-13 23:27:53,809 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3437 ImplicationChecksByTransitivity, 147.3s TimeCoverageRelationStatistics Valid=1788, Invalid=8506, Unknown=8, NotChecked=0, Total=10302 [2025-04-13 23:27:53,809 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 1212 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:53,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 780 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2025-04-13 23:27:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15798 states. [2025-04-13 23:27:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15798 to 8086. [2025-04-13 23:27:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8086 states, 8085 states have (on average 3.7982683982683985) internal successors, (30709), 8085 states have internal predecessors, (30709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 30709 transitions. [2025-04-13 23:27:59,657 INFO L79 Accepts]: Start accepts. Automaton has 8086 states and 30709 transitions. Word has length 33 [2025-04-13 23:27:59,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:59,657 INFO L485 AbstractCegarLoop]: Abstraction has 8086 states and 30709 transitions. [2025-04-13 23:27:59,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 29 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:59,657 INFO L278 IsEmpty]: Start isEmpty. Operand 8086 states and 30709 transitions. [2025-04-13 23:27:59,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:27:59,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:59,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:59,678 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 23:27:59,873 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,SelfDestructingSolverStorable17 [2025-04-13 23:27:59,873 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:27:59,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1480238744, now seen corresponding path program 2 times [2025-04-13 23:27:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:59,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335640846] [2025-04-13 23:27:59,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:59,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:27:59,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:27:59,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:27:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:00,956 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 23:28:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:00,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335640846] [2025-04-13 23:28:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335640846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:28:00,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424779858] [2025-04-13 23:28:00,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:28:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:28:00,958 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 23:28:00,959 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 23:28:00,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:28:01,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:28:01,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:28:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:28:01,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:28:02,105 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 23:28:02,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:28:04,516 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 23:28:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424779858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:28:04,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:28:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2025-04-13 23:28:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106221419] [2025-04-13 23:28:04,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:28:04,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:28:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:04,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:28:04,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:28:04,517 INFO L87 Difference]: Start difference. First operand 8086 states and 30709 transitions. Second operand has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:44,792 INFO L93 Difference]: Finished difference Result 16944 states and 61989 transitions. [2025-04-13 23:28:44,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:28:44,792 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 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 33 [2025-04-13 23:28:44,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:44,835 INFO L225 Difference]: With dead ends: 16944 [2025-04-13 23:28:44,835 INFO L226 Difference]: Without dead ends: 15514 [2025-04-13 23:28:44,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2630 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1396, Invalid=6794, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:28:44,840 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 855 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:44,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 488 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 23:28:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15514 states. [2025-04-13 23:28:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 8870. [2025-04-13 23:28:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8869 states have (on average 3.80651708197091) internal successors, (33760), 8869 states have internal predecessors, (33760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 33760 transitions. [2025-04-13 23:28:51,641 INFO L79 Accepts]: Start accepts. Automaton has 8870 states and 33760 transitions. Word has length 33 [2025-04-13 23:28:51,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:51,642 INFO L485 AbstractCegarLoop]: Abstraction has 8870 states and 33760 transitions. [2025-04-13 23:28:51,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:51,642 INFO L278 IsEmpty]: Start isEmpty. Operand 8870 states and 33760 transitions. [2025-04-13 23:28:51,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:28:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:51,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:51,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:28:51,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:28:51,858 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:28:51,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2059934016, now seen corresponding path program 3 times [2025-04-13 23:28:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:51,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926673171] [2025-04-13 23:28:51,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:51,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:28:51,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:28:51,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:28:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:53,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926673171] [2025-04-13 23:28:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926673171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:28:53,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038701973] [2025-04-13 23:28:53,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:28:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:28:53,078 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 23:28:53,078 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 23:28:53,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:28:53,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:28:53,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:28:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:53,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 23:28:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:28:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:54,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:28:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038701973] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:28:57,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:28:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2025-04-13 23:28:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054204120] [2025-04-13 23:28:57,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:28:57,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:28:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:28:57,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:28:57,036 INFO L87 Difference]: Start difference. First operand 8870 states and 33760 transitions. Second operand has 29 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:10,908 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 23:29:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:43,680 INFO L93 Difference]: Finished difference Result 18233 states and 66184 transitions. [2025-04-13 23:29:43,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 23:29:43,680 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 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 33 [2025-04-13 23:29:43,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:43,744 INFO L225 Difference]: With dead ends: 18233 [2025-04-13 23:29:43,744 INFO L226 Difference]: Without dead ends: 16907 [2025-04-13 23:29:43,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=1540, Invalid=7016, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:29:43,752 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 968 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 116 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:43,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 594 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2540 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2025-04-13 23:29:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2025-04-13 23:29:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 9470. [2025-04-13 23:29:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9470 states, 9469 states have (on average 3.814975182173408) internal successors, (36124), 9469 states have internal predecessors, (36124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9470 states to 9470 states and 36124 transitions. [2025-04-13 23:29:51,756 INFO L79 Accepts]: Start accepts. Automaton has 9470 states and 36124 transitions. Word has length 33 [2025-04-13 23:29:51,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:51,756 INFO L485 AbstractCegarLoop]: Abstraction has 9470 states and 36124 transitions. [2025-04-13 23:29:51,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:51,756 INFO L278 IsEmpty]: Start isEmpty. Operand 9470 states and 36124 transitions. [2025-04-13 23:29:51,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:29:51,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:51,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:51,776 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 23:29:51,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:29:51,970 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:29:51,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1493868348, now seen corresponding path program 6 times [2025-04-13 23:29:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:51,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452641956] [2025-04-13 23:29:51,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:51,974 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:29:51,992 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:29:51,992 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:29:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:02,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452641956] [2025-04-13 23:30:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452641956] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:30:02,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082913419] [2025-04-13 23:30:02,281 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:30:02,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:30:02,283 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 23:30:02,283 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 23:30:02,311 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:30:02,394 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:30:02,394 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:30:02,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:02,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 23:30:02,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:30:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:08,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082913419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 32 [2025-04-13 23:31:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818918719] [2025-04-13 23:31:05,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:05,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:31:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:31:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=887, Unknown=11, NotChecked=0, Total=1122 [2025-04-13 23:31:05,692 INFO L87 Difference]: Start difference. First operand 9470 states and 36124 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:40,023 WARN L286 SmtUtils]: Spent 12.95s on a formula simplification. DAG size of input: 106 DAG size of output: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-13 23:31:51,149 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 23:31:51,149 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:31:52,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 23:31:52,350 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 23:31:52,362 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 23:31:52,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:31:52,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 103.6s TimeCoverageRelationStatistics Valid=659, Invalid=2987, Unknown=14, NotChecked=0, Total=3660 [2025-04-13 23:31:52,366 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 534 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:52,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 367 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 23:31:52,367 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:31:52,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 23:31:52,367 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (9470states) and FLOYD_HOARE automaton (currently 41 states, 34 states before enhancement),while executing Executor. [2025-04-13 23:31:52,368 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:31:52,368 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:31:52,368 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:31:52,370 INFO L422 BasicCegarLoop]: Path program histogram: [6, 6, 4, 3, 1, 1] [2025-04-13 23:31:52,372 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:31:52,373 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:31:52,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:31:52 BasicIcfg [2025-04-13 23:31:52,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:31:52,375 INFO L158 Benchmark]: Toolchain (without parser) took 859212.93ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 102.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 537.0MB. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.63ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 87.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.08ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: IcfgBuilder took 386.25ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.4MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 23:31:52,375 INFO L158 Benchmark]: TraceAbstraction took 858507.45ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 482.5MB. Max. memory is 8.0GB. [2025-04-13 23:31:52,376 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.63ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 87.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.08ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.52ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 386.25ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.4MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 858507.45ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 482.5MB. 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: 118]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (9470states) and FLOYD_HOARE automaton (currently 41 states, 34 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (9470states) and FLOYD_HOARE automaton (currently 41 states, 34 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (9470states) and FLOYD_HOARE automaton (currently 41 states, 34 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (9470states) and FLOYD_HOARE automaton (currently 41 states, 34 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 54 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 858.4s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.2s, AutomataDifference: 599.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 10298 SdHoareTripleChecker+Valid, 100.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10298 mSDsluCounter, 7899 SdHoareTripleChecker+Invalid, 95.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7295 mSDsCounter, 1032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36125 IncrementalHoareTripleChecker+Invalid, 37165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1032 mSolverCounterUnsat, 604 mSDtfsCounter, 36125 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1779 GetRequests, 506 SyntacticMatches, 9 SemanticMatches, 1263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52568 ImplicationChecksByTransitivity, 544.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9470occurred in iteration=20, InterpolantAutomatonStates: 1131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 75429 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 211.9s InterpolantComputationTime, 931 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 61266 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1628 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 43 InterpolantComputations, 10 PerfectInterpolantSequences, 8/89 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