/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-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:12:55,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:12:56,016 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:12:56,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:12:56,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:12:56,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:12:56,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:12:56,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:12:56,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:12:56,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:12:56,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:12:56,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:12:56,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:12:56,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:12:56,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:12:56,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:12:56,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:12:56,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:12:56,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:12:56,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:12:56,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:12:56,046 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:12:56,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:12:56,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:12:56,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:12:56,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:12:56,240 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:12:56,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-04-13 23:12:57,539 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcbcab65/a74e406c9f244d6ab41668807c50ebeb/FLAG498f49bf3 [2025-04-13 23:12:57,706 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:12:57,708 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-04-13 23:12:57,714 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcbcab65/a74e406c9f244d6ab41668807c50ebeb/FLAG498f49bf3 [2025-04-13 23:12:58,541 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dcbcab65/a74e406c9f244d6ab41668807c50ebeb [2025-04-13 23:12:58,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:12:58,544 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:12:58,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:12:58,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:12:58,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:12:58,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff552fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58, skipping insertion in model container [2025-04-13 23:12:58,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:12:58,701 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-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-04-13 23:12:58,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:12:58,712 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:12:58,732 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-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-04-13 23:12:58,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:12:58,743 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:12:58,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58 WrapperNode [2025-04-13 23:12:58,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:12:58,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:12:58,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:12:58,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:12:58,748 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:12:58" (1/1) ... [2025-04-13 23:12:58,755 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:12:58" (1/1) ... [2025-04-13 23:12:58,774 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-04-13 23:12:58,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:12:58,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:12:58,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:12:58,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:12:58,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,797 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:12:58,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:12:58,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:12:58,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:12:58,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:12:58,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (1/1) ... [2025-04-13 23:12:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:12:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:58,830 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:12:58,832 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:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:12:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:12:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:12:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 23:12:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 23:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:12:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:12:58,848 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:12:58,917 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:12:58,918 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:12:59,089 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:12:59,090 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:12:59,090 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:12:59,249 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:12:59,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:12:59 BoogieIcfgContainer [2025-04-13 23:12:59,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:12:59,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:12:59,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:12:59,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:12:59,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:12:58" (1/3) ... [2025-04-13 23:12:59,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d704f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:12:59, skipping insertion in model container [2025-04-13 23:12:59,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:12:58" (2/3) ... [2025-04-13 23:12:59,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d704f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:12:59, skipping insertion in model container [2025-04-13 23:12:59,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:12:59" (3/3) ... [2025-04-13 23:12:59,258 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-04-13 23:12:59,268 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:12:59,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c that has 5 procedures, 32 locations, 31 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 23:12:59,269 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:12:59,315 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 23:12:59,338 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 98 flow [2025-04-13 23:12:59,400 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 768 states, 767 states have (on average 4.229465449804433) internal successors, (3244), 767 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have 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:12:59,421 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:12:59,428 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;@448af11f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:12:59,428 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:12:59,432 INFO L278 IsEmpty]: Start isEmpty. Operand has 768 states, 767 states have (on average 4.229465449804433) internal successors, (3244), 767 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have 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:12:59,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:12:59,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:59,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] [2025-04-13 23:12:59,444 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 2 more)] === [2025-04-13 23:12:59,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -822924599, now seen corresponding path program 1 times [2025-04-13 23:12:59,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:59,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133842648] [2025-04-13 23:12:59,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:12:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:59,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:12:59,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:12:59,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:59,674 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:12:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:59,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133842648] [2025-04-13 23:12:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133842648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:12:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:12:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:12:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416359989] [2025-04-13 23:12:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:12:59,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:12:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:59,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:12:59,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:12:59,704 INFO L87 Difference]: Start difference. First operand has 768 states, 767 states have (on average 4.229465449804433) internal successors, (3244), 767 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:59,857 INFO L93 Difference]: Finished difference Result 2165 states and 9196 transitions. [2025-04-13 23:12:59,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:12:59,858 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:12:59,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:59,886 INFO L225 Difference]: With dead ends: 2165 [2025-04-13 23:12:59,886 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 23:12:59,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:12:59,897 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:59,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:12:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 23:13:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1402. [2025-04-13 23:13:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 4.0513918629550325) internal successors, (5676), 1401 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states have 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:13:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 5676 transitions. [2025-04-13 23:13:00,030 INFO L79 Accepts]: Start accepts. Automaton has 1402 states and 5676 transitions. Word has length 22 [2025-04-13 23:13:00,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:00,032 INFO L485 AbstractCegarLoop]: Abstraction has 1402 states and 5676 transitions. [2025-04-13 23:13:00,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:00,032 INFO L278 IsEmpty]: Start isEmpty. Operand 1402 states and 5676 transitions. [2025-04-13 23:13:00,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:00,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:00,038 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:13:00,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:13:00,038 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 2 more)] === [2025-04-13 23:13:00,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 394766599, now seen corresponding path program 1 times [2025-04-13 23:13:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:00,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39462530] [2025-04-13 23:13:00,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:00,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:13:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:00,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:00,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:00,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39462530] [2025-04-13 23:13:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39462530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:00,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864177042] [2025-04-13 23:13:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:00,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:00,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:00,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:00,249 INFO L87 Difference]: Start difference. First operand 1402 states and 5676 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:13:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:00,482 INFO L93 Difference]: Finished difference Result 2128 states and 8576 transitions. [2025-04-13 23:13:00,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:00,483 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:13:00,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:00,499 INFO L225 Difference]: With dead ends: 2128 [2025-04-13 23:13:00,499 INFO L226 Difference]: Without dead ends: 1902 [2025-04-13 23:13:00,500 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:13:00,501 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:00,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-04-13 23:13:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1632. [2025-04-13 23:13:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 4.099325567136726) internal successors, (6686), 1631 states have internal predecessors, (6686), 0 states have call successors, (0), 0 states have 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:13:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 6686 transitions. [2025-04-13 23:13:00,626 INFO L79 Accepts]: Start accepts. Automaton has 1632 states and 6686 transitions. Word has length 24 [2025-04-13 23:13:00,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:00,626 INFO L485 AbstractCegarLoop]: Abstraction has 1632 states and 6686 transitions. [2025-04-13 23:13:00,626 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:13:00,626 INFO L278 IsEmpty]: Start isEmpty. Operand 1632 states and 6686 transitions. [2025-04-13 23:13:00,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:00,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:00,631 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:13:00,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:13:00,631 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 2 more)] === [2025-04-13 23:13:00,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1485195147, now seen corresponding path program 1 times [2025-04-13 23:13:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:00,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273837318] [2025-04-13 23:13:00,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:00,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:13:00,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:00,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:00,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273837318] [2025-04-13 23:13:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273837318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121793346] [2025-04-13 23:13:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:00,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:00,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:00,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:00,760 INFO L87 Difference]: Start difference. First operand 1632 states and 6686 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:13:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:01,005 INFO L93 Difference]: Finished difference Result 2452 states and 9763 transitions. [2025-04-13 23:13:01,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:01,006 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:13:01,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:01,020 INFO L225 Difference]: With dead ends: 2452 [2025-04-13 23:13:01,020 INFO L226 Difference]: Without dead ends: 2190 [2025-04-13 23:13:01,021 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:13:01,021 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:01,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 27 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2025-04-13 23:13:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1678. [2025-04-13 23:13:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1677 states have (on average 4.143112701252236) internal successors, (6948), 1677 states have internal predecessors, (6948), 0 states have call successors, (0), 0 states have 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:13:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 6948 transitions. [2025-04-13 23:13:01,162 INFO L79 Accepts]: Start accepts. Automaton has 1678 states and 6948 transitions. Word has length 24 [2025-04-13 23:13:01,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:01,162 INFO L485 AbstractCegarLoop]: Abstraction has 1678 states and 6948 transitions. [2025-04-13 23:13:01,162 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:13:01,163 INFO L278 IsEmpty]: Start isEmpty. Operand 1678 states and 6948 transitions. [2025-04-13 23:13:01,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:01,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:01,168 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:13:01,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:13:01,168 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 2 more)] === [2025-04-13 23:13:01,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1931803611, now seen corresponding path program 2 times [2025-04-13 23:13:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:01,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347431999] [2025-04-13 23:13:01,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:01,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:13:01,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:01,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:13:01,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:01,249 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:13:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:01,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347431999] [2025-04-13 23:13:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347431999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:01,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:01,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781918301] [2025-04-13 23:13:01,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:01,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:01,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:01,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:01,251 INFO L87 Difference]: Start difference. First operand 1678 states and 6948 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:13:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:01,475 INFO L93 Difference]: Finished difference Result 2146 states and 8820 transitions. [2025-04-13 23:13:01,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:01,475 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:13:01,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:01,490 INFO L225 Difference]: With dead ends: 2146 [2025-04-13 23:13:01,490 INFO L226 Difference]: Without dead ends: 1928 [2025-04-13 23:13:01,491 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:13:01,492 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:01,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 24 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-04-13 23:13:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1618. [2025-04-13 23:13:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1617 states have (on average 4.112554112554113) internal successors, (6650), 1617 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have 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:13:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 6650 transitions. [2025-04-13 23:13:01,629 INFO L79 Accepts]: Start accepts. Automaton has 1618 states and 6650 transitions. Word has length 24 [2025-04-13 23:13:01,629 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:01,629 INFO L485 AbstractCegarLoop]: Abstraction has 1618 states and 6650 transitions. [2025-04-13 23:13:01,630 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:13:01,630 INFO L278 IsEmpty]: Start isEmpty. Operand 1618 states and 6650 transitions. [2025-04-13 23:13:01,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:01,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:01,634 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:13:01,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:13:01,635 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 2 more)] === [2025-04-13 23:13:01,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1177632321, now seen corresponding path program 2 times [2025-04-13 23:13:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:01,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787715563] [2025-04-13 23:13:01,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:01,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:13:01,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:01,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:01,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787715563] [2025-04-13 23:13:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787715563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912301584] [2025-04-13 23:13:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:01,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:01,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:01,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:01,706 INFO L87 Difference]: Start difference. First operand 1618 states and 6650 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:13:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:01,885 INFO L93 Difference]: Finished difference Result 2036 states and 8048 transitions. [2025-04-13 23:13:01,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:01,886 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:13:01,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:01,898 INFO L225 Difference]: With dead ends: 2036 [2025-04-13 23:13:01,898 INFO L226 Difference]: Without dead ends: 1792 [2025-04-13 23:13:01,899 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:13:01,899 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:01,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-04-13 23:13:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1558. [2025-04-13 23:13:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1557 states have (on average 4.122029543994862) internal successors, (6418), 1557 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have 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:13:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 6418 transitions. [2025-04-13 23:13:01,998 INFO L79 Accepts]: Start accepts. Automaton has 1558 states and 6418 transitions. Word has length 24 [2025-04-13 23:13:01,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:01,999 INFO L485 AbstractCegarLoop]: Abstraction has 1558 states and 6418 transitions. [2025-04-13 23:13:01,999 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:13:01,999 INFO L278 IsEmpty]: Start isEmpty. Operand 1558 states and 6418 transitions. [2025-04-13 23:13:02,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:02,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:02,003 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:13:02,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:13:02,003 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 2 more)] === [2025-04-13 23:13:02,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1576104007, now seen corresponding path program 3 times [2025-04-13 23:13:02,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:02,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335804885] [2025-04-13 23:13:02,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:02,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:13:02,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:02,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:02,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335804885] [2025-04-13 23:13:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335804885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782552071] [2025-04-13 23:13:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:02,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:02,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:02,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:02,085 INFO L87 Difference]: Start difference. First operand 1558 states and 6418 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:13:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:02,272 INFO L93 Difference]: Finished difference Result 2537 states and 10333 transitions. [2025-04-13 23:13:02,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:02,272 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:13:02,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:02,287 INFO L225 Difference]: With dead ends: 2537 [2025-04-13 23:13:02,287 INFO L226 Difference]: Without dead ends: 2329 [2025-04-13 23:13:02,288 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:13:02,290 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:02,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 27 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-04-13 23:13:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1738. [2025-04-13 23:13:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 4.194012665515256) internal successors, (7285), 1737 states have internal predecessors, (7285), 0 states have call successors, (0), 0 states have 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:13:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 7285 transitions. [2025-04-13 23:13:02,406 INFO L79 Accepts]: Start accepts. Automaton has 1738 states and 7285 transitions. Word has length 24 [2025-04-13 23:13:02,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:02,406 INFO L485 AbstractCegarLoop]: Abstraction has 1738 states and 7285 transitions. [2025-04-13 23:13:02,406 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:13:02,407 INFO L278 IsEmpty]: Start isEmpty. Operand 1738 states and 7285 transitions. [2025-04-13 23:13:02,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:02,412 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:13:02,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:13:02,412 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 2 more)] === [2025-04-13 23:13:02,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1803475191, now seen corresponding path program 4 times [2025-04-13 23:13:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:02,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883904643] [2025-04-13 23:13:02,413 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:02,418 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:13:02,424 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:13:02,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:02,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:02,472 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:13:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:02,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883904643] [2025-04-13 23:13:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883904643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:02,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492898073] [2025-04-13 23:13:02,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:02,477 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:13:02,479 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:13:02,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:13:02,532 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:13:02,532 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:02,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:02,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:13:02,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:02,674 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:13:02,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492898073] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:02,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:13:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-04-13 23:13:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179150304] [2025-04-13 23:13:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:02,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:02,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:02,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:02,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:13:02,755 INFO L87 Difference]: Start difference. First operand 1738 states and 7285 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:13:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:02,988 INFO L93 Difference]: Finished difference Result 2074 states and 8495 transitions. [2025-04-13 23:13:02,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:02,989 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:13:02,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:03,007 INFO L225 Difference]: With dead ends: 2074 [2025-04-13 23:13:03,008 INFO L226 Difference]: Without dead ends: 1922 [2025-04-13 23:13:03,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:13:03,009 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:03,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 25 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-04-13 23:13:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1528. [2025-04-13 23:13:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 4.165029469548133) internal successors, (6360), 1527 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have 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:13:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 6360 transitions. [2025-04-13 23:13:03,183 INFO L79 Accepts]: Start accepts. Automaton has 1528 states and 6360 transitions. Word has length 24 [2025-04-13 23:13:03,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:03,184 INFO L485 AbstractCegarLoop]: Abstraction has 1528 states and 6360 transitions. [2025-04-13 23:13:03,184 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:13:03,184 INFO L278 IsEmpty]: Start isEmpty. Operand 1528 states and 6360 transitions. [2025-04-13 23:13:03,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:13:03,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:03,188 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] [2025-04-13 23:13:03,194 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:13:03,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:03,389 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 2 more)] === [2025-04-13 23:13:03,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1572902553, now seen corresponding path program 1 times [2025-04-13 23:13:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:03,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849574225] [2025-04-13 23:13:03,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:03,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:13:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:13:03,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:03,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:03,477 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:13:03,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:03,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849574225] [2025-04-13 23:13:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849574225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:03,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:03,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998112841] [2025-04-13 23:13:03,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:03,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:13:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:03,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:13:03,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:13:03,479 INFO L87 Difference]: Start difference. First operand 1528 states and 6360 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:13:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:03,717 INFO L93 Difference]: Finished difference Result 2347 states and 9754 transitions. [2025-04-13 23:13:03,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:03,718 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:13:03,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:03,728 INFO L225 Difference]: With dead ends: 2347 [2025-04-13 23:13:03,728 INFO L226 Difference]: Without dead ends: 2191 [2025-04-13 23:13:03,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:03,729 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:03,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 37 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2025-04-13 23:13:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1619. [2025-04-13 23:13:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1618 states have (on average 4.139060568603214) internal successors, (6697), 1618 states have internal predecessors, (6697), 0 states have call successors, (0), 0 states have 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:13:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 6697 transitions. [2025-04-13 23:13:03,859 INFO L79 Accepts]: Start accepts. Automaton has 1619 states and 6697 transitions. Word has length 26 [2025-04-13 23:13:03,859 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:03,859 INFO L485 AbstractCegarLoop]: Abstraction has 1619 states and 6697 transitions. [2025-04-13 23:13:03,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:13:03,859 INFO L278 IsEmpty]: Start isEmpty. Operand 1619 states and 6697 transitions. [2025-04-13 23:13:03,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:13:03,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:03,862 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] [2025-04-13 23:13:03,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:13:03,863 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 2 more)] === [2025-04-13 23:13:03,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -260361791, now seen corresponding path program 2 times [2025-04-13 23:13:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:03,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-13 23:13:03,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:03,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:13:03,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:13:03,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:03,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:03,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-13 23:13:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437162506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352216958] [2025-04-13 23:13:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:03,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:03,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:03,934 INFO L87 Difference]: Start difference. First operand 1619 states and 6697 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:13:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:04,099 INFO L93 Difference]: Finished difference Result 1972 states and 8081 transitions. [2025-04-13 23:13:04,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:04,099 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:13:04,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:04,107 INFO L225 Difference]: With dead ends: 1972 [2025-04-13 23:13:04,107 INFO L226 Difference]: Without dead ends: 1678 [2025-04-13 23:13:04,108 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:13:04,108 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:04,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-04-13 23:13:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1436. [2025-04-13 23:13:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 4.114285714285714) internal successors, (5904), 1435 states have internal predecessors, (5904), 0 states have call successors, (0), 0 states have 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:13:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 5904 transitions. [2025-04-13 23:13:04,204 INFO L79 Accepts]: Start accepts. Automaton has 1436 states and 5904 transitions. Word has length 26 [2025-04-13 23:13:04,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:04,205 INFO L485 AbstractCegarLoop]: Abstraction has 1436 states and 5904 transitions. [2025-04-13 23:13:04,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:13:04,205 INFO L278 IsEmpty]: Start isEmpty. Operand 1436 states and 5904 transitions. [2025-04-13 23:13:04,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:04,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:04,208 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] [2025-04-13 23:13:04,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:13:04,208 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 2 more)] === [2025-04-13 23:13:04,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -315425751, now seen corresponding path program 1 times [2025-04-13 23:13:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:04,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539212208] [2025-04-13 23:13:04,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:13:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:13:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:04,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:04,290 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:13:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:04,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539212208] [2025-04-13 23:13:04,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539212208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:04,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:04,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37747562] [2025-04-13 23:13:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:04,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:13:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:04,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:13:04,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:13:04,291 INFO L87 Difference]: Start difference. First operand 1436 states and 5904 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:04,523 INFO L93 Difference]: Finished difference Result 2442 states and 10025 transitions. [2025-04-13 23:13:04,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:04,523 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:04,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:04,533 INFO L225 Difference]: With dead ends: 2442 [2025-04-13 23:13:04,533 INFO L226 Difference]: Without dead ends: 2232 [2025-04-13 23:13:04,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:04,534 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:04,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 32 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-04-13 23:13:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1616. [2025-04-13 23:13:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 4.176470588235294) internal successors, (6745), 1615 states have internal predecessors, (6745), 0 states have call successors, (0), 0 states have 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:13:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 6745 transitions. [2025-04-13 23:13:04,648 INFO L79 Accepts]: Start accepts. Automaton has 1616 states and 6745 transitions. Word has length 28 [2025-04-13 23:13:04,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:04,648 INFO L485 AbstractCegarLoop]: Abstraction has 1616 states and 6745 transitions. [2025-04-13 23:13:04,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:04,648 INFO L278 IsEmpty]: Start isEmpty. Operand 1616 states and 6745 transitions. [2025-04-13 23:13:04,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:04,652 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] [2025-04-13 23:13:04,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:13:04,653 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 2 more)] === [2025-04-13 23:13:04,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 976861175, now seen corresponding path program 1 times [2025-04-13 23:13:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:04,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235015323] [2025-04-13 23:13:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:04,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:13:04,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:13:04,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:04,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:04,722 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:13:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:04,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235015323] [2025-04-13 23:13:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235015323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:04,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933542864] [2025-04-13 23:13:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:04,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:13:04,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:04,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:13:04,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:13:04,724 INFO L87 Difference]: Start difference. First operand 1616 states and 6745 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:05,046 INFO L93 Difference]: Finished difference Result 2438 states and 10122 transitions. [2025-04-13 23:13:05,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:05,046 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:05,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:05,056 INFO L225 Difference]: With dead ends: 2438 [2025-04-13 23:13:05,056 INFO L226 Difference]: Without dead ends: 2295 [2025-04-13 23:13:05,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:05,058 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:05,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 36 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-04-13 23:13:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1826. [2025-04-13 23:13:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 4.235068493150685) internal successors, (7729), 1825 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have 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:13:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 7729 transitions. [2025-04-13 23:13:05,213 INFO L79 Accepts]: Start accepts. Automaton has 1826 states and 7729 transitions. Word has length 28 [2025-04-13 23:13:05,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:05,213 INFO L485 AbstractCegarLoop]: Abstraction has 1826 states and 7729 transitions. [2025-04-13 23:13:05,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:05,213 INFO L278 IsEmpty]: Start isEmpty. Operand 1826 states and 7729 transitions. [2025-04-13 23:13:05,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:05,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:05,216 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] [2025-04-13 23:13:05,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:13:05,216 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 2 more)] === [2025-04-13 23:13:05,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1852310205, now seen corresponding path program 2 times [2025-04-13 23:13:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:05,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94075663] [2025-04-13 23:13:05,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:05,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:05,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:13:05,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:05,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:05,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:05,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94075663] [2025-04-13 23:13:05,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94075663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:05,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:05,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792058193] [2025-04-13 23:13:05,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:05,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:05,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:05,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:05,270 INFO L87 Difference]: Start difference. First operand 1826 states and 7729 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:05,527 INFO L93 Difference]: Finished difference Result 2283 states and 9496 transitions. [2025-04-13 23:13:05,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:05,527 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:05,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:05,534 INFO L225 Difference]: With dead ends: 2283 [2025-04-13 23:13:05,535 INFO L226 Difference]: Without dead ends: 1899 [2025-04-13 23:13:05,536 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:13:05,536 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:05,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 23 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-04-13 23:13:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1719. [2025-04-13 23:13:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 4.2491268917345755) internal successors, (7300), 1718 states have internal predecessors, (7300), 0 states have call successors, (0), 0 states have 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:13:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 7300 transitions. [2025-04-13 23:13:05,662 INFO L79 Accepts]: Start accepts. Automaton has 1719 states and 7300 transitions. Word has length 28 [2025-04-13 23:13:05,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:05,662 INFO L485 AbstractCegarLoop]: Abstraction has 1719 states and 7300 transitions. [2025-04-13 23:13:05,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:05,662 INFO L278 IsEmpty]: Start isEmpty. Operand 1719 states and 7300 transitions. [2025-04-13 23:13:05,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:05,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:05,666 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] [2025-04-13 23:13:05,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:13:05,666 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 2 more)] === [2025-04-13 23:13:05,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1799103503, now seen corresponding path program 2 times [2025-04-13 23:13:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:05,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735708373] [2025-04-13 23:13:05,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:05,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:05,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 23:13:05,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:13:05,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:05,730 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:13:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:05,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735708373] [2025-04-13 23:13:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735708373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489936230] [2025-04-13 23:13:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:05,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:05,731 INFO L87 Difference]: Start difference. First operand 1719 states and 7300 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:05,972 INFO L93 Difference]: Finished difference Result 2189 states and 9073 transitions. [2025-04-13 23:13:05,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:05,972 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:05,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:05,980 INFO L225 Difference]: With dead ends: 2189 [2025-04-13 23:13:05,980 INFO L226 Difference]: Without dead ends: 2070 [2025-04-13 23:13:05,981 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:13:05,982 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:05,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-04-13 23:13:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1747. [2025-04-13 23:13:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1746 states have (on average 4.24971363115693) internal successors, (7420), 1746 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have 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:13:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 7420 transitions. [2025-04-13 23:13:06,123 INFO L79 Accepts]: Start accepts. Automaton has 1747 states and 7420 transitions. Word has length 28 [2025-04-13 23:13:06,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:06,123 INFO L485 AbstractCegarLoop]: Abstraction has 1747 states and 7420 transitions. [2025-04-13 23:13:06,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:06,123 INFO L278 IsEmpty]: Start isEmpty. Operand 1747 states and 7420 transitions. [2025-04-13 23:13:06,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:06,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:06,127 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] [2025-04-13 23:13:06,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:13:06,127 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 2 more)] === [2025-04-13 23:13:06,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash 330521555, now seen corresponding path program 3 times [2025-04-13 23:13:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:06,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434665401] [2025-04-13 23:13:06,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:06,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:06,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:06,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 23:13:06,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:13:06,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:06,173 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:13:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:06,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434665401] [2025-04-13 23:13:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434665401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:06,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860856804] [2025-04-13 23:13:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:06,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:13:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:06,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:13:06,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:13:06,174 INFO L87 Difference]: Start difference. First operand 1747 states and 7420 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:06,453 INFO L93 Difference]: Finished difference Result 2296 states and 9416 transitions. [2025-04-13 23:13:06,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:06,453 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:06,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:06,462 INFO L225 Difference]: With dead ends: 2296 [2025-04-13 23:13:06,462 INFO L226 Difference]: Without dead ends: 2183 [2025-04-13 23:13:06,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:06,463 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:06,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 42 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-04-13 23:13:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1719. [2025-04-13 23:13:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 4.222351571594878) internal successors, (7254), 1718 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have 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:13:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 7254 transitions. [2025-04-13 23:13:06,596 INFO L79 Accepts]: Start accepts. Automaton has 1719 states and 7254 transitions. Word has length 28 [2025-04-13 23:13:06,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:06,596 INFO L485 AbstractCegarLoop]: Abstraction has 1719 states and 7254 transitions. [2025-04-13 23:13:06,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:06,596 INFO L278 IsEmpty]: Start isEmpty. Operand 1719 states and 7254 transitions. [2025-04-13 23:13:06,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:06,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:06,600 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] [2025-04-13 23:13:06,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:13:06,600 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 2 more)] === [2025-04-13 23:13:06,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1191718763, now seen corresponding path program 4 times [2025-04-13 23:13:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:06,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913283112] [2025-04-13 23:13:06,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:06,605 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:06,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:13:06,608 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:06,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913283112] [2025-04-13 23:13:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913283112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:06,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280811401] [2025-04-13 23:13:06,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:06,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:06,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:06,639 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:13:06,640 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:13:06,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:06,707 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:13:06,708 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:06,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:13:06,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:06,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280811401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:06,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-13 23:13:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128667076] [2025-04-13 23:13:06,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:06,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:06,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:06,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:06,768 INFO L87 Difference]: Start difference. First operand 1719 states and 7254 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:07,375 INFO L93 Difference]: Finished difference Result 5470 states and 23468 transitions. [2025-04-13 23:13:07,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:07,375 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:07,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:07,391 INFO L225 Difference]: With dead ends: 5470 [2025-04-13 23:13:07,391 INFO L226 Difference]: Without dead ends: 4211 [2025-04-13 23:13:07,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:07,394 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:07,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2025-04-13 23:13:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3886. [2025-04-13 23:13:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3885 states have (on average 4.27001287001287) internal successors, (16589), 3885 states have internal predecessors, (16589), 0 states have call successors, (0), 0 states have 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:13:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 16589 transitions. [2025-04-13 23:13:07,734 INFO L79 Accepts]: Start accepts. Automaton has 3886 states and 16589 transitions. Word has length 28 [2025-04-13 23:13:07,734 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:07,734 INFO L485 AbstractCegarLoop]: Abstraction has 3886 states and 16589 transitions. [2025-04-13 23:13:07,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:07,735 INFO L278 IsEmpty]: Start isEmpty. Operand 3886 states and 16589 transitions. [2025-04-13 23:13:07,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:13:07,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:07,742 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:13:07,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:07,942 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,SelfDestructingSolverStorable14 [2025-04-13 23:13:07,943 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 2 more)] === [2025-04-13 23:13:07,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 135071625, now seen corresponding path program 1 times [2025-04-13 23:13:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:07,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314828585] [2025-04-13 23:13:07,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:07,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:13:07,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:07,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:07,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:08,001 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:13:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:08,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314828585] [2025-04-13 23:13:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314828585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:08,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351239298] [2025-04-13 23:13:08,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:08,003 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:13:08,005 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:13:08,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:13:08,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:08,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:08,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:08,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:13:08,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:08,089 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:13:08,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:08,151 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:13:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351239298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:08,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 4 [2025-04-13 23:13:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164569937] [2025-04-13 23:13:08,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:08,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:08,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:08,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:08,152 INFO L87 Difference]: Start difference. First operand 3886 states and 16589 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:08,528 INFO L93 Difference]: Finished difference Result 3996 states and 16845 transitions. [2025-04-13 23:13:08,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:08,529 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:13:08,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:08,565 INFO L225 Difference]: With dead ends: 3996 [2025-04-13 23:13:08,565 INFO L226 Difference]: Without dead ends: 3932 [2025-04-13 23:13:08,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:08,573 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:08,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2025-04-13 23:13:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3744. [2025-04-13 23:13:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 4.291210259150414) internal successors, (16062), 3743 states have internal predecessors, (16062), 0 states have call successors, (0), 0 states have 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:13:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 16062 transitions. [2025-04-13 23:13:08,841 INFO L79 Accepts]: Start accepts. Automaton has 3744 states and 16062 transitions. Word has length 30 [2025-04-13 23:13:08,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:08,841 INFO L485 AbstractCegarLoop]: Abstraction has 3744 states and 16062 transitions. [2025-04-13 23:13:08,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:08,841 INFO L278 IsEmpty]: Start isEmpty. Operand 3744 states and 16062 transitions. [2025-04-13 23:13:08,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:13:08,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:08,848 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:13:08,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:09,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:09,049 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 2 more)] === [2025-04-13 23:13:09,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -793596279, now seen corresponding path program 2 times [2025-04-13 23:13:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:09,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713092508] [2025-04-13 23:13:09,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:09,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:13:09,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:09,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:09,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:09,116 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:13:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:09,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713092508] [2025-04-13 23:13:09,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713092508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:09,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866944959] [2025-04-13 23:13:09,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:09,119 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:13:09,120 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:13:09,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:13:09,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:09,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:09,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:09,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:13:09,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:09,209 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:13:09,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:09,246 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:13:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866944959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:09,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-04-13 23:13:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212123921] [2025-04-13 23:13:09,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:09,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:09,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:09,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:09,247 INFO L87 Difference]: Start difference. First operand 3744 states and 16062 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:10,026 INFO L93 Difference]: Finished difference Result 8685 states and 37458 transitions. [2025-04-13 23:13:10,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:10,027 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:13:10,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:10,051 INFO L225 Difference]: With dead ends: 8685 [2025-04-13 23:13:10,051 INFO L226 Difference]: Without dead ends: 7346 [2025-04-13 23:13:10,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:10,056 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:10,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 32 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2025-04-13 23:13:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 5052. [2025-04-13 23:13:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5052 states, 5051 states have (on average 4.326470005939418) internal successors, (21853), 5051 states have internal predecessors, (21853), 0 states have call successors, (0), 0 states have 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:13:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 21853 transitions. [2025-04-13 23:13:10,465 INFO L79 Accepts]: Start accepts. Automaton has 5052 states and 21853 transitions. Word has length 30 [2025-04-13 23:13:10,466 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:10,466 INFO L485 AbstractCegarLoop]: Abstraction has 5052 states and 21853 transitions. [2025-04-13 23:13:10,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:10,466 INFO L278 IsEmpty]: Start isEmpty. Operand 5052 states and 21853 transitions. [2025-04-13 23:13:10,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:10,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:10,474 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:10,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:10,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:13:10,675 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 2 more)] === [2025-04-13 23:13:10,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1967849303, now seen corresponding path program 3 times [2025-04-13 23:13:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:10,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621321590] [2025-04-13 23:13:10,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:10,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:10,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:10,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:10,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621321590] [2025-04-13 23:13:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621321590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:13:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566918502] [2025-04-13 23:13:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:10,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:10,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:10,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:10,743 INFO L87 Difference]: Start difference. First operand 5052 states and 21853 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:11,833 INFO L93 Difference]: Finished difference Result 9340 states and 39441 transitions. [2025-04-13 23:13:11,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:13:11,834 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:11,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:11,859 INFO L225 Difference]: With dead ends: 9340 [2025-04-13 23:13:11,859 INFO L226 Difference]: Without dead ends: 8694 [2025-04-13 23:13:11,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:13:11,863 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 116 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:11,863 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 56 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:13:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8694 states. [2025-04-13 23:13:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8694 to 7146. [2025-04-13 23:13:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7146 states, 7145 states have (on average 4.378026592022393) internal successors, (31281), 7145 states have internal predecessors, (31281), 0 states have call successors, (0), 0 states have 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:13:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 31281 transitions. [2025-04-13 23:13:12,463 INFO L79 Accepts]: Start accepts. Automaton has 7146 states and 31281 transitions. Word has length 32 [2025-04-13 23:13:12,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:12,463 INFO L485 AbstractCegarLoop]: Abstraction has 7146 states and 31281 transitions. [2025-04-13 23:13:12,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:12,463 INFO L278 IsEmpty]: Start isEmpty. Operand 7146 states and 31281 transitions. [2025-04-13 23:13:12,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:12,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:12,477 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:12,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:13:12,478 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 2 more)] === [2025-04-13 23:13:12,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 507666315, now seen corresponding path program 4 times [2025-04-13 23:13:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:12,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953219629] [2025-04-13 23:13:12,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:12,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:12,484 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:12,484 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:12,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953219629] [2025-04-13 23:13:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953219629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:13:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500868340] [2025-04-13 23:13:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:12,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:12,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:12,526 INFO L87 Difference]: Start difference. First operand 7146 states and 31281 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:13,970 INFO L93 Difference]: Finished difference Result 13131 states and 56143 transitions. [2025-04-13 23:13:13,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:13:13,970 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:13,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:14,013 INFO L225 Difference]: With dead ends: 13131 [2025-04-13 23:13:14,014 INFO L226 Difference]: Without dead ends: 12203 [2025-04-13 23:13:14,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:13:14,018 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:14,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 44 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2025-04-13 23:13:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 10068. [2025-04-13 23:13:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10067 states have (on average 4.492996920631767) internal successors, (45231), 10067 states have internal predecessors, (45231), 0 states have call successors, (0), 0 states have 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:13:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 45231 transitions. [2025-04-13 23:13:15,129 INFO L79 Accepts]: Start accepts. Automaton has 10068 states and 45231 transitions. Word has length 32 [2025-04-13 23:13:15,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:15,129 INFO L485 AbstractCegarLoop]: Abstraction has 10068 states and 45231 transitions. [2025-04-13 23:13:15,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:15,129 INFO L278 IsEmpty]: Start isEmpty. Operand 10068 states and 45231 transitions. [2025-04-13 23:13:15,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:15,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:15,150 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:15,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:13:15,151 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 2 more)] === [2025-04-13 23:13:15,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash -660906365, now seen corresponding path program 5 times [2025-04-13 23:13:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:15,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010451402] [2025-04-13 23:13:15,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:13:15,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:15,155 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:15,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:15,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:15,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:15,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010451402] [2025-04-13 23:13:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010451402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:15,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:15,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:13:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683313786] [2025-04-13 23:13:15,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:15,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:15,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:15,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:15,213 INFO L87 Difference]: Start difference. First operand 10068 states and 45231 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:16,808 INFO L93 Difference]: Finished difference Result 13195 states and 57912 transitions. [2025-04-13 23:13:16,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:13:16,808 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:16,808 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:16,850 INFO L225 Difference]: With dead ends: 13195 [2025-04-13 23:13:16,850 INFO L226 Difference]: Without dead ends: 12522 [2025-04-13 23:13:16,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:13:16,855 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 102 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:16,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 58 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2025-04-13 23:13:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 10715. [2025-04-13 23:13:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 4.503546761246967) internal successors, (48251), 10714 states have internal predecessors, (48251), 0 states have call successors, (0), 0 states have 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:13:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 48251 transitions. [2025-04-13 23:13:18,124 INFO L79 Accepts]: Start accepts. Automaton has 10715 states and 48251 transitions. Word has length 32 [2025-04-13 23:13:18,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:18,124 INFO L485 AbstractCegarLoop]: Abstraction has 10715 states and 48251 transitions. [2025-04-13 23:13:18,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:18,124 INFO L278 IsEmpty]: Start isEmpty. Operand 10715 states and 48251 transitions. [2025-04-13 23:13:18,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:18,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:18,144 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:18,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:13:18,145 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 2 more)] === [2025-04-13 23:13:18,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 561475669, now seen corresponding path program 6 times [2025-04-13 23:13:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:18,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147751820] [2025-04-13 23:13:18,145 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:13:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:18,148 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:13:18,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:13:18,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:13:18,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:18,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147751820] [2025-04-13 23:13:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147751820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:18,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846501267] [2025-04-13 23:13:18,198 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:13:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:18,199 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:13:18,201 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:13:18,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-13 23:13:18,248 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:13:18,248 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:13:18,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:18,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:13:18,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:18,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846501267] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:18,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:13:18,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-04-13 23:13:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013238392] [2025-04-13 23:13:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:18,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:18,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:18,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:13:18,455 INFO L87 Difference]: Start difference. First operand 10715 states and 48251 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:20,396 INFO L93 Difference]: Finished difference Result 15502 states and 68019 transitions. [2025-04-13 23:13:20,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:13:20,396 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:20,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:20,446 INFO L225 Difference]: With dead ends: 15502 [2025-04-13 23:13:20,446 INFO L226 Difference]: Without dead ends: 14693 [2025-04-13 23:13:20,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:13:20,452 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 123 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:20,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 43 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14693 states. [2025-04-13 23:13:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14693 to 11662. [2025-04-13 23:13:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11662 states, 11661 states have (on average 4.550810393619758) internal successors, (53067), 11661 states have internal predecessors, (53067), 0 states have call successors, (0), 0 states have 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:13:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11662 states to 11662 states and 53067 transitions. [2025-04-13 23:13:21,975 INFO L79 Accepts]: Start accepts. Automaton has 11662 states and 53067 transitions. Word has length 32 [2025-04-13 23:13:21,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:21,975 INFO L485 AbstractCegarLoop]: Abstraction has 11662 states and 53067 transitions. [2025-04-13 23:13:21,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:21,975 INFO L278 IsEmpty]: Start isEmpty. Operand 11662 states and 53067 transitions. [2025-04-13 23:13:21,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:21,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:21,998 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:22,008 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:13:22,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:22,199 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:13:22,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 579443911, now seen corresponding path program 7 times [2025-04-13 23:13:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:22,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573530001] [2025-04-13 23:13:22,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:13:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:22,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 23:13:22,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:22,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:22,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:22,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573530001] [2025-04-13 23:13:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573530001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:22,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459933909] [2025-04-13 23:13:22,251 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:13:22,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:22,253 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:13:22,255 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:13:22,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 23:13:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:22,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:13:22,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:22,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459933909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:22,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 23:13:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874495123] [2025-04-13 23:13:22,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:22,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:13:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:13:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:13:22,469 INFO L87 Difference]: Start difference. First operand 11662 states and 53067 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:13:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:29,307 INFO L93 Difference]: Finished difference Result 35081 states and 158725 transitions. [2025-04-13 23:13:29,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 23:13:29,308 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:29,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:29,424 INFO L225 Difference]: With dead ends: 35081 [2025-04-13 23:13:29,424 INFO L226 Difference]: Without dead ends: 32866 [2025-04-13 23:13:29,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=835, Invalid=3071, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 23:13:29,436 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 430 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:29,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 299 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:13:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32866 states. [2025-04-13 23:13:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32866 to 18829. [2025-04-13 23:13:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18829 states, 18828 states have (on average 4.6622583386445715) internal successors, (87781), 18828 states have internal predecessors, (87781), 0 states have call successors, (0), 0 states have 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:13:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18829 states to 18829 states and 87781 transitions. [2025-04-13 23:13:32,006 INFO L79 Accepts]: Start accepts. Automaton has 18829 states and 87781 transitions. Word has length 32 [2025-04-13 23:13:32,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:32,006 INFO L485 AbstractCegarLoop]: Abstraction has 18829 states and 87781 transitions. [2025-04-13 23:13:32,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:13:32,007 INFO L278 IsEmpty]: Start isEmpty. Operand 18829 states and 87781 transitions. [2025-04-13 23:13:32,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:32,042 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:32,047 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:13:32,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:32,243 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:13:32,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -733397011, now seen corresponding path program 8 times [2025-04-13 23:13:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:32,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185945972] [2025-04-13 23:13:32,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:32,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:32,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:32,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:32,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185945972] [2025-04-13 23:13:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185945972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:32,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407347575] [2025-04-13 23:13:32,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:32,308 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:13:32,309 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:13:32,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:32,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:32,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:32,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:13:32,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:32,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407347575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:32,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 23:13:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839037343] [2025-04-13 23:13:32,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:32,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:13:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:32,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:13:32,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:13:32,521 INFO L87 Difference]: Start difference. First operand 18829 states and 87781 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:13:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:41,577 INFO L93 Difference]: Finished difference Result 47748 states and 222781 transitions. [2025-04-13 23:13:41,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:13:41,577 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:41,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:41,761 INFO L225 Difference]: With dead ends: 47748 [2025-04-13 23:13:41,761 INFO L226 Difference]: Without dead ends: 43119 [2025-04-13 23:13:41,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=874, Invalid=3286, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:13:41,779 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 623 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:41,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 342 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:13:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43119 states. [2025-04-13 23:13:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43119 to 30650. [2025-04-13 23:13:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30650 states, 30649 states have (on average 4.841495644229828) internal successors, (148387), 30649 states have internal predecessors, (148387), 0 states have call successors, (0), 0 states have 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:13:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 148387 transitions. [2025-04-13 23:13:46,527 INFO L79 Accepts]: Start accepts. Automaton has 30650 states and 148387 transitions. Word has length 32 [2025-04-13 23:13:46,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:46,527 INFO L485 AbstractCegarLoop]: Abstraction has 30650 states and 148387 transitions. [2025-04-13 23:13:46,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:13:46,528 INFO L278 IsEmpty]: Start isEmpty. Operand 30650 states and 148387 transitions. [2025-04-13 23:13:46,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:46,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:46,598 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:13:46,604 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:13:46,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:46,799 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:13:46,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1165874659, now seen corresponding path program 9 times [2025-04-13 23:13:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:46,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078836922] [2025-04-13 23:13:46,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:46,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:46,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:46,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:46,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:46,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078836922] [2025-04-13 23:13:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078836922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:46,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197361045] [2025-04-13 23:13:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:46,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:46,857 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:13:46,858 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:13:46,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:46,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:46,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:46,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:13:46,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:47,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:47,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197361045] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:47,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 23:13:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831445612] [2025-04-13 23:13:47,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:47,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:13:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:47,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:13:47,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:13:47,120 INFO L87 Difference]: Start difference. First operand 30650 states and 148387 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:14:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:00,174 INFO L93 Difference]: Finished difference Result 60910 states and 279676 transitions. [2025-04-13 23:14:00,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:14:00,174 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:14:00,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:00,429 INFO L225 Difference]: With dead ends: 60910 [2025-04-13 23:14:00,429 INFO L226 Difference]: Without dead ends: 58316 [2025-04-13 23:14:00,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1478, Invalid=5662, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:14:00,452 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 821 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:00,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 239 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:14:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58316 states. [2025-04-13 23:14:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58316 to 36023. [2025-04-13 23:14:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36023 states, 36022 states have (on average 4.801232580089945) internal successors, (172950), 36022 states have internal predecessors, (172950), 0 states have call successors, (0), 0 states have 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:14:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36023 states to 36023 states and 172950 transitions. [2025-04-13 23:14:06,934 INFO L79 Accepts]: Start accepts. Automaton has 36023 states and 172950 transitions. Word has length 32 [2025-04-13 23:14:06,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:06,934 INFO L485 AbstractCegarLoop]: Abstraction has 36023 states and 172950 transitions. [2025-04-13 23:14:06,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:14:06,934 INFO L278 IsEmpty]: Start isEmpty. Operand 36023 states and 172950 transitions. [2025-04-13 23:14:07,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:14:07,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:07,004 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:14:07,010 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:14:07,204 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,SelfDestructingSolverStorable23 [2025-04-13 23:14:07,204 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:14:07,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1380723771, now seen corresponding path program 10 times [2025-04-13 23:14:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:07,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309882706] [2025-04-13 23:14:07,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:14:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:07,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:14:07,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:14:07,218 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:14:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:14:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:07,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309882706] [2025-04-13 23:14:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309882706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:07,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161198785] [2025-04-13 23:14:07,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:14:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:07,256 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:14:07,257 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:14:07,294 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:14:07,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:14:07,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:14:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:07,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:14:07,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:14:07,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:14:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161198785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:07,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:14:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439846014] [2025-04-13 23:14:07,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:07,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:14:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:07,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:14:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:14:07,510 INFO L87 Difference]: Start difference. First operand 36023 states and 172950 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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:14:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:22,392 INFO L93 Difference]: Finished difference Result 69080 states and 318031 transitions. [2025-04-13 23:14:22,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:14:22,392 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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 32 [2025-04-13 23:14:22,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:22,672 INFO L225 Difference]: With dead ends: 69080 [2025-04-13 23:14:22,672 INFO L226 Difference]: Without dead ends: 61550 [2025-04-13 23:14:22,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 23:14:22,697 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 515 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:22,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 154 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:14:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61550 states. [2025-04-13 23:14:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61550 to 39885. [2025-04-13 23:14:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39885 states, 39884 states have (on average 4.818724300471367) internal successors, (192190), 39884 states have internal predecessors, (192190), 0 states have call successors, (0), 0 states have 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:14:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39885 states to 39885 states and 192190 transitions. [2025-04-13 23:14:29,941 INFO L79 Accepts]: Start accepts. Automaton has 39885 states and 192190 transitions. Word has length 32 [2025-04-13 23:14:29,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:29,941 INFO L485 AbstractCegarLoop]: Abstraction has 39885 states and 192190 transitions. [2025-04-13 23:14:29,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 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:14:29,941 INFO L278 IsEmpty]: Start isEmpty. Operand 39885 states and 192190 transitions. [2025-04-13 23:14:30,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:14:30,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:30,018 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:14:30,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 23:14:30,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 23:14:30,219 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:14:30,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -95917267, now seen corresponding path program 11 times [2025-04-13 23:14:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:30,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948975650] [2025-04-13 23:14:30,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:14:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:30,222 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:14:30,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:14:30,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:14:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:30,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:30,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948975650] [2025-04-13 23:14:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948975650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:30,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526513624] [2025-04-13 23:14:30,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:14:30,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:30,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:30,262 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:14:30,263 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:14:30,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:14:30,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:14:30,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:14:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:30,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:14:30,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:30,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526513624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:30,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:14:30,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345585645] [2025-04-13 23:14:30,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:30,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:14:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:30,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:14:30,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:14:30,465 INFO L87 Difference]: Start difference. First operand 39885 states and 192190 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:14:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:46,943 INFO L93 Difference]: Finished difference Result 69313 states and 325990 transitions. [2025-04-13 23:14:46,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:14:46,943 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:14:46,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:47,247 INFO L225 Difference]: With dead ends: 69313 [2025-04-13 23:14:47,248 INFO L226 Difference]: Without dead ends: 65919 [2025-04-13 23:14:47,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:14:47,274 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 230 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:47,275 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 149 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:14:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65919 states. [2025-04-13 23:14:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65919 to 54173. [2025-04-13 23:14:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54173 states, 54172 states have (on average 4.911356420290925) internal successors, (266058), 54172 states have internal predecessors, (266058), 0 states have call successors, (0), 0 states have 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:14:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54173 states to 54173 states and 266058 transitions. [2025-04-13 23:14:57,678 INFO L79 Accepts]: Start accepts. Automaton has 54173 states and 266058 transitions. Word has length 32 [2025-04-13 23:14:57,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:57,678 INFO L485 AbstractCegarLoop]: Abstraction has 54173 states and 266058 transitions. [2025-04-13 23:14:57,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:14:57,679 INFO L278 IsEmpty]: Start isEmpty. Operand 54173 states and 266058 transitions. [2025-04-13 23:14:57,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:14:57,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:57,792 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:14:57,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 23:14:57,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 23:14:57,993 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:14:57,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash 477073991, now seen corresponding path program 12 times [2025-04-13 23:14:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:57,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908173821] [2025-04-13 23:14:57,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:14:57,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:57,996 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:14:57,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:14:57,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:14:57,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:14:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:58,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908173821] [2025-04-13 23:14:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908173821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:14:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:14:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:14:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665892539] [2025-04-13 23:14:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:14:58,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:14:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:58,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:14:58,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:14:58,037 INFO L87 Difference]: Start difference. First operand 54173 states and 266058 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:12,337 INFO L93 Difference]: Finished difference Result 62426 states and 302195 transitions. [2025-04-13 23:15:12,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:15:12,337 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:15:12,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:12,635 INFO L225 Difference]: With dead ends: 62426 [2025-04-13 23:15:12,635 INFO L226 Difference]: Without dead ends: 61245 [2025-04-13 23:15:12,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:15:12,659 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 139 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:12,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 45 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:15:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61245 states. [2025-04-13 23:15:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61245 to 54447. [2025-04-13 23:15:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54447 states, 54446 states have (on average 4.9080189545604815) internal successors, (267222), 54446 states have internal predecessors, (267222), 0 states have call successors, (0), 0 states have 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:15:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54447 states to 54447 states and 267222 transitions. [2025-04-13 23:15:23,176 INFO L79 Accepts]: Start accepts. Automaton has 54447 states and 267222 transitions. Word has length 32 [2025-04-13 23:15:23,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:23,176 INFO L485 AbstractCegarLoop]: Abstraction has 54447 states and 267222 transitions. [2025-04-13 23:15:23,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:23,176 INFO L278 IsEmpty]: Start isEmpty. Operand 54447 states and 267222 transitions. [2025-04-13 23:15:23,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:15:23,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:23,292 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:15:23,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 23:15:23,292 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:15:23,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1172174833, now seen corresponding path program 13 times [2025-04-13 23:15:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:23,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561381384] [2025-04-13 23:15:23,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:15:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:23,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 23:15:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:15:23,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:23,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:23,332 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:15:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:23,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561381384] [2025-04-13 23:15:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561381384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:15:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025643237] [2025-04-13 23:15:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:23,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:15:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:23,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:15:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:15:23,333 INFO L87 Difference]: Start difference. First operand 54447 states and 267222 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:45,431 INFO L93 Difference]: Finished difference Result 108746 states and 533129 transitions. [2025-04-13 23:15:45,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:15:45,431 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:15:45,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:46,381 INFO L225 Difference]: With dead ends: 108746 [2025-04-13 23:15:46,381 INFO L226 Difference]: Without dead ends: 104493 [2025-04-13 23:15:46,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:15:46,415 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:46,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 43 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:15:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104493 states. [2025-04-13 23:16:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104493 to 87221. [2025-04-13 23:16:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87221 states, 87220 states have (on average 5.112680577849117) internal successors, (445928), 87220 states have internal predecessors, (445928), 0 states have call successors, (0), 0 states have 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:16:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87221 states to 87221 states and 445928 transitions. [2025-04-13 23:16:02,805 INFO L79 Accepts]: Start accepts. Automaton has 87221 states and 445928 transitions. Word has length 32 [2025-04-13 23:16:02,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:02,806 INFO L485 AbstractCegarLoop]: Abstraction has 87221 states and 445928 transitions. [2025-04-13 23:16:02,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:02,806 INFO L278 IsEmpty]: Start isEmpty. Operand 87221 states and 445928 transitions. [2025-04-13 23:16:03,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:16:03,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:03,055 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-04-13 23:16:03,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 23:16:03,056 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:16:03,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1954564419, now seen corresponding path program 14 times [2025-04-13 23:16:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:03,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124681207] [2025-04-13 23:16:03,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:03,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:16:03,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:16:03,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:03,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:03,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124681207] [2025-04-13 23:16:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124681207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:03,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958262952] [2025-04-13 23:16:03,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:03,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:03,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:03,121 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:16:03,122 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:16:03,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:16:03,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:16:03,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:03,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:03,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:16:03,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:03,258 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:16:03,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958262952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:03,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 23:16:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388688128] [2025-04-13 23:16:03,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:03,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:16:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:03,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:16:03,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:16:03,325 INFO L87 Difference]: Start difference. First operand 87221 states and 445928 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:52,084 INFO L93 Difference]: Finished difference Result 170079 states and 825591 transitions. [2025-04-13 23:16:52,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:16:52,084 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:16:52,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:53,523 INFO L225 Difference]: With dead ends: 170079 [2025-04-13 23:16:53,523 INFO L226 Difference]: Without dead ends: 164401 [2025-04-13 23:16:53,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2269, Invalid=8033, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 23:16:53,603 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 985 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:53,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 202 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:16:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164401 states. [2025-04-13 23:17:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164401 to 105511. [2025-04-13 23:17:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105511 states, 105510 states have (on average 5.165586200360155) internal successors, (545021), 105510 states have internal predecessors, (545021), 0 states have call successors, (0), 0 states have 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:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105511 states to 105511 states and 545021 transitions. [2025-04-13 23:17:18,470 INFO L79 Accepts]: Start accepts. Automaton has 105511 states and 545021 transitions. Word has length 32 [2025-04-13 23:17:18,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:18,471 INFO L485 AbstractCegarLoop]: Abstraction has 105511 states and 545021 transitions. [2025-04-13 23:17:18,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:18,471 INFO L278 IsEmpty]: Start isEmpty. Operand 105511 states and 545021 transitions. [2025-04-13 23:17:18,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:17:18,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:18,984 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, 1, 1, 1] [2025-04-13 23:17:18,990 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:17:19,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 23:17:19,189 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:17:19,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -291929159, now seen corresponding path program 15 times [2025-04-13 23:17:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:19,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466876280] [2025-04-13 23:17:19,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:19,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:17:19,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:17:19,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:19,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466876280] [2025-04-13 23:17:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466876280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:19,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:17:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648458673] [2025-04-13 23:17:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:19,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:19,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:19,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:17:19,529 INFO L87 Difference]: Start difference. First operand 105511 states and 545021 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:49,667 INFO L93 Difference]: Finished difference Result 117551 states and 604142 transitions. [2025-04-13 23:17:49,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:17:49,671 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2025-04-13 23:17:49,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:50,474 INFO L225 Difference]: With dead ends: 117551 [2025-04-13 23:17:50,475 INFO L226 Difference]: Without dead ends: 117504 [2025-04-13 23:17:50,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:17:50,526 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 78 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:50,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 68 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:17:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117504 states. [2025-04-13 23:18:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117504 to 105474. [2025-04-13 23:18:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105474 states, 105473 states have (on average 5.166374332767628) internal successors, (544913), 105473 states have internal predecessors, (544913), 0 states have call successors, (0), 0 states have 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:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105474 states to 105474 states and 544913 transitions. [2025-04-13 23:18:13,567 INFO L79 Accepts]: Start accepts. Automaton has 105474 states and 544913 transitions. Word has length 34 [2025-04-13 23:18:13,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:13,568 INFO L485 AbstractCegarLoop]: Abstraction has 105474 states and 544913 transitions. [2025-04-13 23:18:13,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:13,569 INFO L278 IsEmpty]: Start isEmpty. Operand 105474 states and 544913 transitions. [2025-04-13 23:18:13,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 23:18:13,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:13,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1] [2025-04-13 23:18:13,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 23:18:13,857 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:18:13,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 224777455, now seen corresponding path program 16 times [2025-04-13 23:18:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:13,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094161149] [2025-04-13 23:18:13,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:18:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:13,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:18:13,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:18:13,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:18:13,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:13,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094161149] [2025-04-13 23:18:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094161149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:13,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887728156] [2025-04-13 23:18:13,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:18:13,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:13,953 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:18:13,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:18:13,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:18:14,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:18:14,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:18:14,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:18:14,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:14,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887728156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:14,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 23:18:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974702765] [2025-04-13 23:18:14,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:14,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:18:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:18:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:18:14,129 INFO L87 Difference]: Start difference. First operand 105474 states and 544913 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:06,644 INFO L93 Difference]: Finished difference Result 211427 states and 1107364 transitions. [2025-04-13 23:19:06,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:19:06,644 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 23:19:06,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:08,254 INFO L225 Difference]: With dead ends: 211427 [2025-04-13 23:19:08,254 INFO L226 Difference]: Without dead ends: 194250 [2025-04-13 23:19:08,342 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:19:08,343 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 103 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:08,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 40 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194250 states. [2025-04-13 23:19:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194250 to 190593. [2025-04-13 23:19:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190593 states, 190592 states have (on average 5.200071356615178) internal successors, (991092), 190592 states have internal predecessors, (991092), 0 states have call successors, (0), 0 states have 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:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190593 states to 190593 states and 991092 transitions. [2025-04-13 23:19:50,750 INFO L79 Accepts]: Start accepts. Automaton has 190593 states and 991092 transitions. Word has length 36 [2025-04-13 23:19:50,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:50,752 INFO L485 AbstractCegarLoop]: Abstraction has 190593 states and 991092 transitions. [2025-04-13 23:19:50,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:50,752 INFO L278 IsEmpty]: Start isEmpty. Operand 190593 states and 991092 transitions. [2025-04-13 23:19:51,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 23:19:51,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:51,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-04-13 23:19:51,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:19:51,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:51,564 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:19:51,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1853894711, now seen corresponding path program 17 times [2025-04-13 23:19:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:51,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523161315] [2025-04-13 23:19:51,565 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:19:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:51,578 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 23:19:51,586 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 23:19:51,586 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 23:19:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:51,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523161315] [2025-04-13 23:19:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523161315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:51,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526115384] [2025-04-13 23:19:51,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:19:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:51,709 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:19:51,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:19:51,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 23:19:51,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 23:19:51,775 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 23:19:51,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:51,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:19:51,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:51,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526115384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:51,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2025-04-13 23:19:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147891060] [2025-04-13 23:19:51,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:51,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:19:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:19:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:19:51,950 INFO L87 Difference]: Start difference. First operand 190593 states and 991092 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:40,902 INFO L93 Difference]: Finished difference Result 192435 states and 996882 transitions. [2025-04-13 23:20:40,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:20:40,903 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 23:20:40,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:42,474 INFO L225 Difference]: With dead ends: 192435 [2025-04-13 23:20:42,475 INFO L226 Difference]: Without dead ends: 191491 [2025-04-13 23:20:42,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:20:42,546 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 118 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:42,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 152 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:20:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191491 states. [2025-04-13 23:21:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191491 to 136941. [2025-04-13 23:21:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136941 states, 136940 states have (on average 5.204819629034613) internal successors, (712748), 136940 states have internal predecessors, (712748), 0 states have call successors, (0), 0 states have 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:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136941 states to 136941 states and 712748 transitions. [2025-04-13 23:21:16,008 INFO L79 Accepts]: Start accepts. Automaton has 136941 states and 712748 transitions. Word has length 38 [2025-04-13 23:21:16,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:16,009 INFO L485 AbstractCegarLoop]: Abstraction has 136941 states and 712748 transitions. [2025-04-13 23:21:16,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:16,009 INFO L278 IsEmpty]: Start isEmpty. Operand 136941 states and 712748 transitions. [2025-04-13 23:21:16,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 23:21:16,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:16,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-04-13 23:21:16,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:21:16,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 23:21:16,654 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:21:16,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 652610825, now seen corresponding path program 18 times [2025-04-13 23:21:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:16,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38383435] [2025-04-13 23:21:16,656 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:21:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:16,668 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 23:21:16,687 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 23:21:16,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:21:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:21:16,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:16,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38383435] [2025-04-13 23:21:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38383435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:21:16,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192417987] [2025-04-13 23:21:16,765 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:21:16,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:21:16,767 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:21:16,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:21:16,827 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 23:21:16,869 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 23:21:16,869 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:21:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:16,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:21:16,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:21:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:21:16,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:21:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:21:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192417987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:21:16,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:21:16,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 6 [2025-04-13 23:21:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737756089] [2025-04-13 23:21:16,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:21:16,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:21:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:16,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:21:16,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:21:16,990 INFO L87 Difference]: Start difference. First operand 136941 states and 712748 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:25,266 INFO L93 Difference]: Finished difference Result 258875 states and 1359717 transitions. [2025-04-13 23:22:25,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:22:25,267 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 23:22:25,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:27,401 INFO L225 Difference]: With dead ends: 258875 [2025-04-13 23:22:27,401 INFO L226 Difference]: Without dead ends: 241879 [2025-04-13 23:22:27,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:22:27,509 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:27,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 56 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:22:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241879 states. [2025-04-13 23:23:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241879 to 171325. [2025-04-13 23:23:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171325 states, 171324 states have (on average 5.2418516962013495) internal successors, (898055), 171324 states have internal predecessors, (898055), 0 states have call successors, (0), 0 states have 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:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171325 states to 171325 states and 898055 transitions. [2025-04-13 23:23:11,839 INFO L79 Accepts]: Start accepts. Automaton has 171325 states and 898055 transitions. Word has length 38 [2025-04-13 23:23:11,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:11,839 INFO L485 AbstractCegarLoop]: Abstraction has 171325 states and 898055 transitions. [2025-04-13 23:23:11,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:11,840 INFO L278 IsEmpty]: Start isEmpty. Operand 171325 states and 898055 transitions. [2025-04-13 23:23:12,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 23:23:12,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:12,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2025-04-13 23:23:12,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:12,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:12,959 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:23:12,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 390543563, now seen corresponding path program 19 times [2025-04-13 23:23:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:12,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722458786] [2025-04-13 23:23:12,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:12,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:23:12,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:23:12,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:12,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:23:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:13,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722458786] [2025-04-13 23:23:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722458786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:13,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366408459] [2025-04-13 23:23:13,031 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:13,033 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:23:13,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:23:13,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:23:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:23:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:13,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:13,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:23:13,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:23:13,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:23:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366408459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:13,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-13 23:23:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698387498] [2025-04-13 23:23:13,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:13,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:23:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:13,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:23:13,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:23:13,640 INFO L87 Difference]: Start difference. First operand 171325 states and 898055 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 23:24:24,088 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:24:24,088 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:24:24,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-04-13 23:24:24,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2979, Invalid=11783, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 23:24:24,094 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1035 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:24,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 407 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:24:24,100 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 23:24:24,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 23:24:24,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:24,305 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). [2025-04-13 23:24:24,308 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 23:24:24,308 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 23:24:24,308 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 23:24:24,308 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 23:24:24,316 INFO L422 BasicCegarLoop]: Path program histogram: [19, 4, 4, 2, 2, 2, 1] [2025-04-13 23:24:24,328 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:24:24,328 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:24:24,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:24:24 BasicIcfg [2025-04-13 23:24:24,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:24:24,336 INFO L158 Benchmark]: Toolchain (without parser) took 685792.05ms. Allocated memory was 167.8MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 119.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2025-04-13 23:24:24,336 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:24:24,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.71ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 105.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:24:24,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.72ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:24:24,341 INFO L158 Benchmark]: Boogie Preprocessor took 32.89ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:24:24,341 INFO L158 Benchmark]: IcfgBuilder took 441.33ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 59.7MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 23:24:24,341 INFO L158 Benchmark]: TraceAbstraction took 685084.29ms. Allocated memory was 167.8MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 59.1MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2025-04-13 23:24:24,342 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.71ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 105.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.72ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.89ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 441.33ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 59.7MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 685084.29ms. Allocated memory was 167.8MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 59.1MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 4.5GB. 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: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (171325states) and FLOYD_HOARE automaton (currently 117 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (201080 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 52 locations, 59 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 685.0s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 19, EmptinessCheckTime: 3.7s, AutomataDifference: 437.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6510 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6510 mSDsluCounter, 2892 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2354 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10080 IncrementalHoareTripleChecker+Invalid, 10527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 538 mSDtfsCounter, 10080 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1546 GetRequests, 890 SyntacticMatches, 35 SemanticMatches, 621 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16651 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190593occurred in iteration=31, InterpolantAutomatonStates: 514, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 231.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 322482 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1488 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 1928 ConstructedInterpolants, 0 QuantifiedInterpolants, 10371 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2971 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 64 InterpolantComputations, 21 PerfectInterpolantSequences, 165/291 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