/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-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:03:00,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:03:00,561 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:03:00,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:03:00,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:03:00,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:03:00,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:03:00,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:03:00,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:03:00,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:03:00,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:03:00,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:03:00,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:03:00,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:03:00,580 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:03:00,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:03:00,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:03:00,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:03:00,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:03:00,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:03:00,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:03:00,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:03:00,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:03:00,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:03:00,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:03:00,583 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:03:00,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:03:00,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:03:00,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:03:00,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:03:00,801 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:03:00,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-04-13 23:03:02,053 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e156c698d/6d9f77080c064dddb891559140a84326/FLAGbc1c3761b [2025-04-13 23:03:02,217 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:03:02,217 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-04-13 23:03:02,227 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e156c698d/6d9f77080c064dddb891559140a84326/FLAGbc1c3761b [2025-04-13 23:03:03,103 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e156c698d/6d9f77080c064dddb891559140a84326 [2025-04-13 23:03:03,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:03:03,106 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:03:03,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:03:03,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:03:03,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:03:03,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8662ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03, skipping insertion in model container [2025-04-13 23:03:03,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:03:03,300 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-more-queue-add-2-nl.wvr.c[2896,2909] [2025-04-13 23:03:03,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:03:03,325 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:03:03,360 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-more-queue-add-2-nl.wvr.c[2896,2909] [2025-04-13 23:03:03,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:03:03,378 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:03:03,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03 WrapperNode [2025-04-13 23:03:03,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:03:03,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:03:03,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:03:03,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:03:03,385 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:03:03" (1/1) ... [2025-04-13 23:03:03,392 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:03:03" (1/1) ... [2025-04-13 23:03:03,413 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2025-04-13 23:03:03,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:03:03,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:03:03,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:03:03,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:03:03,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,442 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 23:03:03,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:03:03,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:03:03,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:03:03,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:03:03,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (1/1) ... [2025-04-13 23:03:03,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:03:03,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:03,488 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:03:03,490 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:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:03:03,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:03:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:03:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:03:03,507 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:03:03,581 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:03:03,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:03:03,763 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:03:03,764 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:03:03,764 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:03:04,006 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:03:04,008 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:03:04,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:03:04 BoogieIcfgContainer [2025-04-13 23:03:04,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:03:04,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:03:04,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:03:04,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:03:04,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:03:03" (1/3) ... [2025-04-13 23:03:04,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7c2268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:03:04, skipping insertion in model container [2025-04-13 23:03:04,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:03:03" (2/3) ... [2025-04-13 23:03:04,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7c2268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:03:04, skipping insertion in model container [2025-04-13 23:03:04,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:03:04" (3/3) ... [2025-04-13 23:03:04,015 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-04-13 23:03:04,025 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:03:04,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:03:04,027 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:03:04,064 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:03:04,084 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 64 flow [2025-04-13 23:03:04,102 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 69 states, 68 states have (on average 2.661764705882353) internal successors, (181), 68 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:03:04,122 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:03:04,132 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;@1aec6f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:03:04,132 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:03:04,134 INFO L278 IsEmpty]: Start isEmpty. Operand has 69 states, 68 states have (on average 2.661764705882353) internal successors, (181), 68 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:03:04,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:03:04,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:04,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:04,140 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:04,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 732765429, now seen corresponding path program 1 times [2025-04-13 23:03:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:04,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269954837] [2025-04-13 23:03:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:03:04,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:03:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:04,311 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:03:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:04,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269954837] [2025-04-13 23:03:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269954837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:04,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:03:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646468919] [2025-04-13 23:03:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:04,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:03:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:04,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:03:04,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:03:04,333 INFO L87 Difference]: Start difference. First operand has 69 states, 68 states have (on average 2.661764705882353) internal successors, (181), 68 states have internal predecessors, (181), 0 states have call successors, (0), 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 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:04,381 INFO L93 Difference]: Finished difference Result 84 states and 204 transitions. [2025-04-13 23:03:04,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:03:04,383 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 23:03:04,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:04,388 INFO L225 Difference]: With dead ends: 84 [2025-04-13 23:03:04,388 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 23:03:04,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:03:04,396 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:04,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:03:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 23:03:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-13 23:03:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.4705882352941178) internal successors, (168), 68 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have 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:03:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 168 transitions. [2025-04-13 23:03:04,421 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 168 transitions. Word has length 14 [2025-04-13 23:03:04,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:04,422 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 168 transitions. [2025-04-13 23:03:04,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:04,422 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 168 transitions. [2025-04-13 23:03:04,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:03:04,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:04,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:04,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:03:04,423 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:04,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1240858290, now seen corresponding path program 1 times [2025-04-13 23:03:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:04,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510158161] [2025-04-13 23:03:04,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:04,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:03:04,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:03:04,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:04,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:04,635 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:03:04,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:04,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510158161] [2025-04-13 23:03:04,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510158161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:04,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:04,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:03:04,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424165389] [2025-04-13 23:03:04,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:04,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:03:04,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:04,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:03:04,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:03:04,637 INFO L87 Difference]: Start difference. First operand 69 states and 168 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have 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:03:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:04,711 INFO L93 Difference]: Finished difference Result 151 states and 370 transitions. [2025-04-13 23:03:04,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:03:04,711 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-04-13 23:03:04,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:04,712 INFO L225 Difference]: With dead ends: 151 [2025-04-13 23:03:04,712 INFO L226 Difference]: Without dead ends: 70 [2025-04-13 23:03:04,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:03:04,713 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:04,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-13 23:03:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-04-13 23:03:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.449275362318841) internal successors, (169), 69 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:03:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 169 transitions. [2025-04-13 23:03:04,724 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 169 transitions. Word has length 15 [2025-04-13 23:03:04,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:04,724 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 169 transitions. [2025-04-13 23:03:04,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have 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:03:04,724 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 169 transitions. [2025-04-13 23:03:04,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:03:04,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:04,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:04,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:03:04,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:04,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1591800781, now seen corresponding path program 1 times [2025-04-13 23:03:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:04,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550850637] [2025-04-13 23:03:04,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:04,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:03:04,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:03:04,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:04,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:05,138 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:03:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:05,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550850637] [2025-04-13 23:03:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550850637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:03:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769726273] [2025-04-13 23:03:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:05,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:03:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:05,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:03:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:05,140 INFO L87 Difference]: Start difference. First operand 70 states and 169 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:05,308 INFO L93 Difference]: Finished difference Result 136 states and 338 transitions. [2025-04-13 23:03:05,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:03:05,308 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:03:05,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:05,309 INFO L225 Difference]: With dead ends: 136 [2025-04-13 23:03:05,309 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 23:03:05,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:03:05,310 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:05,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 23:03:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2025-04-13 23:03:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.375) internal successors, (228), 96 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:03:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 228 transitions. [2025-04-13 23:03:05,321 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 228 transitions. Word has length 16 [2025-04-13 23:03:05,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:05,321 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 228 transitions. [2025-04-13 23:03:05,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:05,321 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 228 transitions. [2025-04-13 23:03:05,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:03:05,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:05,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:05,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:03:05,323 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:05,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2069684925, now seen corresponding path program 2 times [2025-04-13 23:03:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:05,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114604523] [2025-04-13 23:03:05,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:05,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:03:05,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-04-13 23:03:05,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:03:05,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:05,594 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:03:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:05,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114604523] [2025-04-13 23:03:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114604523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:03:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189474453] [2025-04-13 23:03:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:05,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:03:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:05,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:03:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:05,596 INFO L87 Difference]: Start difference. First operand 97 states and 228 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:05,695 INFO L93 Difference]: Finished difference Result 134 states and 328 transitions. [2025-04-13 23:03:05,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:03:05,696 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:03:05,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:05,697 INFO L225 Difference]: With dead ends: 134 [2025-04-13 23:03:05,697 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 23:03:05,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:05,697 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:05,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 23:03:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2025-04-13 23:03:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.3333333333333335) internal successors, (224), 96 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:03:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 224 transitions. [2025-04-13 23:03:05,709 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 224 transitions. Word has length 16 [2025-04-13 23:03:05,709 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:05,709 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 224 transitions. [2025-04-13 23:03:05,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:05,710 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 224 transitions. [2025-04-13 23:03:05,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:03:05,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:05,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:05,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:03:05,712 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:05,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1473126023, now seen corresponding path program 3 times [2025-04-13 23:03:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:05,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661025223] [2025-04-13 23:03:05,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:05,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:03:05,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-04-13 23:03:05,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:03:05,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:05,992 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:03:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:05,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661025223] [2025-04-13 23:03:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661025223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:03:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172419830] [2025-04-13 23:03:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:05,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:03:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:05,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:03:05,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:05,994 INFO L87 Difference]: Start difference. First operand 97 states and 224 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:06,108 INFO L93 Difference]: Finished difference Result 136 states and 331 transitions. [2025-04-13 23:03:06,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:03:06,108 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:03:06,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:06,109 INFO L225 Difference]: With dead ends: 136 [2025-04-13 23:03:06,109 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 23:03:06,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:06,110 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:06,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 23:03:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2025-04-13 23:03:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.4444444444444446) internal successors, (264), 108 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 264 transitions. [2025-04-13 23:03:06,124 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 264 transitions. Word has length 16 [2025-04-13 23:03:06,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:06,124 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 264 transitions. [2025-04-13 23:03:06,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,124 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 264 transitions. [2025-04-13 23:03:06,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:03:06,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:06,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:06,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:03:06,126 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:06,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1524789383, now seen corresponding path program 4 times [2025-04-13 23:03:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:06,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843668836] [2025-04-13 23:03:06,126 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:06,132 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:03:06,141 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:03:06,142 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:06,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:06,364 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:03:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:06,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843668836] [2025-04-13 23:03:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843668836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:03:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953643370] [2025-04-13 23:03:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:06,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:03:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:06,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:03:06,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:06,365 INFO L87 Difference]: Start difference. First operand 109 states and 264 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:06,487 INFO L93 Difference]: Finished difference Result 134 states and 324 transitions. [2025-04-13 23:03:06,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:03:06,488 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:03:06,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:06,489 INFO L225 Difference]: With dead ends: 134 [2025-04-13 23:03:06,489 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 23:03:06,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:03:06,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:06,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 23:03:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2025-04-13 23:03:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.4) internal successors, (240), 100 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have 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:03:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 240 transitions. [2025-04-13 23:03:06,500 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 240 transitions. Word has length 16 [2025-04-13 23:03:06,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:06,500 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 240 transitions. [2025-04-13 23:03:06,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,500 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 240 transitions. [2025-04-13 23:03:06,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:03:06,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:06,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:06,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:03:06,501 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:06,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash -858137529, now seen corresponding path program 5 times [2025-04-13 23:03:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:06,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591787762] [2025-04-13 23:03:06,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:06,510 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:03:06,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:03:06,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:06,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:06,555 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:03:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:06,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591787762] [2025-04-13 23:03:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591787762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:06,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:03:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527412098] [2025-04-13 23:03:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:06,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:03:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:06,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:03:06,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:03:06,556 INFO L87 Difference]: Start difference. First operand 101 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:06,593 INFO L93 Difference]: Finished difference Result 147 states and 347 transitions. [2025-04-13 23:03:06,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:03:06,593 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:03:06,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:06,594 INFO L225 Difference]: With dead ends: 147 [2025-04-13 23:03:06,594 INFO L226 Difference]: Without dead ends: 97 [2025-04-13 23:03:06,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:03:06,595 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:06,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:03:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-13 23:03:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-13 23:03:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have 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:03:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 213 transitions. [2025-04-13 23:03:06,603 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 213 transitions. Word has length 16 [2025-04-13 23:03:06,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:06,603 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 213 transitions. [2025-04-13 23:03:06,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:06,603 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 213 transitions. [2025-04-13 23:03:06,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:03:06,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:06,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:06,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:03:06,604 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:06,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 954859887, now seen corresponding path program 1 times [2025-04-13 23:03:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:06,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415545386] [2025-04-13 23:03:06,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:06,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:06,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:03:06,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:03:06,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:06,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:06,706 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:03:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:06,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415545386] [2025-04-13 23:03:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415545386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:06,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996111270] [2025-04-13 23:03:06,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:06,709 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:03:06,710 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:03:06,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:03:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:03:06,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:06,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:06,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:03:06,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:06,848 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:03:06,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:06,918 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:03:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996111270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:06,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:03:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932266125] [2025-04-13 23:03:06,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:06,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:03:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:06,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:03:06,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:03:06,919 INFO L87 Difference]: Start difference. First operand 97 states and 213 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:03:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:07,027 INFO L93 Difference]: Finished difference Result 239 states and 538 transitions. [2025-04-13 23:03:07,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:03:07,027 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:03:07,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:07,028 INFO L225 Difference]: With dead ends: 239 [2025-04-13 23:03:07,028 INFO L226 Difference]: Without dead ends: 147 [2025-04-13 23:03:07,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:03:07,029 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:07,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-13 23:03:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2025-04-13 23:03:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.1923076923076925) internal successors, (228), 104 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:03:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 228 transitions. [2025-04-13 23:03:07,034 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 228 transitions. Word has length 18 [2025-04-13 23:03:07,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:07,034 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 228 transitions. [2025-04-13 23:03:07,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:03:07,034 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 228 transitions. [2025-04-13 23:03:07,034 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:03:07,034 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:07,035 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:07,041 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:03:07,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:07,239 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:07,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash 711060655, now seen corresponding path program 1 times [2025-04-13 23:03:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:07,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779802842] [2025-04-13 23:03:07,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:07,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:03:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:03:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:07,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:07,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779802842] [2025-04-13 23:03:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779802842] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:07,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188479584] [2025-04-13 23:03:07,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:07,334 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:03:07,336 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:03:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:03:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:03:07,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:07,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:07,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:03:07,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:07,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:03:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188479584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:03:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-13 23:03:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562152894] [2025-04-13 23:03:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:07,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:03:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:07,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:03:07,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:07,425 INFO L87 Difference]: Start difference. First operand 105 states and 228 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:07,486 INFO L93 Difference]: Finished difference Result 222 states and 508 transitions. [2025-04-13 23:03:07,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:03:07,486 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:03:07,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:07,487 INFO L225 Difference]: With dead ends: 222 [2025-04-13 23:03:07,487 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 23:03:07,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:03:07,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:07,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 23:03:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2025-04-13 23:03:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.4545454545454546) internal successors, (297), 121 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 297 transitions. [2025-04-13 23:03:07,497 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 297 transitions. Word has length 18 [2025-04-13 23:03:07,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:07,497 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 297 transitions. [2025-04-13 23:03:07,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:07,497 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 297 transitions. [2025-04-13 23:03:07,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:03:07,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:07,498 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:07,506 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:03:07,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 23:03:07,699 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:07,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1932210804, now seen corresponding path program 2 times [2025-04-13 23:03:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:07,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526376113] [2025-04-13 23:03:07,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:07,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:03:07,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-04-13 23:03:07,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:03:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:07,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526376113] [2025-04-13 23:03:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526376113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:03:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146706585] [2025-04-13 23:03:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:07,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:03:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:07,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:03:07,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:03:07,792 INFO L87 Difference]: Start difference. First operand 122 states and 297 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:07,873 INFO L93 Difference]: Finished difference Result 182 states and 461 transitions. [2025-04-13 23:03:07,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:03:07,873 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 23:03:07,873 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:07,875 INFO L225 Difference]: With dead ends: 182 [2025-04-13 23:03:07,875 INFO L226 Difference]: Without dead ends: 169 [2025-04-13 23:03:07,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:03:07,875 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:07,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-13 23:03:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-04-13 23:03:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4702380952380953) internal successors, (415), 168 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have 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:03:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 415 transitions. [2025-04-13 23:03:07,884 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 415 transitions. Word has length 19 [2025-04-13 23:03:07,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:07,884 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 415 transitions. [2025-04-13 23:03:07,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:07,885 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 415 transitions. [2025-04-13 23:03:07,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:07,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:07,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:07,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:03:07,885 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:07,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1427578262, now seen corresponding path program 1 times [2025-04-13 23:03:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:07,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458430773] [2025-04-13 23:03:07,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:07,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:07,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:08,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458430773] [2025-04-13 23:03:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458430773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:08,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859498340] [2025-04-13 23:03:08,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:03:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:08,560 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:03:08,561 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:03:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:08,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:08,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:08,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:03:08,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:09,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:09,521 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:09,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-13 23:03:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859498340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:09,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2025-04-13 23:03:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257362599] [2025-04-13 23:03:09,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:09,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:09,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:09,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:09,898 INFO L87 Difference]: Start difference. First operand 169 states and 415 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:13,426 INFO L93 Difference]: Finished difference Result 368 states and 846 transitions. [2025-04-13 23:03:13,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:03:13,426 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:13,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:13,428 INFO L225 Difference]: With dead ends: 368 [2025-04-13 23:03:13,428 INFO L226 Difference]: Without dead ends: 359 [2025-04-13 23:03:13,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=348, Invalid=2844, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:03:13,429 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:13,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:03:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-04-13 23:03:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 210. [2025-04-13 23:03:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.4210526315789473) internal successors, (506), 209 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have 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:03:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2025-04-13 23:03:13,448 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 21 [2025-04-13 23:03:13,448 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:13,448 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2025-04-13 23:03:13,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:13,448 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2025-04-13 23:03:13,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:13,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:13,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:13,455 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:03:13,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:13,649 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:13,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2085818484, now seen corresponding path program 2 times [2025-04-13 23:03:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:13,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526076665] [2025-04-13 23:03:13,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:13,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:13,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:13,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:13,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:14,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526076665] [2025-04-13 23:03:14,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526076665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:14,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605062745] [2025-04-13 23:03:14,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:14,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:14,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:14,220 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:03:14,222 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:03:14,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:14,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:14,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:14,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:14,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:03:14,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:14,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:15,099 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:15,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-13 23:03:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:15,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605062745] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:15,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:15,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-04-13 23:03:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814997967] [2025-04-13 23:03:15,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:15,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:03:15,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:15,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:03:15,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1562, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:03:15,431 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:17,091 INFO L93 Difference]: Finished difference Result 340 states and 773 transitions. [2025-04-13 23:03:17,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:03:17,091 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:17,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:17,093 INFO L225 Difference]: With dead ends: 340 [2025-04-13 23:03:17,093 INFO L226 Difference]: Without dead ends: 327 [2025-04-13 23:03:17,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=421, Invalid=3239, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 23:03:17,094 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:17,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:03:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-04-13 23:03:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 218. [2025-04-13 23:03:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.4193548387096775) internal successors, (525), 217 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:03:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 525 transitions. [2025-04-13 23:03:17,113 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 525 transitions. Word has length 21 [2025-04-13 23:03:17,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:17,114 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 525 transitions. [2025-04-13 23:03:17,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,115 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 525 transitions. [2025-04-13 23:03:17,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:17,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:17,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:17,122 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:03:17,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:17,317 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:17,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -568549940, now seen corresponding path program 3 times [2025-04-13 23:03:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:17,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69518454] [2025-04-13 23:03:17,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:17,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:17,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:17,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:17,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:17,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69518454] [2025-04-13 23:03:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69518454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:17,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851463025] [2025-04-13 23:03:17,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:17,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:17,818 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:03:17,819 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:03:17,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:17,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:17,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:17,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:03:17,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:18,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:18,740 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:18,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-04-13 23:03:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851463025] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:19,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329632857] [2025-04-13 23:03:19,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:19,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:19,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:19,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:19,041 INFO L87 Difference]: Start difference. First operand 218 states and 525 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:20,422 INFO L93 Difference]: Finished difference Result 344 states and 798 transitions. [2025-04-13 23:03:20,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 23:03:20,423 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:20,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:20,425 INFO L225 Difference]: With dead ends: 344 [2025-04-13 23:03:20,425 INFO L226 Difference]: Without dead ends: 325 [2025-04-13 23:03:20,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2699, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:03:20,426 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:20,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:03:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-13 23:03:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 234. [2025-04-13 23:03:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.407725321888412) internal successors, (561), 233 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:03:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 561 transitions. [2025-04-13 23:03:20,447 INFO L79 Accepts]: Start accepts. Automaton has 234 states and 561 transitions. Word has length 21 [2025-04-13 23:03:20,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:20,447 INFO L485 AbstractCegarLoop]: Abstraction has 234 states and 561 transitions. [2025-04-13 23:03:20,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:20,447 INFO L278 IsEmpty]: Start isEmpty. Operand 234 states and 561 transitions. [2025-04-13 23:03:20,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:20,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:20,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:20,457 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:03:20,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:03:20,648 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:20,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash -516886580, now seen corresponding path program 4 times [2025-04-13 23:03:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:20,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956096173] [2025-04-13 23:03:20,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:20,656 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:20,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:20,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:20,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:21,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956096173] [2025-04-13 23:03:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956096173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:21,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129862769] [2025-04-13 23:03:21,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:21,130 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:03:21,131 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:03:21,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:21,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:21,181 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:21,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:21,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:03:21,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:21,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:21,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:21,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:03:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129862769] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:22,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74289206] [2025-04-13 23:03:22,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:22,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:22,194 INFO L87 Difference]: Start difference. First operand 234 states and 561 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,535 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:03:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:26,095 INFO L93 Difference]: Finished difference Result 335 states and 778 transitions. [2025-04-13 23:03:26,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:03:26,095 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:26,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:26,097 INFO L225 Difference]: With dead ends: 335 [2025-04-13 23:03:26,097 INFO L226 Difference]: Without dead ends: 312 [2025-04-13 23:03:26,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=2600, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 23:03:26,097 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:26,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 23:03:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-04-13 23:03:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 224. [2025-04-13 23:03:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.403587443946188) internal successors, (536), 223 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:03:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 536 transitions. [2025-04-13 23:03:26,116 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 536 transitions. Word has length 21 [2025-04-13 23:03:26,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:26,116 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 536 transitions. [2025-04-13 23:03:26,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:26,116 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 536 transitions. [2025-04-13 23:03:26,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:26,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:26,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:26,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:03:26,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:26,318 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:26,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash 290919236, now seen corresponding path program 5 times [2025-04-13 23:03:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:26,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062367744] [2025-04-13 23:03:26,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:26,323 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:26,337 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:26,337 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:26,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:27,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062367744] [2025-04-13 23:03:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062367744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:27,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34603722] [2025-04-13 23:03:27,014 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:27,016 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:03:27,017 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:03:27,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:27,073 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:27,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:27,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:27,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 23:03:27,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:27,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:03:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:27,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:28,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2025-04-13 23:03:28,059 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:28,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2025-04-13 23:03:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34603722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:28,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 39 [2025-04-13 23:03:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977865853] [2025-04-13 23:03:28,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:28,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:28,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:28,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:28,234 INFO L87 Difference]: Start difference. First operand 224 states and 536 transitions. Second operand has 41 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:03:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:30,200 INFO L93 Difference]: Finished difference Result 376 states and 852 transitions. [2025-04-13 23:03:30,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:03:30,200 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 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 21 [2025-04-13 23:03:30,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:30,202 INFO L225 Difference]: With dead ends: 376 [2025-04-13 23:03:30,202 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 23:03:30,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=400, Invalid=3022, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:03:30,203 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:30,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:03:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 23:03:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 248. [2025-04-13 23:03:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.4048582995951415) internal successors, (594), 247 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:03:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 594 transitions. [2025-04-13 23:03:30,232 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 594 transitions. Word has length 21 [2025-04-13 23:03:30,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:30,232 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 594 transitions. [2025-04-13 23:03:30,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:03:30,232 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 594 transitions. [2025-04-13 23:03:30,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:30,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:30,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:30,240 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:03:30,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:30,435 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:30,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1157069640, now seen corresponding path program 6 times [2025-04-13 23:03:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:30,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591117266] [2025-04-13 23:03:30,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:30,440 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:30,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:30,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:30,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:30,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:30,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591117266] [2025-04-13 23:03:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591117266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:30,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506882739] [2025-04-13 23:03:30,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:30,951 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:03:30,951 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:03:30,986 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:31,023 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:31,023 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:31,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 23:03:31,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:31,378 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:03:31,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-04-13 23:03:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:31,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:31,830 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:31,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-13 23:03:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506882739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:32,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-04-13 23:03:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749248484] [2025-04-13 23:03:32,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:32,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:03:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:32,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:03:32,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:03:32,156 INFO L87 Difference]: Start difference. First operand 248 states and 594 transitions. Second operand has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:33,681 INFO L93 Difference]: Finished difference Result 343 states and 798 transitions. [2025-04-13 23:03:33,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:03:33,682 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:33,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:33,683 INFO L225 Difference]: With dead ends: 343 [2025-04-13 23:03:33,683 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 23:03:33,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=390, Invalid=3032, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:03:33,684 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:33,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:03:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 23:03:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 258. [2025-04-13 23:03:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.424124513618677) internal successors, (623), 257 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have 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:03:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 623 transitions. [2025-04-13 23:03:33,712 INFO L79 Accepts]: Start accepts. Automaton has 258 states and 623 transitions. Word has length 21 [2025-04-13 23:03:33,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:33,713 INFO L485 AbstractCegarLoop]: Abstraction has 258 states and 623 transitions. [2025-04-13 23:03:33,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:33,713 INFO L278 IsEmpty]: Start isEmpty. Operand 258 states and 623 transitions. [2025-04-13 23:03:33,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:33,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:33,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:33,720 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:03:33,914 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,SelfDestructingSolverStorable15 [2025-04-13 23:03:33,914 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:33,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1620629112, now seen corresponding path program 7 times [2025-04-13 23:03:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:33,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335338627] [2025-04-13 23:03:33,914 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:33,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:33,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:33,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:34,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335338627] [2025-04-13 23:03:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335338627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:34,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457669215] [2025-04-13 23:03:34,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:34,405 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:03:34,407 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:03:34,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:34,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:34,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:34,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:34,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:03:34,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:34,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:35,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:35,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:03:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457669215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:35,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:35,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:03:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648722073] [2025-04-13 23:03:35,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:35,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:03:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:35,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:03:35,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:03:35,628 INFO L87 Difference]: Start difference. First operand 258 states and 623 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:36,969 INFO L93 Difference]: Finished difference Result 355 states and 842 transitions. [2025-04-13 23:03:36,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 23:03:36,969 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:36,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:36,971 INFO L225 Difference]: With dead ends: 355 [2025-04-13 23:03:36,971 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 23:03:36,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 23:03:36,972 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:36,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:03:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 23:03:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 278. [2025-04-13 23:03:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.422382671480144) internal successors, (671), 277 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have 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:03:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 671 transitions. [2025-04-13 23:03:37,003 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 671 transitions. Word has length 21 [2025-04-13 23:03:37,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:37,004 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 671 transitions. [2025-04-13 23:03:37,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:37,004 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 671 transitions. [2025-04-13 23:03:37,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:37,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:37,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] [2025-04-13 23:03:37,010 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:03:37,209 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,SelfDestructingSolverStorable16 [2025-04-13 23:03:37,209 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:37,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1568965752, now seen corresponding path program 8 times [2025-04-13 23:03:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:37,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923195969] [2025-04-13 23:03:37,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:37,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:37,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:37,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:37,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:37,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923195969] [2025-04-13 23:03:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923195969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:37,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345406782] [2025-04-13 23:03:37,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:37,658 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:03:37,659 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:03:37,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:37,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:37,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:37,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:37,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:03:37,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:38,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:38,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:38,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:03:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345406782] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:38,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:38,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:38,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42179876] [2025-04-13 23:03:38,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:38,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:38,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:38,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:38,783 INFO L87 Difference]: Start difference. First operand 278 states and 671 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:39,981 INFO L93 Difference]: Finished difference Result 351 states and 825 transitions. [2025-04-13 23:03:39,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 23:03:39,981 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:39,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:39,983 INFO L225 Difference]: With dead ends: 351 [2025-04-13 23:03:39,983 INFO L226 Difference]: Without dead ends: 324 [2025-04-13 23:03:39,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=409, Invalid=3013, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:03:39,984 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:39,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:03:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-13 23:03:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 264. [2025-04-13 23:03:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.418250950570342) internal successors, (636), 263 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have 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:03:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 636 transitions. [2025-04-13 23:03:40,014 INFO L79 Accepts]: Start accepts. Automaton has 264 states and 636 transitions. Word has length 21 [2025-04-13 23:03:40,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:40,014 INFO L485 AbstractCegarLoop]: Abstraction has 264 states and 636 transitions. [2025-04-13 23:03:40,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:40,014 INFO L278 IsEmpty]: Start isEmpty. Operand 264 states and 636 transitions. [2025-04-13 23:03:40,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:40,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:40,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:40,021 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:03:40,215 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,SelfDestructingSolverStorable17 [2025-04-13 23:03:40,215 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:40,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -761159936, now seen corresponding path program 9 times [2025-04-13 23:03:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:40,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264621413] [2025-04-13 23:03:40,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:40,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:40,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:03:40,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:03:40,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:40,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264621413] [2025-04-13 23:03:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264621413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:03:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186818797] [2025-04-13 23:03:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:40,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:03:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:03:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:40,448 INFO L87 Difference]: Start difference. First operand 264 states and 636 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:40,711 INFO L93 Difference]: Finished difference Result 305 states and 716 transitions. [2025-04-13 23:03:40,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:03:40,711 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:40,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:40,712 INFO L225 Difference]: With dead ends: 305 [2025-04-13 23:03:40,712 INFO L226 Difference]: Without dead ends: 287 [2025-04-13 23:03:40,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:40,713 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:40,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:03:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-04-13 23:03:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 262. [2025-04-13 23:03:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.425287356321839) internal successors, (633), 261 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have 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:03:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 633 transitions. [2025-04-13 23:03:40,744 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 633 transitions. Word has length 21 [2025-04-13 23:03:40,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:40,745 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 633 transitions. [2025-04-13 23:03:40,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:40,745 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 633 transitions. [2025-04-13 23:03:40,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:40,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:40,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:40,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:03:40,746 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:40,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -533503864, now seen corresponding path program 10 times [2025-04-13 23:03:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:40,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619627389] [2025-04-13 23:03:40,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:40,750 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:40,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:40,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:40,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:41,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619627389] [2025-04-13 23:03:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619627389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:41,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813461818] [2025-04-13 23:03:41,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:41,100 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:03:41,100 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:03:41,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:41,161 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:41,161 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:41,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:41,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:03:41,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:41,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:03:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:41,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:41,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:41,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:03:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813461818] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:42,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:03:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615651402] [2025-04-13 23:03:42,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:42,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:03:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:03:42,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:03:42,253 INFO L87 Difference]: Start difference. First operand 262 states and 633 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:43,374 INFO L93 Difference]: Finished difference Result 358 states and 848 transitions. [2025-04-13 23:03:43,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 23:03:43,374 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:43,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:43,376 INFO L225 Difference]: With dead ends: 358 [2025-04-13 23:03:43,376 INFO L226 Difference]: Without dead ends: 337 [2025-04-13 23:03:43,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=2195, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:03:43,378 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:43,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:03:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-13 23:03:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 286. [2025-04-13 23:03:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.4596491228070176) internal successors, (701), 285 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have 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:03:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 701 transitions. [2025-04-13 23:03:43,413 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 701 transitions. Word has length 21 [2025-04-13 23:03:43,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:43,413 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 701 transitions. [2025-04-13 23:03:43,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:43,413 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 701 transitions. [2025-04-13 23:03:43,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:43,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:43,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:43,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:03:43,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:43,614 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:43,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash -481840504, now seen corresponding path program 11 times [2025-04-13 23:03:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:43,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204725882] [2025-04-13 23:03:43,615 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:43,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:43,630 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:43,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:44,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204725882] [2025-04-13 23:03:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204725882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:44,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568995164] [2025-04-13 23:03:44,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:44,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:44,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:44,069 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:03:44,070 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:03:44,107 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:44,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:44,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:44,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:44,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:03:44,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:44,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:44,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 23:03:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:44,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:44,946 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:44,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:03:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568995164] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:45,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:03:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112334779] [2025-04-13 23:03:45,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:45,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:03:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:45,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:03:45,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:03:45,228 INFO L87 Difference]: Start difference. First operand 286 states and 701 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:46,580 INFO L93 Difference]: Finished difference Result 339 states and 809 transitions. [2025-04-13 23:03:46,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:03:46,581 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:46,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:46,582 INFO L225 Difference]: With dead ends: 339 [2025-04-13 23:03:46,582 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 23:03:46,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:03:46,584 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:46,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:03:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 23:03:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 276. [2025-04-13 23:03:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.4654545454545453) internal successors, (678), 275 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:03:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 678 transitions. [2025-04-13 23:03:46,625 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 678 transitions. Word has length 21 [2025-04-13 23:03:46,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:46,625 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 678 transitions. [2025-04-13 23:03:46,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:46,625 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 678 transitions. [2025-04-13 23:03:46,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:46,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:46,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:46,631 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:03:46,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 23:03:46,826 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:46,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash 37950942, now seen corresponding path program 12 times [2025-04-13 23:03:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:46,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168681545] [2025-04-13 23:03:46,826 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:46,830 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:46,835 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:03:46,835 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:03:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:47,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168681545] [2025-04-13 23:03:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168681545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:03:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108679143] [2025-04-13 23:03:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:47,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:03:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:47,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:03:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:47,032 INFO L87 Difference]: Start difference. First operand 276 states and 678 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:47,206 INFO L93 Difference]: Finished difference Result 297 states and 715 transitions. [2025-04-13 23:03:47,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:03:47,207 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:47,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:47,208 INFO L225 Difference]: With dead ends: 297 [2025-04-13 23:03:47,208 INFO L226 Difference]: Without dead ends: 286 [2025-04-13 23:03:47,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:47,209 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:47,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:03:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-04-13 23:03:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-04-13 23:03:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.4456140350877194) internal successors, (697), 285 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have 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:03:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 697 transitions. [2025-04-13 23:03:47,246 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 697 transitions. Word has length 21 [2025-04-13 23:03:47,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:47,246 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 697 transitions. [2025-04-13 23:03:47,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:47,247 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 697 transitions. [2025-04-13 23:03:47,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:47,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:47,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:47,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 23:03:47,247 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:47,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 89614302, now seen corresponding path program 13 times [2025-04-13 23:03:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:47,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029598400] [2025-04-13 23:03:47,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:47,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029598400] [2025-04-13 23:03:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029598400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:47,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548324812] [2025-04-13 23:03:47,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:47,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:47,652 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:03:47,658 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:03:47,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:03:47,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:47,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:03:47,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:47,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:03:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:48,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:48,472 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:48,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-04-13 23:03:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548324812] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:48,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629463998] [2025-04-13 23:03:48,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:48,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:48,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:48,690 INFO L87 Difference]: Start difference. First operand 286 states and 697 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:49,865 INFO L93 Difference]: Finished difference Result 362 states and 861 transitions. [2025-04-13 23:03:49,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 23:03:49,865 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:49,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:49,866 INFO L225 Difference]: With dead ends: 362 [2025-04-13 23:03:49,867 INFO L226 Difference]: Without dead ends: 337 [2025-04-13 23:03:49,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 23:03:49,867 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:49,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:03:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-13 23:03:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 300. [2025-04-13 23:03:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.448160535117057) internal successors, (732), 299 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have 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:03:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 732 transitions. [2025-04-13 23:03:49,901 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 732 transitions. Word has length 21 [2025-04-13 23:03:49,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:49,901 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 732 transitions. [2025-04-13 23:03:49,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:49,901 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 732 transitions. [2025-04-13 23:03:49,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:49,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:49,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:49,908 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:03:50,102 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,SelfDestructingSolverStorable22 [2025-04-13 23:03:50,102 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:50,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -794759164, now seen corresponding path program 14 times [2025-04-13 23:03:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:50,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041475261] [2025-04-13 23:03:50,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:50,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:50,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:03:50,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:03:50,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:50,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041475261] [2025-04-13 23:03:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041475261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:50,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:50,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:03:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411315994] [2025-04-13 23:03:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:50,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:03:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:03:50,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:50,312 INFO L87 Difference]: Start difference. First operand 300 states and 732 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:50,533 INFO L93 Difference]: Finished difference Result 314 states and 751 transitions. [2025-04-13 23:03:50,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:03:50,534 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:50,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:50,535 INFO L225 Difference]: With dead ends: 314 [2025-04-13 23:03:50,535 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 23:03:50,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:03:50,536 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:50,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:03:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 23:03:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-04-13 23:03:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.447457627118644) internal successors, (722), 295 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have 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:03:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 722 transitions. [2025-04-13 23:03:50,569 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 722 transitions. Word has length 21 [2025-04-13 23:03:50,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:50,569 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 722 transitions. [2025-04-13 23:03:50,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:50,569 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 722 transitions. [2025-04-13 23:03:50,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:50,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:50,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:50,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 23:03:50,570 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:50,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2097661858, now seen corresponding path program 15 times [2025-04-13 23:03:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:50,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250757921] [2025-04-13 23:03:50,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:50,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:50,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:50,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:50,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:50,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250757921] [2025-04-13 23:03:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250757921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:50,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393799344] [2025-04-13 23:03:50,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:50,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:50,991 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:03:50,992 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:03:51,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:51,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:51,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:51,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:51,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 23:03:51,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:51,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:51,731 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:51,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-04-13 23:03:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393799344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:52,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-04-13 23:03:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432324556] [2025-04-13 23:03:52,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:52,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:03:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:52,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:03:52,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1517, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:03:52,155 INFO L87 Difference]: Start difference. First operand 296 states and 722 transitions. Second operand has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:53,210 INFO L93 Difference]: Finished difference Result 400 states and 942 transitions. [2025-04-13 23:03:53,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:03:53,210 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:53,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:53,212 INFO L225 Difference]: With dead ends: 400 [2025-04-13 23:03:53,212 INFO L226 Difference]: Without dead ends: 387 [2025-04-13 23:03:53,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=343, Invalid=2207, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:03:53,212 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:53,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:03:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-04-13 23:03:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 314. [2025-04-13 23:03:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.4568690095846644) internal successors, (769), 313 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have 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:03:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 769 transitions. [2025-04-13 23:03:53,256 INFO L79 Accepts]: Start accepts. Automaton has 314 states and 769 transitions. Word has length 21 [2025-04-13 23:03:53,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:53,256 INFO L485 AbstractCegarLoop]: Abstraction has 314 states and 769 transitions. [2025-04-13 23:03:53,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:53,256 INFO L278 IsEmpty]: Start isEmpty. Operand 314 states and 769 transitions. [2025-04-13 23:03:53,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:53,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:53,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:53,263 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:03:53,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:53,457 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:53,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash -580393314, now seen corresponding path program 16 times [2025-04-13 23:03:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:53,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032134645] [2025-04-13 23:03:53,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:53,461 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:53,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:53,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:53,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:53,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032134645] [2025-04-13 23:03:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032134645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:53,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428102405] [2025-04-13 23:03:53,821 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:53,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:53,823 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:03:53,824 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:03:53,860 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:53,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:53,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:03:53,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:54,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:54,535 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:54,535 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2025-04-13 23:03:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428102405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:54,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530426245] [2025-04-13 23:03:54,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:54,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:54,880 INFO L87 Difference]: Start difference. First operand 314 states and 769 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:56,492 INFO L93 Difference]: Finished difference Result 427 states and 1014 transitions. [2025-04-13 23:03:56,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 23:03:56,492 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:03:56,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:56,494 INFO L225 Difference]: With dead ends: 427 [2025-04-13 23:03:56,494 INFO L226 Difference]: Without dead ends: 405 [2025-04-13 23:03:56,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=2803, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:03:56,495 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:56,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:03:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-04-13 23:03:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 328. [2025-04-13 23:03:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.458715596330275) internal successors, (804), 327 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have 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:03:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 804 transitions. [2025-04-13 23:03:56,542 INFO L79 Accepts]: Start accepts. Automaton has 328 states and 804 transitions. Word has length 21 [2025-04-13 23:03:56,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:56,542 INFO L485 AbstractCegarLoop]: Abstraction has 328 states and 804 transitions. [2025-04-13 23:03:56,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:56,542 INFO L278 IsEmpty]: Start isEmpty. Operand 328 states and 804 transitions. [2025-04-13 23:03:56,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:03:56,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:56,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:56,549 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:03:56,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 23:03:56,743 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:03:56,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -528729954, now seen corresponding path program 17 times [2025-04-13 23:03:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:56,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169281610] [2025-04-13 23:03:56,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:56,747 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:56,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:56,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:56,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:57,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169281610] [2025-04-13 23:03:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169281610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:57,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161743818] [2025-04-13 23:03:57,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:57,200 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:03:57,238 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:03:57,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:03:57,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:57,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:03:57,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:57,542 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-13 23:03:57,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2025-04-13 23:03:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:57,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:58,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:58,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:03:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161743818] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:58,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:03:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731631684] [2025-04-13 23:03:58,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:58,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:03:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:58,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:03:58,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:03:58,297 INFO L87 Difference]: Start difference. First operand 328 states and 804 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:01,221 INFO L93 Difference]: Finished difference Result 452 states and 1072 transitions. [2025-04-13 23:04:01,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:04:01,222 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:01,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:01,223 INFO L225 Difference]: With dead ends: 452 [2025-04-13 23:04:01,223 INFO L226 Difference]: Without dead ends: 439 [2025-04-13 23:04:01,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=701, Invalid=4849, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:04:01,224 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:01,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:04:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-13 23:04:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 318. [2025-04-13 23:04:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.451104100946372) internal successors, (777), 317 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:04:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 777 transitions. [2025-04-13 23:04:01,270 INFO L79 Accepts]: Start accepts. Automaton has 318 states and 777 transitions. Word has length 21 [2025-04-13 23:04:01,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:01,270 INFO L485 AbstractCegarLoop]: Abstraction has 318 states and 777 transitions. [2025-04-13 23:04:01,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:01,270 INFO L278 IsEmpty]: Start isEmpty. Operand 318 states and 777 transitions. [2025-04-13 23:04:01,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:01,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:01,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:01,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 23:04:01,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 23:04:01,471 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:01,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 279075862, now seen corresponding path program 18 times [2025-04-13 23:04:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:01,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356626087] [2025-04-13 23:04:01,472 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:01,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:01,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:04:01,483 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:01,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356626087] [2025-04-13 23:04:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356626087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:04:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026746360] [2025-04-13 23:04:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:01,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:01,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:01,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:01,675 INFO L87 Difference]: Start difference. First operand 318 states and 777 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:01,884 INFO L93 Difference]: Finished difference Result 363 states and 863 transitions. [2025-04-13 23:04:01,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:04:01,885 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:01,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:01,886 INFO L225 Difference]: With dead ends: 363 [2025-04-13 23:04:01,886 INFO L226 Difference]: Without dead ends: 349 [2025-04-13 23:04:01,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:01,886 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:01,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:04:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-04-13 23:04:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2025-04-13 23:04:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.450479233226837) internal successors, (767), 313 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have 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:04:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 767 transitions. [2025-04-13 23:04:01,933 INFO L79 Accepts]: Start accepts. Automaton has 314 states and 767 transitions. Word has length 21 [2025-04-13 23:04:01,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:01,933 INFO L485 AbstractCegarLoop]: Abstraction has 314 states and 767 transitions. [2025-04-13 23:04:01,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:01,933 INFO L278 IsEmpty]: Start isEmpty. Operand 314 states and 767 transitions. [2025-04-13 23:04:01,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:01,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:01,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:01,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 23:04:01,933 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:01,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 591994522, now seen corresponding path program 19 times [2025-04-13 23:04:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:01,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780452638] [2025-04-13 23:04:01,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:01,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:01,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:02,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780452638] [2025-04-13 23:04:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780452638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:02,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689787039] [2025-04-13 23:04:02,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:02,324 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:02,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:04:02,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:02,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:02,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:02,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:04:02,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:02,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:04:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:02,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:03,073 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:03,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:03,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689787039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:03,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:03,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889073723] [2025-04-13 23:04:03,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:03,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:03,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:03,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:03,338 INFO L87 Difference]: Start difference. First operand 314 states and 767 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:04,811 INFO L93 Difference]: Finished difference Result 442 states and 1043 transitions. [2025-04-13 23:04:04,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:04:04,812 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:04,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:04,813 INFO L225 Difference]: With dead ends: 442 [2025-04-13 23:04:04,814 INFO L226 Difference]: Without dead ends: 419 [2025-04-13 23:04:04,814 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=2702, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:04:04,814 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:04,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:04:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-13 23:04:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 320. [2025-04-13 23:04:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.445141065830721) internal successors, (780), 319 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:04:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 780 transitions. [2025-04-13 23:04:04,863 INFO L79 Accepts]: Start accepts. Automaton has 320 states and 780 transitions. Word has length 21 [2025-04-13 23:04:04,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:04,863 INFO L485 AbstractCegarLoop]: Abstraction has 320 states and 780 transitions. [2025-04-13 23:04:04,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:04,863 INFO L278 IsEmpty]: Start isEmpty. Operand 320 states and 780 transitions. [2025-04-13 23:04:04,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:04,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:04,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:04,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 23:04:05,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 23:04:05,064 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:05,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 506731934, now seen corresponding path program 20 times [2025-04-13 23:04:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:05,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97922508] [2025-04-13 23:04:05,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:05,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:05,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:05,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:05,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97922508] [2025-04-13 23:04:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97922508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:05,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727552570] [2025-04-13 23:04:05,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:05,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:05,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:05,454 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:05,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 23:04:05,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:05,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:05,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:05,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:05,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 23:04:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:05,780 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:05,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-13 23:04:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:05,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:06,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:06,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727552570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:06,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555495995] [2025-04-13 23:04:06,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:06,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:06,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:06,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:06,740 INFO L87 Difference]: Start difference. First operand 320 states and 780 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:08,301 INFO L93 Difference]: Finished difference Result 452 states and 1056 transitions. [2025-04-13 23:04:08,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 23:04:08,302 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:08,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:08,303 INFO L225 Difference]: With dead ends: 452 [2025-04-13 23:04:08,303 INFO L226 Difference]: Without dead ends: 403 [2025-04-13 23:04:08,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=610, Invalid=3422, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:04:08,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:08,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:04:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-04-13 23:04:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 350. [2025-04-13 23:04:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.495702005730659) internal successors, (871), 349 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have 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:04:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 871 transitions. [2025-04-13 23:04:08,356 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 871 transitions. Word has length 21 [2025-04-13 23:04:08,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:08,356 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 871 transitions. [2025-04-13 23:04:08,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:08,357 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 871 transitions. [2025-04-13 23:04:08,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:08,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:08,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:08,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 23:04:08,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:08,561 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:08,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash 558395294, now seen corresponding path program 21 times [2025-04-13 23:04:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:08,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849137084] [2025-04-13 23:04:08,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:08,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:08,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:08,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:08,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:08,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849137084] [2025-04-13 23:04:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849137084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:08,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189253521] [2025-04-13 23:04:08,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:08,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:09,010 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 23:04:09,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:09,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:09,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:09,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:09,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 23:04:09,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:09,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:04:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:09,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:09,859 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:09,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189253521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:10,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244074004] [2025-04-13 23:04:10,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:10,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:10,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:10,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1419, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:10,113 INFO L87 Difference]: Start difference. First operand 350 states and 871 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:11,035 INFO L93 Difference]: Finished difference Result 407 states and 967 transitions. [2025-04-13 23:04:11,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 23:04:11,035 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:11,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:11,037 INFO L225 Difference]: With dead ends: 407 [2025-04-13 23:04:11,037 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 23:04:11,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=1967, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 23:04:11,038 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:11,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:04:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 23:04:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 334. [2025-04-13 23:04:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.4654654654654653) internal successors, (821), 333 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have 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:04:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 821 transitions. [2025-04-13 23:04:11,099 INFO L79 Accepts]: Start accepts. Automaton has 334 states and 821 transitions. Word has length 21 [2025-04-13 23:04:11,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:11,099 INFO L485 AbstractCegarLoop]: Abstraction has 334 states and 821 transitions. [2025-04-13 23:04:11,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:11,099 INFO L278 IsEmpty]: Start isEmpty. Operand 334 states and 821 transitions. [2025-04-13 23:04:11,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:11,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:11,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:11,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 23:04:11,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:11,300 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:11,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1078186740, now seen corresponding path program 22 times [2025-04-13 23:04:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:11,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921344068] [2025-04-13 23:04:11,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:11,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:11,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:11,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:11,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921344068] [2025-04-13 23:04:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921344068] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:11,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876761810] [2025-04-13 23:04:11,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:11,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:11,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 23:04:11,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:11,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:11,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:11,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:04:11,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:11,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:04:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:12,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:12,512 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:12,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876761810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:12,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:04:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008698558] [2025-04-13 23:04:12,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:12,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:04:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:12,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:04:12,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:04:12,808 INFO L87 Difference]: Start difference. First operand 334 states and 821 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:14,373 INFO L93 Difference]: Finished difference Result 438 states and 1030 transitions. [2025-04-13 23:04:14,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:04:14,374 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:14,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:14,375 INFO L225 Difference]: With dead ends: 438 [2025-04-13 23:04:14,375 INFO L226 Difference]: Without dead ends: 410 [2025-04-13 23:04:14,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=3261, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:04:14,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:14,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:04:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-13 23:04:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 352. [2025-04-13 23:04:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.472934472934473) internal successors, (868), 351 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have 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:04:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 868 transitions. [2025-04-13 23:04:14,439 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 868 transitions. Word has length 21 [2025-04-13 23:04:14,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:14,439 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 868 transitions. [2025-04-13 23:04:14,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:14,439 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 868 transitions. [2025-04-13 23:04:14,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:14,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:14,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:14,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 23:04:14,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 23:04:14,641 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:14,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1129850100, now seen corresponding path program 23 times [2025-04-13 23:04:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:14,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400325718] [2025-04-13 23:04:14,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:14,646 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:14,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:14,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:15,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:15,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400325718] [2025-04-13 23:04:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400325718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:15,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513017072] [2025-04-13 23:04:15,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:15,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:15,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:15,111 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 23:04:15,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:15,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:15,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:15,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:15,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 23:04:15,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:15,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2025-04-13 23:04:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:15,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:15,892 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:15,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2025-04-13 23:04:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513017072] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:16,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134204664] [2025-04-13 23:04:16,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:16,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:16,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:16,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:16,245 INFO L87 Difference]: Start difference. First operand 352 states and 868 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:17,997 INFO L93 Difference]: Finished difference Result 415 states and 983 transitions. [2025-04-13 23:04:17,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 23:04:17,997 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:17,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:17,999 INFO L225 Difference]: With dead ends: 415 [2025-04-13 23:04:17,999 INFO L226 Difference]: Without dead ends: 390 [2025-04-13 23:04:17,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=573, Invalid=3587, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:04:18,000 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:18,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:04:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-04-13 23:04:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 342. [2025-04-13 23:04:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.4486803519061584) internal successors, (835), 341 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have 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:04:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 835 transitions. [2025-04-13 23:04:18,067 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 835 transitions. Word has length 21 [2025-04-13 23:04:18,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:18,067 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 835 transitions. [2025-04-13 23:04:18,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:18,067 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 835 transitions. [2025-04-13 23:04:18,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:18,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:18,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 23:04:18,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 23:04:18,268 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:18,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 245476634, now seen corresponding path program 24 times [2025-04-13 23:04:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:18,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779671960] [2025-04-13 23:04:18,269 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:18,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:18,276 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:04:18,276 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:18,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:18,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779671960] [2025-04-13 23:04:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779671960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:18,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:18,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:04:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511166092] [2025-04-13 23:04:18,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:18,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:18,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:18,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:18,461 INFO L87 Difference]: Start difference. First operand 342 states and 835 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:18,673 INFO L93 Difference]: Finished difference Result 362 states and 869 transitions. [2025-04-13 23:04:18,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:04:18,674 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:18,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:18,675 INFO L225 Difference]: With dead ends: 362 [2025-04-13 23:04:18,675 INFO L226 Difference]: Without dead ends: 344 [2025-04-13 23:04:18,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:18,675 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:18,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:04:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-13 23:04:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338. [2025-04-13 23:04:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.4540059347181007) internal successors, (827), 337 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have 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:04:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 827 transitions. [2025-04-13 23:04:18,726 INFO L79 Accepts]: Start accepts. Automaton has 338 states and 827 transitions. Word has length 21 [2025-04-13 23:04:18,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:18,726 INFO L485 AbstractCegarLoop]: Abstraction has 338 states and 827 transitions. [2025-04-13 23:04:18,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:18,726 INFO L278 IsEmpty]: Start isEmpty. Operand 338 states and 827 transitions. [2025-04-13 23:04:18,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:18,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:18,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:18,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 23:04:18,727 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:18,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -760094644, now seen corresponding path program 25 times [2025-04-13 23:04:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:18,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762581003] [2025-04-13 23:04:18,727 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:18,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:18,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:18,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:18,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:19,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762581003] [2025-04-13 23:04:19,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762581003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:19,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217911144] [2025-04-13 23:04:19,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:19,144 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:19,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 23:04:19,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:19,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:19,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:04:19,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:19,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:19,837 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:19,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-04-13 23:04:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217911144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:20,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:20,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-04-13 23:04:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909283003] [2025-04-13 23:04:20,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:20,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:04:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:20,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:04:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:04:20,181 INFO L87 Difference]: Start difference. First operand 338 states and 827 transitions. Second operand has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:22,525 INFO L93 Difference]: Finished difference Result 458 states and 1074 transitions. [2025-04-13 23:04:22,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:04:22,525 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:22,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:22,527 INFO L225 Difference]: With dead ends: 458 [2025-04-13 23:04:22,527 INFO L226 Difference]: Without dead ends: 449 [2025-04-13 23:04:22,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=420, Invalid=3240, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 23:04:22,527 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:22,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:04:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-04-13 23:04:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 354. [2025-04-13 23:04:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.456090651558074) internal successors, (867), 353 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have 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:04:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 867 transitions. [2025-04-13 23:04:22,589 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 867 transitions. Word has length 21 [2025-04-13 23:04:22,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:22,589 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 867 transitions. [2025-04-13 23:04:22,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:22,589 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 867 transitions. [2025-04-13 23:04:22,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:22,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:22,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:22,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 23:04:22,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:22,794 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:22,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 757173900, now seen corresponding path program 26 times [2025-04-13 23:04:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:22,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366293356] [2025-04-13 23:04:22,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:22,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:22,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:22,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:22,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:23,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366293356] [2025-04-13 23:04:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366293356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:23,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584830560] [2025-04-13 23:04:23,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:23,200 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:23,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 23:04:23,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:23,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:23,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:23,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:23,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:04:23,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:23,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:23,971 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:23,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2025-04-13 23:04:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584830560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:24,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280337228] [2025-04-13 23:04:24,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:24,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:24,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:24,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1450, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:24,299 INFO L87 Difference]: Start difference. First operand 354 states and 867 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:26,109 INFO L93 Difference]: Finished difference Result 481 states and 1141 transitions. [2025-04-13 23:04:26,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 23:04:26,109 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:26,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:26,111 INFO L225 Difference]: With dead ends: 481 [2025-04-13 23:04:26,111 INFO L226 Difference]: Without dead ends: 459 [2025-04-13 23:04:26,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=504, Invalid=3786, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:04:26,112 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:26,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:04:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-04-13 23:04:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 368. [2025-04-13 23:04:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.457765667574932) internal successors, (902), 367 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have 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:04:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 902 transitions. [2025-04-13 23:04:26,179 INFO L79 Accepts]: Start accepts. Automaton has 368 states and 902 transitions. Word has length 21 [2025-04-13 23:04:26,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:26,179 INFO L485 AbstractCegarLoop]: Abstraction has 368 states and 902 transitions. [2025-04-13 23:04:26,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:26,179 INFO L278 IsEmpty]: Start isEmpty. Operand 368 states and 902 transitions. [2025-04-13 23:04:26,182 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:26,182 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:26,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:26,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 23:04:26,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:26,383 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:26,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 808837260, now seen corresponding path program 27 times [2025-04-13 23:04:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:26,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316444158] [2025-04-13 23:04:26,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:26,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:26,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:26,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:26,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:26,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316444158] [2025-04-13 23:04:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316444158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:26,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166614095] [2025-04-13 23:04:26,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:26,765 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:26,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 23:04:26,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:26,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:26,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:26,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:26,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 23:04:26,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:27,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:27,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:27,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166614095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:27,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2025-04-13 23:04:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972614531] [2025-04-13 23:04:27,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:27,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:04:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:27,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:04:27,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:04:27,784 INFO L87 Difference]: Start difference. First operand 368 states and 902 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:28,854 INFO L93 Difference]: Finished difference Result 449 states and 1069 transitions. [2025-04-13 23:04:28,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:04:28,855 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:28,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:28,856 INFO L225 Difference]: With dead ends: 449 [2025-04-13 23:04:28,856 INFO L226 Difference]: Without dead ends: 422 [2025-04-13 23:04:28,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=438, Invalid=2754, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:04:28,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:28,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:04:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-04-13 23:04:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 356. [2025-04-13 23:04:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.445070422535211) internal successors, (868), 355 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have 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:04:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 868 transitions. [2025-04-13 23:04:28,920 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 868 transitions. Word has length 21 [2025-04-13 23:04:28,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:28,920 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 868 transitions. [2025-04-13 23:04:28,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:28,920 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 868 transitions. [2025-04-13 23:04:28,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:28,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:28,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:28,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 23:04:29,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 23:04:29,121 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:29,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1616643076, now seen corresponding path program 28 times [2025-04-13 23:04:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:29,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465404231] [2025-04-13 23:04:29,121 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:29,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:29,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:29,130 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:29,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:29,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465404231] [2025-04-13 23:04:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465404231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:29,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625827987] [2025-04-13 23:04:29,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:29,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:29,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:29,601 INFO L229 MonitoredProcess]: Starting monitored process 26 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:04:29,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 23:04:29,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:29,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:29,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:04:29,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:30,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:30,270 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:30,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-04-13 23:04:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625827987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:30,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2025-04-13 23:04:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534094256] [2025-04-13 23:04:30,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:30,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 23:04:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:30,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 23:04:30,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1557, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:04:30,625 INFO L87 Difference]: Start difference. First operand 356 states and 868 transitions. Second operand has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:32,973 INFO L93 Difference]: Finished difference Result 462 states and 1088 transitions. [2025-04-13 23:04:32,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:04:32,973 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:32,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:32,975 INFO L225 Difference]: With dead ends: 462 [2025-04-13 23:04:32,975 INFO L226 Difference]: Without dead ends: 440 [2025-04-13 23:04:32,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=402, Invalid=3258, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 23:04:32,976 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:32,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:04:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-04-13 23:04:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 352. [2025-04-13 23:04:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.455840455840456) internal successors, (862), 351 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have 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:04:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 862 transitions. [2025-04-13 23:04:33,053 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 862 transitions. Word has length 21 [2025-04-13 23:04:33,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:33,053 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 862 transitions. [2025-04-13 23:04:33,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:33,054 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 862 transitions. [2025-04-13 23:04:33,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:33,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:33,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:33,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 23:04:33,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 23:04:33,255 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:33,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1844299148, now seen corresponding path program 29 times [2025-04-13 23:04:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:33,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685520296] [2025-04-13 23:04:33,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:33,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:33,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:33,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:33,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:33,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685520296] [2025-04-13 23:04:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685520296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:33,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621738005] [2025-04-13 23:04:33,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:33,721 INFO L229 MonitoredProcess]: Starting monitored process 27 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:04:33,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 23:04:33,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:33,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:33,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:33,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:04:33,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:33,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:33,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 23:04:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:34,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:34,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:34,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621738005] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:34,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:34,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:04:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451203041] [2025-04-13 23:04:34,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:34,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:04:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:04:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:04:34,825 INFO L87 Difference]: Start difference. First operand 352 states and 862 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:36,819 INFO L93 Difference]: Finished difference Result 456 states and 1072 transitions. [2025-04-13 23:04:36,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:04:36,820 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:36,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:36,821 INFO L225 Difference]: With dead ends: 456 [2025-04-13 23:04:36,821 INFO L226 Difference]: Without dead ends: 428 [2025-04-13 23:04:36,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=639, Invalid=3521, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:04:36,822 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:36,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:04:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-13 23:04:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 380. [2025-04-13 23:04:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.5013192612137205) internal successors, (948), 379 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:04:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 948 transitions. [2025-04-13 23:04:36,891 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 948 transitions. Word has length 21 [2025-04-13 23:04:36,891 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:36,891 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 948 transitions. [2025-04-13 23:04:36,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:36,891 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 948 transitions. [2025-04-13 23:04:36,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:36,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:36,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:36,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:37,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 23:04:37,092 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:37,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1895962508, now seen corresponding path program 30 times [2025-04-13 23:04:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:37,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143083430] [2025-04-13 23:04:37,093 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:37,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:37,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:37,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:37,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143083430] [2025-04-13 23:04:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143083430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:37,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904509920] [2025-04-13 23:04:37,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:37,460 INFO L229 MonitoredProcess]: Starting monitored process 28 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:04:37,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 23:04:37,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:37,549 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:37,549 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:37,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:37,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:04:37,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:37,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-13 23:04:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:37,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:38,248 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:38,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904509920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:38,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 23:04:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065464387] [2025-04-13 23:04:38,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:38,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:04:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:38,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:04:38,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:04:38,517 INFO L87 Difference]: Start difference. First operand 380 states and 948 transitions. Second operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:39,592 INFO L93 Difference]: Finished difference Result 449 states and 1056 transitions. [2025-04-13 23:04:39,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:04:39,592 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:39,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:39,594 INFO L225 Difference]: With dead ends: 449 [2025-04-13 23:04:39,594 INFO L226 Difference]: Without dead ends: 394 [2025-04-13 23:04:39,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=2697, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:04:39,594 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:39,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:04:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-04-13 23:04:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 356. [2025-04-13 23:04:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.4676056338028167) internal successors, (876), 355 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:04:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 876 transitions. [2025-04-13 23:04:39,662 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 876 transitions. Word has length 21 [2025-04-13 23:04:39,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:39,662 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 876 transitions. [2025-04-13 23:04:39,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:39,662 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 876 transitions. [2025-04-13 23:04:39,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:39,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:39,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:39,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:39,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 23:04:39,863 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:39,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1879213342, now seen corresponding path program 31 times [2025-04-13 23:04:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:39,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936819877] [2025-04-13 23:04:39,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:39,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:40,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:40,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936819877] [2025-04-13 23:04:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936819877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:40,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309028748] [2025-04-13 23:04:40,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:40,221 INFO L229 MonitoredProcess]: Starting monitored process 29 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:04:40,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 23:04:40,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:04:40,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:04:40,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:40,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:40,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:04:40,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:40,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-13 23:04:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:40,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:41,025 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:41,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:41,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309028748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:41,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:41,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2025-04-13 23:04:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707944571] [2025-04-13 23:04:41,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:41,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:04:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:41,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:04:41,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:04:41,318 INFO L87 Difference]: Start difference. First operand 356 states and 876 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:43,037 INFO L93 Difference]: Finished difference Result 458 states and 1076 transitions. [2025-04-13 23:04:43,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 23:04:43,037 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:43,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:43,038 INFO L225 Difference]: With dead ends: 458 [2025-04-13 23:04:43,038 INFO L226 Difference]: Without dead ends: 430 [2025-04-13 23:04:43,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=3424, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:04:43,039 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:43,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:04:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-04-13 23:04:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 374. [2025-04-13 23:04:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 2.474530831099196) internal successors, (923), 373 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have 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:04:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 923 transitions. [2025-04-13 23:04:43,106 INFO L79 Accepts]: Start accepts. Automaton has 374 states and 923 transitions. Word has length 21 [2025-04-13 23:04:43,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:43,106 INFO L485 AbstractCegarLoop]: Abstraction has 374 states and 923 transitions. [2025-04-13 23:04:43,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:43,106 INFO L278 IsEmpty]: Start isEmpty. Operand 374 states and 923 transitions. [2025-04-13 23:04:43,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:43,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:43,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:43,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 23:04:43,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:43,307 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:43,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1827549982, now seen corresponding path program 32 times [2025-04-13 23:04:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:43,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068292243] [2025-04-13 23:04:43,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:43,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:43,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:04:43,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:04:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:43,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068292243] [2025-04-13 23:04:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068292243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:04:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857543201] [2025-04-13 23:04:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:43,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:43,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:43,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:43,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:43,491 INFO L87 Difference]: Start difference. First operand 374 states and 923 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:43,685 INFO L93 Difference]: Finished difference Result 389 states and 948 transitions. [2025-04-13 23:04:43,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:04:43,685 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:43,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:43,686 INFO L225 Difference]: With dead ends: 389 [2025-04-13 23:04:43,687 INFO L226 Difference]: Without dead ends: 372 [2025-04-13 23:04:43,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:43,687 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:43,687 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:04:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-13 23:04:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 366. [2025-04-13 23:04:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.473972602739726) internal successors, (903), 365 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have 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:04:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 903 transitions. [2025-04-13 23:04:43,761 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 903 transitions. Word has length 21 [2025-04-13 23:04:43,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:43,761 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 903 transitions. [2025-04-13 23:04:43,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:43,761 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 903 transitions. [2025-04-13 23:04:43,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:04:43,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:43,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:43,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 23:04:43,762 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:43,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1583043848, now seen corresponding path program 33 times [2025-04-13 23:04:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:43,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326628242] [2025-04-13 23:04:43,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:43,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:04:43,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:04:43,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:04:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:43,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326628242] [2025-04-13 23:04:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326628242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:04:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024405848] [2025-04-13 23:04:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:43,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:43,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:43,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:43,943 INFO L87 Difference]: Start difference. First operand 366 states and 903 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:44,152 INFO L93 Difference]: Finished difference Result 384 states and 930 transitions. [2025-04-13 23:04:44,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:04:44,152 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:04:44,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:44,154 INFO L225 Difference]: With dead ends: 384 [2025-04-13 23:04:44,154 INFO L226 Difference]: Without dead ends: 366 [2025-04-13 23:04:44,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:44,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:44,155 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:04:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-13 23:04:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 354. [2025-04-13 23:04:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.4787535410764874) internal successors, (875), 353 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:04:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 875 transitions. [2025-04-13 23:04:44,233 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 875 transitions. Word has length 21 [2025-04-13 23:04:44,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:44,234 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 875 transitions. [2025-04-13 23:04:44,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:44,234 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 875 transitions. [2025-04-13 23:04:44,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:44,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:44,234 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:44,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 23:04:44,234 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:44,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 740846815, now seen corresponding path program 34 times [2025-04-13 23:04:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:44,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690815787] [2025-04-13 23:04:44,235 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:44,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:44,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:44,246 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:44,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:44,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:44,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690815787] [2025-04-13 23:04:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690815787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:44,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005162387] [2025-04-13 23:04:44,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:44,430 INFO L229 MonitoredProcess]: Starting monitored process 30 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:04:44,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 23:04:44,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:44,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:44,503 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:44,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:44,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 23:04:44,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:44,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:44,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:44,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-13 23:04:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005162387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:44,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2025-04-13 23:04:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174772650] [2025-04-13 23:04:44,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:44,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:04:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:44,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:04:44,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:04:44,991 INFO L87 Difference]: Start difference. First operand 354 states and 875 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:45,406 INFO L93 Difference]: Finished difference Result 397 states and 954 transitions. [2025-04-13 23:04:45,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:45,406 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:45,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:45,408 INFO L225 Difference]: With dead ends: 397 [2025-04-13 23:04:45,408 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 23:04:45,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:04:45,408 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:45,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 23:04:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2025-04-13 23:04:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.4788732394366195) internal successors, (880), 355 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:04:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 880 transitions. [2025-04-13 23:04:45,477 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 880 transitions. Word has length 22 [2025-04-13 23:04:45,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:45,477 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 880 transitions. [2025-04-13 23:04:45,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:45,477 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 880 transitions. [2025-04-13 23:04:45,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:45,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:45,477 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:45,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 23:04:45,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:45,678 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:45,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2036851937, now seen corresponding path program 35 times [2025-04-13 23:04:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:45,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192662235] [2025-04-13 23:04:45,678 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:45,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:45,690 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:45,690 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:04:45,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:46,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192662235] [2025-04-13 23:04:46,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192662235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:46,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854735915] [2025-04-13 23:04:46,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:46,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:46,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:46,184 INFO L229 MonitoredProcess]: Starting monitored process 31 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:04:46,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 23:04:46,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:46,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:46,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:04:46,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:46,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:04:46,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:46,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:46,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:46,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-04-13 23:04:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854735915] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:46,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:46,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 33 [2025-04-13 23:04:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718729335] [2025-04-13 23:04:46,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:46,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:46,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:46,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:46,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:46,904 INFO L87 Difference]: Start difference. First operand 356 states and 880 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:47,459 INFO L93 Difference]: Finished difference Result 415 states and 1004 transitions. [2025-04-13 23:04:47,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:04:47,459 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:47,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:47,461 INFO L225 Difference]: With dead ends: 415 [2025-04-13 23:04:47,461 INFO L226 Difference]: Without dead ends: 404 [2025-04-13 23:04:47,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:04:47,461 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:47,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:04:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-13 23:04:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 368. [2025-04-13 23:04:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.463215258855586) internal successors, (904), 367 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have 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:04:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 904 transitions. [2025-04-13 23:04:47,530 INFO L79 Accepts]: Start accepts. Automaton has 368 states and 904 transitions. Word has length 22 [2025-04-13 23:04:47,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:47,531 INFO L485 AbstractCegarLoop]: Abstraction has 368 states and 904 transitions. [2025-04-13 23:04:47,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:47,531 INFO L278 IsEmpty]: Start isEmpty. Operand 368 states and 904 transitions. [2025-04-13 23:04:47,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:47,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:47,531 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:47,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 23:04:47,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 23:04:47,732 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:47,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1985188577, now seen corresponding path program 36 times [2025-04-13 23:04:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:47,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978946546] [2025-04-13 23:04:47,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:47,736 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:47,741 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:47,742 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:04:47,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:47,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:47,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978946546] [2025-04-13 23:04:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978946546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:47,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631381773] [2025-04-13 23:04:47,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:47,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:47,930 INFO L229 MonitoredProcess]: Starting monitored process 32 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:04:47,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 23:04:47,976 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:48,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:48,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:04:48,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:48,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 23:04:48,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:48,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:48,373 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:48,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:04:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631381773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:48,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2025-04-13 23:04:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004600483] [2025-04-13 23:04:48,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:48,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:04:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:48,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:04:48,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:04:48,469 INFO L87 Difference]: Start difference. First operand 368 states and 904 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:04:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:48,768 INFO L93 Difference]: Finished difference Result 399 states and 970 transitions. [2025-04-13 23:04:48,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:48,768 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:48,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:48,769 INFO L225 Difference]: With dead ends: 399 [2025-04-13 23:04:48,769 INFO L226 Difference]: Without dead ends: 386 [2025-04-13 23:04:48,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:04:48,770 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:48,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:04:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-13 23:04:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2025-04-13 23:04:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.4677871148459385) internal successors, (881), 357 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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:04:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 881 transitions. [2025-04-13 23:04:48,840 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 881 transitions. Word has length 22 [2025-04-13 23:04:48,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:48,840 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 881 transitions. [2025-04-13 23:04:48,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:04:48,840 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 881 transitions. [2025-04-13 23:04:48,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:48,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:48,840 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:48,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 23:04:49,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:49,041 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:49,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1177382761, now seen corresponding path program 37 times [2025-04-13 23:04:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:49,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441577113] [2025-04-13 23:04:49,041 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:49,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:04:49,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:49,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441577113] [2025-04-13 23:04:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441577113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:49,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385833008] [2025-04-13 23:04:49,602 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:49,604 INFO L229 MonitoredProcess]: Starting monitored process 33 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:04:49,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 23:04:49,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:04:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:49,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:49,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:04:49,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:49,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:50,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:50,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-13 23:04:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385833008] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:04:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 11] total 35 [2025-04-13 23:04:50,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417104699] [2025-04-13 23:04:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:50,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:50,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:04:50,291 INFO L87 Difference]: Start difference. First operand 358 states and 881 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:50,762 INFO L93 Difference]: Finished difference Result 410 states and 980 transitions. [2025-04-13 23:04:50,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:04:50,762 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:50,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:50,764 INFO L225 Difference]: With dead ends: 410 [2025-04-13 23:04:50,764 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 23:04:50,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:04:50,764 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:50,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 23:04:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 324. [2025-04-13 23:04:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.4922600619195046) internal successors, (805), 323 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have 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:04:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 805 transitions. [2025-04-13 23:04:50,829 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 805 transitions. Word has length 22 [2025-04-13 23:04:50,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:50,829 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 805 transitions. [2025-04-13 23:04:50,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:50,829 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 805 transitions. [2025-04-13 23:04:50,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:50,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:50,830 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:50,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:51,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:51,030 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:51,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash 177964127, now seen corresponding path program 38 times [2025-04-13 23:04:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:51,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706926353] [2025-04-13 23:04:51,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:51,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:51,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:51,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:51,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:51,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706926353] [2025-04-13 23:04:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706926353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:51,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968918351] [2025-04-13 23:04:51,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:51,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:51,211 INFO L229 MonitoredProcess]: Starting monitored process 34 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:04:51,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 23:04:51,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:51,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:51,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:51,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:51,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:04:51,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:51,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:51,770 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:51,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-04-13 23:04:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:51,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968918351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:51,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:51,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 25 [2025-04-13 23:04:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760874720] [2025-04-13 23:04:51,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:51,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:04:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:51,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:04:51,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:51,831 INFO L87 Difference]: Start difference. First operand 324 states and 805 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:04:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:52,225 INFO L93 Difference]: Finished difference Result 359 states and 868 transitions. [2025-04-13 23:04:52,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:04:52,225 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 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:04:52,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:52,226 INFO L225 Difference]: With dead ends: 359 [2025-04-13 23:04:52,226 INFO L226 Difference]: Without dead ends: 348 [2025-04-13 23:04:52,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:52,227 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:52,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-04-13 23:04:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 332. [2025-04-13 23:04:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.4682779456193353) internal successors, (817), 331 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:04:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 817 transitions. [2025-04-13 23:04:52,294 INFO L79 Accepts]: Start accepts. Automaton has 332 states and 817 transitions. Word has length 22 [2025-04-13 23:04:52,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:52,294 INFO L485 AbstractCegarLoop]: Abstraction has 332 states and 817 transitions. [2025-04-13 23:04:52,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:04:52,294 INFO L278 IsEmpty]: Start isEmpty. Operand 332 states and 817 transitions. [2025-04-13 23:04:52,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:52,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:52,294 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:52,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 23:04:52,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 23:04:52,495 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:52,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 229627487, now seen corresponding path program 39 times [2025-04-13 23:04:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:52,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015178763] [2025-04-13 23:04:52,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:52,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:52,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 23:04:52,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:52,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015178763] [2025-04-13 23:04:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015178763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:52,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138812572] [2025-04-13 23:04:52,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:52,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:52,675 INFO L229 MonitoredProcess]: Starting monitored process 35 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:04:52,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 23:04:52,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:52,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 23:04:52,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:52,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:52,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 23:04:52,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:52,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:53,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:53,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-04-13 23:04:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138812572] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:53,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2025-04-13 23:04:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528913219] [2025-04-13 23:04:53,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:53,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:04:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:53,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:04:53,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:04:53,251 INFO L87 Difference]: Start difference. First operand 332 states and 817 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:04:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:53,610 INFO L93 Difference]: Finished difference Result 349 states and 847 transitions. [2025-04-13 23:04:53,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:04:53,611 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:53,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:53,612 INFO L225 Difference]: With dead ends: 349 [2025-04-13 23:04:53,612 INFO L226 Difference]: Without dead ends: 332 [2025-04-13 23:04:53,612 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:04:53,613 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:53,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-13 23:04:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 318. [2025-04-13 23:04:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.4858044164037856) internal successors, (788), 317 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have 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:04:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 788 transitions. [2025-04-13 23:04:53,680 INFO L79 Accepts]: Start accepts. Automaton has 318 states and 788 transitions. Word has length 22 [2025-04-13 23:04:53,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:53,680 INFO L485 AbstractCegarLoop]: Abstraction has 318 states and 788 transitions. [2025-04-13 23:04:53,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:04:53,680 INFO L278 IsEmpty]: Start isEmpty. Operand 318 states and 788 transitions. [2025-04-13 23:04:53,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:53,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:53,680 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:53,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 23:04:53,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 23:04:53,881 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:53,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1218199925, now seen corresponding path program 40 times [2025-04-13 23:04:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:53,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517383162] [2025-04-13 23:04:53,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:53,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:53,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:53,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:54,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517383162] [2025-04-13 23:04:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517383162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:54,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79760459] [2025-04-13 23:04:54,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:54,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:54,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:54,057 INFO L229 MonitoredProcess]: Starting monitored process 36 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:04:54,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 23:04:54,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:04:54,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:54,133 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:54,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:54,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 23:04:54,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:54,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:54,601 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:54,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79760459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:54,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 27 [2025-04-13 23:04:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966480387] [2025-04-13 23:04:54,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:54,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:04:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:54,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:04:54,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:04:54,684 INFO L87 Difference]: Start difference. First operand 318 states and 788 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:55,075 INFO L93 Difference]: Finished difference Result 353 states and 853 transitions. [2025-04-13 23:04:55,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:55,075 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:55,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:55,077 INFO L225 Difference]: With dead ends: 353 [2025-04-13 23:04:55,077 INFO L226 Difference]: Without dead ends: 336 [2025-04-13 23:04:55,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:04:55,077 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:55,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-04-13 23:04:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 320. [2025-04-13 23:04:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.4733542319749215) internal successors, (789), 319 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have 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:04:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 789 transitions. [2025-04-13 23:04:55,140 INFO L79 Accepts]: Start accepts. Automaton has 320 states and 789 transitions. Word has length 22 [2025-04-13 23:04:55,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:55,141 INFO L485 AbstractCegarLoop]: Abstraction has 320 states and 789 transitions. [2025-04-13 23:04:55,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:55,141 INFO L278 IsEmpty]: Start isEmpty. Operand 320 states and 789 transitions. [2025-04-13 23:04:55,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:55,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:55,141 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:55,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:55,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 23:04:55,342 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:55,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash -422315997, now seen corresponding path program 41 times [2025-04-13 23:04:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:55,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133493642] [2025-04-13 23:04:55,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:55,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:55,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:55,354 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:04:55,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:56,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133493642] [2025-04-13 23:04:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133493642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:56,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342283431] [2025-04-13 23:04:56,111 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:56,112 INFO L229 MonitoredProcess]: Starting monitored process 37 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:04:56,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 23:04:56,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:56,175 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:56,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:04:56,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:56,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 23:04:56,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:56,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:56,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:56,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342283431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:56,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 33 [2025-04-13 23:04:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894605117] [2025-04-13 23:04:56,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:56,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:56,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:56,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:56,868 INFO L87 Difference]: Start difference. First operand 320 states and 789 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:57,473 INFO L93 Difference]: Finished difference Result 359 states and 866 transitions. [2025-04-13 23:04:57,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:04:57,473 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:57,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:57,475 INFO L225 Difference]: With dead ends: 359 [2025-04-13 23:04:57,475 INFO L226 Difference]: Without dead ends: 344 [2025-04-13 23:04:57,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:04:57,475 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:57,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-13 23:04:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2025-04-13 23:04:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.498381877022654) internal successors, (772), 309 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have 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:04:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 772 transitions. [2025-04-13 23:04:57,543 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 772 transitions. Word has length 22 [2025-04-13 23:04:57,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:57,543 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 772 transitions. [2025-04-13 23:04:57,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:57,543 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 772 transitions. [2025-04-13 23:04:57,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:57,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:57,544 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:57,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 23:04:57,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:57,744 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:57,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 63876221, now seen corresponding path program 42 times [2025-04-13 23:04:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:57,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925476758] [2025-04-13 23:04:57,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:57,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:04:57,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 22 statements. [2025-04-13 23:04:57,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:04:57,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:57,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925476758] [2025-04-13 23:04:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925476758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:04:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642212682] [2025-04-13 23:04:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:57,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:04:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:57,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:04:57,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:57,912 INFO L87 Difference]: Start difference. First operand 310 states and 772 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:58,121 INFO L93 Difference]: Finished difference Result 333 states and 812 transitions. [2025-04-13 23:04:58,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:04:58,121 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:58,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:58,122 INFO L225 Difference]: With dead ends: 333 [2025-04-13 23:04:58,122 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 23:04:58,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:04:58,123 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:58,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:04:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 23:04:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2025-04-13 23:04:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.49185667752443) internal successors, (765), 307 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have 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:04:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 765 transitions. [2025-04-13 23:04:58,186 INFO L79 Accepts]: Start accepts. Automaton has 308 states and 765 transitions. Word has length 22 [2025-04-13 23:04:58,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:58,186 INFO L485 AbstractCegarLoop]: Abstraction has 308 states and 765 transitions. [2025-04-13 23:04:58,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:58,186 INFO L278 IsEmpty]: Start isEmpty. Operand 308 states and 765 transitions. [2025-04-13 23:04:58,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:04:58,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:58,186 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:58,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 23:04:58,186 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:04:58,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1739200157, now seen corresponding path program 43 times [2025-04-13 23:04:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:58,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412855639] [2025-04-13 23:04:58,187 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:58,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:04:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:58,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:58,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:58,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412855639] [2025-04-13 23:04:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412855639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:58,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286156914] [2025-04-13 23:04:58,575 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:58,577 INFO L229 MonitoredProcess]: Starting monitored process 38 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:04:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 23:04:58,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:04:58,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:04:58,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:58,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:58,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:04:58,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:58,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:59,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:59,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-04-13 23:04:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:04:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286156914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:59,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 34 [2025-04-13 23:04:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311359344] [2025-04-13 23:04:59,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:59,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:04:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:59,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:04:59,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:04:59,256 INFO L87 Difference]: Start difference. First operand 308 states and 765 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:59,935 INFO L93 Difference]: Finished difference Result 413 states and 981 transitions. [2025-04-13 23:04:59,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:04:59,935 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:04:59,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:59,937 INFO L225 Difference]: With dead ends: 413 [2025-04-13 23:04:59,937 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 23:04:59,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 23:04:59,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:59,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 23:05:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 314. [2025-04-13 23:05:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.472843450479233) internal successors, (774), 313 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have 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:05:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 774 transitions. [2025-04-13 23:05:00,002 INFO L79 Accepts]: Start accepts. Automaton has 314 states and 774 transitions. Word has length 22 [2025-04-13 23:05:00,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:00,002 INFO L485 AbstractCegarLoop]: Abstraction has 314 states and 774 transitions. [2025-04-13 23:05:00,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:00,002 INFO L278 IsEmpty]: Start isEmpty. Operand 314 states and 774 transitions. [2025-04-13 23:05:00,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:05:00,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:00,002 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:00,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 23:05:00,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:00,203 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:00,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1687536797, now seen corresponding path program 44 times [2025-04-13 23:05:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:00,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466795546] [2025-04-13 23:05:00,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:00,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:05:00,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:05:00,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:00,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:00,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466795546] [2025-04-13 23:05:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466795546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:00,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001117817] [2025-04-13 23:05:00,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:00,418 INFO L229 MonitoredProcess]: Starting monitored process 39 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:05:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 23:05:00,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:05:00,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:05:00,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:00,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:00,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:05:00,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:00,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:00,925 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:00,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2025-04-13 23:05:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001117817] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:01,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2025-04-13 23:05:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349096592] [2025-04-13 23:05:01,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:01,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:05:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:01,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:05:01,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:05:01,040 INFO L87 Difference]: Start difference. First operand 314 states and 774 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:05:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:01,393 INFO L93 Difference]: Finished difference Result 333 states and 810 transitions. [2025-04-13 23:05:01,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:05:01,394 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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:05:01,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:01,395 INFO L225 Difference]: With dead ends: 333 [2025-04-13 23:05:01,395 INFO L226 Difference]: Without dead ends: 320 [2025-04-13 23:05:01,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:05:01,395 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:01,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:05:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-04-13 23:05:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 308. [2025-04-13 23:05:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.478827361563518) internal successors, (761), 307 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have 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:05:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 761 transitions. [2025-04-13 23:05:01,465 INFO L79 Accepts]: Start accepts. Automaton has 308 states and 761 transitions. Word has length 22 [2025-04-13 23:05:01,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:01,465 INFO L485 AbstractCegarLoop]: Abstraction has 308 states and 761 transitions. [2025-04-13 23:05:01,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:05:01,465 INFO L278 IsEmpty]: Start isEmpty. Operand 308 states and 761 transitions. [2025-04-13 23:05:01,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:05:01,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:01,466 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:01,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 23:05:01,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-13 23:05:01,666 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:01,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1723057033, now seen corresponding path program 45 times [2025-04-13 23:05:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:01,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135767804] [2025-04-13 23:05:01,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:01,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 23:05:01,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 22 statements. [2025-04-13 23:05:01,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:05:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:01,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135767804] [2025-04-13 23:05:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135767804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:05:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204564846] [2025-04-13 23:05:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:01,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:05:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:05:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:01,839 INFO L87 Difference]: Start difference. First operand 308 states and 761 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:02,083 INFO L93 Difference]: Finished difference Result 340 states and 819 transitions. [2025-04-13 23:05:02,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:05:02,083 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:05:02,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:02,085 INFO L225 Difference]: With dead ends: 340 [2025-04-13 23:05:02,085 INFO L226 Difference]: Without dead ends: 322 [2025-04-13 23:05:02,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:02,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:02,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:05:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-13 23:05:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 299. [2025-04-13 23:05:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 2.5) internal successors, (745), 298 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have 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:05:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 745 transitions. [2025-04-13 23:05:02,147 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 745 transitions. Word has length 22 [2025-04-13 23:05:02,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:02,148 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 745 transitions. [2025-04-13 23:05:02,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:02,148 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 745 transitions. [2025-04-13 23:05:02,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:05:02,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:02,148 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:02,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 23:05:02,148 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:02,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1401443435, now seen corresponding path program 46 times [2025-04-13 23:05:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:02,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857990408] [2025-04-13 23:05:02,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:02,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:05:02,156 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:05:02,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:02,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:02,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857990408] [2025-04-13 23:05:02,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857990408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:05:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632798127] [2025-04-13 23:05:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:02,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:05:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:02,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:05:02,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:02,314 INFO L87 Difference]: Start difference. First operand 299 states and 745 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:02,510 INFO L93 Difference]: Finished difference Result 314 states and 771 transitions. [2025-04-13 23:05:02,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:05:02,510 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:05:02,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:02,512 INFO L225 Difference]: With dead ends: 314 [2025-04-13 23:05:02,512 INFO L226 Difference]: Without dead ends: 295 [2025-04-13 23:05:02,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:05:02,512 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:02,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:05:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-04-13 23:05:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 285. [2025-04-13 23:05:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.5140845070422535) internal successors, (714), 284 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:05:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 714 transitions. [2025-04-13 23:05:02,577 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 714 transitions. Word has length 22 [2025-04-13 23:05:02,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:02,577 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 714 transitions. [2025-04-13 23:05:02,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:02,577 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 714 transitions. [2025-04-13 23:05:02,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:05:02,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:02,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:02,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 23:05:02,578 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:02,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1489729690, now seen corresponding path program 1 times [2025-04-13 23:05:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:02,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422639715] [2025-04-13 23:05:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:05:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:02,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:05:02,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:05:02,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:02,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:05:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:02,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422639715] [2025-04-13 23:05:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422639715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:02,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515513785] [2025-04-13 23:05:02,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:05:02,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:02,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:02,675 INFO L229 MonitoredProcess]: Starting monitored process 40 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:05:02,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 23:05:02,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:05:02,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:05:02,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:02,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:02,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:05:02,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:05:02,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:05:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515513785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:02,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 23:05:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138085424] [2025-04-13 23:05:02,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:02,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:05:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:05:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:05:02,905 INFO L87 Difference]: Start difference. First operand 285 states and 714 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:05:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:03,108 INFO L93 Difference]: Finished difference Result 545 states and 1336 transitions. [2025-04-13 23:05:03,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:05:03,108 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:05:03,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:03,109 INFO L225 Difference]: With dead ends: 545 [2025-04-13 23:05:03,109 INFO L226 Difference]: Without dead ends: 261 [2025-04-13 23:05:03,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:05:03,110 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:03,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:05:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-04-13 23:05:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 203. [2025-04-13 23:05:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.3465346534653464) internal successors, (474), 202 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have 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:05:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 474 transitions. [2025-04-13 23:05:03,156 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 474 transitions. Word has length 23 [2025-04-13 23:05:03,156 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:03,157 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 474 transitions. [2025-04-13 23:05:03,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:05:03,157 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 474 transitions. [2025-04-13 23:05:03,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:05:03,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:03,157 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:03,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:03,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 23:05:03,357 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:03,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1807009848, now seen corresponding path program 47 times [2025-04-13 23:05:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:03,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026520376] [2025-04-13 23:05:03,358 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:03,362 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-04-13 23:05:03,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:05:03,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:05:03,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:03,406 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:05:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:03,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026520376] [2025-04-13 23:05:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026520376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:03,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486412463] [2025-04-13 23:05:03,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:03,408 INFO L229 MonitoredProcess]: Starting monitored process 41 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:05:03,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 23:05:03,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-04-13 23:05:03,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:05:03,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:05:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:03,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:05:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:03,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:05:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486412463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:05:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-04-13 23:05:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342625934] [2025-04-13 23:05:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:03,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:05:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:03,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:05:03,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:03,506 INFO L87 Difference]: Start difference. First operand 203 states and 474 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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:05:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:03,633 INFO L93 Difference]: Finished difference Result 388 states and 918 transitions. [2025-04-13 23:05:03,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:05:03,634 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 23 [2025-04-13 23:05:03,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:03,635 INFO L225 Difference]: With dead ends: 388 [2025-04-13 23:05:03,635 INFO L226 Difference]: Without dead ends: 294 [2025-04-13 23:05:03,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:03,635 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:03,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:05:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-13 23:05:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 210. [2025-04-13 23:05:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.4976076555023923) internal successors, (522), 209 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have 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:05:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 522 transitions. [2025-04-13 23:05:03,669 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 522 transitions. Word has length 23 [2025-04-13 23:05:03,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:03,669 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 522 transitions. [2025-04-13 23:05:03,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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:05:03,669 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 522 transitions. [2025-04-13 23:05:03,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:05:03,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:03,670 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 23:05:03,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 23:05:03,870 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:03,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1528277229, now seen corresponding path program 2 times [2025-04-13 23:05:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:03,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285986074] [2025-04-13 23:05:03,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:03,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:05:03,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:05:03,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:03,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:04,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:04,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285986074] [2025-04-13 23:05:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285986074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:04,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19535051] [2025-04-13 23:05:04,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:04,097 INFO L229 MonitoredProcess]: Starting monitored process 42 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:05:04,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 23:05:04,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:05:04,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:05:04,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:04,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:04,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:05:04,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:04,382 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:05:04,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-04-13 23:05:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:04,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:04,506 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:05:04,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2025-04-13 23:05:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19535051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:04,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-04-13 23:05:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817447495] [2025-04-13 23:05:04,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:04,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:05:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:04,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:05:04,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:05:04,748 INFO L87 Difference]: Start difference. First operand 210 states and 522 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:05:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:06,582 INFO L93 Difference]: Finished difference Result 913 states and 2400 transitions. [2025-04-13 23:05:06,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 23:05:06,582 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 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:05:06,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:06,585 INFO L225 Difference]: With dead ends: 913 [2025-04-13 23:05:06,585 INFO L226 Difference]: Without dead ends: 859 [2025-04-13 23:05:06,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=871, Invalid=3289, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:05:06,585 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:06,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:05:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-04-13 23:05:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 462. [2025-04-13 23:05:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.6247288503253796) internal successors, (1210), 461 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have 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:05:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1210 transitions. [2025-04-13 23:05:06,651 INFO L79 Accepts]: Start accepts. Automaton has 462 states and 1210 transitions. Word has length 24 [2025-04-13 23:05:06,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:06,651 INFO L485 AbstractCegarLoop]: Abstraction has 462 states and 1210 transitions. [2025-04-13 23:05:06,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:05:06,651 INFO L278 IsEmpty]: Start isEmpty. Operand 462 states and 1210 transitions. [2025-04-13 23:05:06,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:05:06,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:06,652 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:06,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 23:05:06,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 23:05:06,852 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:06,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -254884419, now seen corresponding path program 3 times [2025-04-13 23:05:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:06,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535831426] [2025-04-13 23:05:06,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:06,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-04-13 23:05:06,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 24 statements. [2025-04-13 23:05:06,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:06,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535831426] [2025-04-13 23:05:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535831426] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:06,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035018849] [2025-04-13 23:05:06,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:06,936 INFO L229 MonitoredProcess]: Starting monitored process 43 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:05:06,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 23:05:06,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-04-13 23:05:07,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 24 statements. [2025-04-13 23:05:07,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:05:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:07,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 23:05:07,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:07,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:07,050 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:05:07,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2025-04-13 23:05:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035018849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:07,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-04-13 23:05:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009864829] [2025-04-13 23:05:07,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:07,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:05:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:07,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:05:07,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:05:07,062 INFO L87 Difference]: Start difference. First operand 462 states and 1210 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 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:05:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:07,473 INFO L93 Difference]: Finished difference Result 1062 states and 2887 transitions. [2025-04-13 23:05:07,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:05:07,474 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 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 24 [2025-04-13 23:05:07,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:07,476 INFO L225 Difference]: With dead ends: 1062 [2025-04-13 23:05:07,476 INFO L226 Difference]: Without dead ends: 1047 [2025-04-13 23:05:07,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:05:07,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:07,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:05:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-04-13 23:05:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 558. [2025-04-13 23:05:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.673249551166966) internal successors, (1489), 557 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have 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:05:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1489 transitions. [2025-04-13 23:05:07,555 INFO L79 Accepts]: Start accepts. Automaton has 558 states and 1489 transitions. Word has length 24 [2025-04-13 23:05:07,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:07,555 INFO L485 AbstractCegarLoop]: Abstraction has 558 states and 1489 transitions. [2025-04-13 23:05:07,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 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:05:07,555 INFO L278 IsEmpty]: Start isEmpty. Operand 558 states and 1489 transitions. [2025-04-13 23:05:07,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:05:07,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:07,556 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:07,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 23:05:07,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:07,756 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:07,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 203265653, now seen corresponding path program 4 times [2025-04-13 23:05:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:07,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988882332] [2025-04-13 23:05:07,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:07,761 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:05:07,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:07,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:07,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:08,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988882332] [2025-04-13 23:05:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988882332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:08,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641599217] [2025-04-13 23:05:08,361 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:08,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:08,363 INFO L229 MonitoredProcess]: Starting monitored process 44 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:05:08,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 23:05:08,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:05:08,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:08,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:08,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:05:08,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:09,068 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:05:09,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:05:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:09,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:09,850 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:05:09,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 60 [2025-04-13 23:05:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641599217] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:10,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:05:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853664379] [2025-04-13 23:05:10,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:10,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:05:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:10,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:05:10,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2942, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:05:10,285 INFO L87 Difference]: Start difference. First operand 558 states and 1489 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:05:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:25,016 INFO L93 Difference]: Finished difference Result 2029 states and 5117 transitions. [2025-04-13 23:05:25,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 23:05:25,016 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:05:25,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:25,020 INFO L225 Difference]: With dead ends: 2029 [2025-04-13 23:05:25,020 INFO L226 Difference]: Without dead ends: 1984 [2025-04-13 23:05:25,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4802 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2333, Invalid=14179, Unknown=0, NotChecked=0, Total=16512 [2025-04-13 23:05:25,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 493 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4309 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 4309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:25,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 0 Invalid, 4802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 4309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 23:05:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-04-13 23:05:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 582. [2025-04-13 23:05:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.63855421686747) internal successors, (1533), 581 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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:05:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1533 transitions. [2025-04-13 23:05:25,150 INFO L79 Accepts]: Start accepts. Automaton has 582 states and 1533 transitions. Word has length 26 [2025-04-13 23:05:25,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:25,150 INFO L485 AbstractCegarLoop]: Abstraction has 582 states and 1533 transitions. [2025-04-13 23:05:25,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:05:25,150 INFO L278 IsEmpty]: Start isEmpty. Operand 582 states and 1533 transitions. [2025-04-13 23:05:25,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:05:25,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:25,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:25,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 23:05:25,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-04-13 23:05:25,352 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:25,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash -326712597, now seen corresponding path program 5 times [2025-04-13 23:05:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:25,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844245121] [2025-04-13 23:05:25,352 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:25,356 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:05:25,362 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:25,362 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:05:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:26,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:26,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844245121] [2025-04-13 23:05:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844245121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:26,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683206723] [2025-04-13 23:05:26,175 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:26,177 INFO L229 MonitoredProcess]: Starting monitored process 45 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:05:26,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 23:05:26,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:05:26,274 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:26,274 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:05:26,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:26,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 23:05:26,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:26,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:27,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:27,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 63 [2025-04-13 23:05:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683206723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:27,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 44 [2025-04-13 23:05:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529762152] [2025-04-13 23:05:27,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:27,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 23:05:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:27,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 23:05:27,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1943, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:05:27,605 INFO L87 Difference]: Start difference. First operand 582 states and 1533 transitions. Second operand has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 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:05:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:31,468 INFO L93 Difference]: Finished difference Result 893 states and 2276 transitions. [2025-04-13 23:05:31,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:05:31,469 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 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 26 [2025-04-13 23:05:31,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:31,471 INFO L225 Difference]: With dead ends: 893 [2025-04-13 23:05:31,471 INFO L226 Difference]: Without dead ends: 888 [2025-04-13 23:05:31,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=326, Invalid=5076, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:05:31,472 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3972 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:31,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 4041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3972 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 23:05:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-04-13 23:05:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 590. [2025-04-13 23:05:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 2.634974533106961) internal successors, (1552), 589 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have 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:05:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1552 transitions. [2025-04-13 23:05:31,618 INFO L79 Accepts]: Start accepts. Automaton has 590 states and 1552 transitions. Word has length 26 [2025-04-13 23:05:31,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:31,619 INFO L485 AbstractCegarLoop]: Abstraction has 590 states and 1552 transitions. [2025-04-13 23:05:31,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 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:05:31,619 INFO L278 IsEmpty]: Start isEmpty. Operand 590 states and 1552 transitions. [2025-04-13 23:05:31,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:05:31,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:31,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:31,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:31,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:31,820 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:31,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1774444843, now seen corresponding path program 6 times [2025-04-13 23:05:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:31,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346440421] [2025-04-13 23:05:31,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:31,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:05:31,832 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:31,832 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:05:31,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:32,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346440421] [2025-04-13 23:05:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346440421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:32,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330080017] [2025-04-13 23:05:32,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:32,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:32,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:32,449 INFO L229 MonitoredProcess]: Starting monitored process 46 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:05:32,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 23:05:32,513 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:05:32,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:32,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:05:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:32,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 23:05:32,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:33,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:33,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:33,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 63 [2025-04-13 23:05:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:05:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330080017] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:34,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 47 [2025-04-13 23:05:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130059287] [2025-04-13 23:05:34,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:34,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 23:05:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:34,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 23:05:34,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2218, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 23:05:34,001 INFO L87 Difference]: Start difference. First operand 590 states and 1552 transitions. Second operand has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:36,441 INFO L93 Difference]: Finished difference Result 712 states and 1808 transitions. [2025-04-13 23:05:36,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:05:36,442 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:05:36,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:36,443 INFO L225 Difference]: With dead ends: 712 [2025-04-13 23:05:36,443 INFO L226 Difference]: Without dead ends: 683 [2025-04-13 23:05:36,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=315, Invalid=5087, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:05:36,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:36,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:05:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-04-13 23:05:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 602. [2025-04-13 23:05:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 2.6289517470881862) internal successors, (1580), 601 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have 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:05:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1580 transitions. [2025-04-13 23:05:36,589 INFO L79 Accepts]: Start accepts. Automaton has 602 states and 1580 transitions. Word has length 26 [2025-04-13 23:05:36,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:36,589 INFO L485 AbstractCegarLoop]: Abstraction has 602 states and 1580 transitions. [2025-04-13 23:05:36,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:36,589 INFO L278 IsEmpty]: Start isEmpty. Operand 602 states and 1580 transitions. [2025-04-13 23:05:36,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:05:36,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:36,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:36,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 23:05:36,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-04-13 23:05:36,791 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:36,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1003253909, now seen corresponding path program 7 times [2025-04-13 23:05:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:36,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648993277] [2025-04-13 23:05:36,791 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:05:36,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:36,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:36,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:37,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648993277] [2025-04-13 23:05:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648993277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:37,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886644933] [2025-04-13 23:05:37,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:37,559 INFO L229 MonitoredProcess]: Starting monitored process 47 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:05:37,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 23:05:37,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:05:37,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:37,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:37,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:05:37,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:38,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:38,898 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:38,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 68 [2025-04-13 23:05:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886644933] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:39,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 54 [2025-04-13 23:05:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704396047] [2025-04-13 23:05:39,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:39,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:05:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:39,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:05:39,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2813, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:05:39,310 INFO L87 Difference]: Start difference. First operand 602 states and 1580 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:05:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:47,920 INFO L93 Difference]: Finished difference Result 1411 states and 3618 transitions. [2025-04-13 23:05:47,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:05:47,921 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:05:47,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:47,923 INFO L225 Difference]: With dead ends: 1411 [2025-04-13 23:05:47,923 INFO L226 Difference]: Without dead ends: 1393 [2025-04-13 23:05:47,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1228, Invalid=10544, Unknown=0, NotChecked=0, Total=11772 [2025-04-13 23:05:47,924 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:47,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:05:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-04-13 23:05:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 640. [2025-04-13 23:05:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 2.61189358372457) internal successors, (1669), 639 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have 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:05:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1669 transitions. [2025-04-13 23:05:48,113 INFO L79 Accepts]: Start accepts. Automaton has 640 states and 1669 transitions. Word has length 26 [2025-04-13 23:05:48,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:48,113 INFO L485 AbstractCegarLoop]: Abstraction has 640 states and 1669 transitions. [2025-04-13 23:05:48,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:05:48,113 INFO L278 IsEmpty]: Start isEmpty. Operand 640 states and 1669 transitions. [2025-04-13 23:05:48,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:05:48,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:48,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:48,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 23:05:48,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:48,314 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:05:48,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -951590549, now seen corresponding path program 8 times [2025-04-13 23:05:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:48,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591559844] [2025-04-13 23:05:48,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:48,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:05:48,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:48,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:48,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:48,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591559844] [2025-04-13 23:05:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591559844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:48,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460918511] [2025-04-13 23:05:48,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:48,962 INFO L229 MonitoredProcess]: Starting monitored process 48 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:05:48,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 23:05:49,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:05:49,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:05:49,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:49,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:49,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 23:05:49,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:49,703 INFO L325 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2025-04-13 23:05:49,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2025-04-13 23:05:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:49,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:50,742 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:05:50,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 71 [2025-04-13 23:05:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460918511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:51,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 55 [2025-04-13 23:05:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14409409] [2025-04-13 23:05:51,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:51,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:05:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:51,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:05:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2861, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:05:51,330 INFO L87 Difference]: Start difference. First operand 640 states and 1669 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:07,980 INFO L93 Difference]: Finished difference Result 1049 states and 2594 transitions. [2025-04-13 23:06:07,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 23:06:07,980 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:06:07,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:07,982 INFO L225 Difference]: With dead ends: 1049 [2025-04-13 23:06:07,982 INFO L226 Difference]: Without dead ends: 1020 [2025-04-13 23:06:07,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6056 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2804, Invalid=19846, Unknown=0, NotChecked=0, Total=22650 [2025-04-13 23:06:07,983 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 434 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:07,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 0 Invalid, 4438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 23:06:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-04-13 23:06:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 682. [2025-04-13 23:06:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.606461086637298) internal successors, (1775), 681 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have 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:06:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1775 transitions. [2025-04-13 23:06:08,211 INFO L79 Accepts]: Start accepts. Automaton has 682 states and 1775 transitions. Word has length 26 [2025-04-13 23:06:08,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:08,211 INFO L485 AbstractCegarLoop]: Abstraction has 682 states and 1775 transitions. [2025-04-13 23:06:08,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:08,211 INFO L278 IsEmpty]: Start isEmpty. Operand 682 states and 1775 transitions. [2025-04-13 23:06:08,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:06:08,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:08,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:08,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 23:06:08,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:08,413 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:06:08,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -143784733, now seen corresponding path program 9 times [2025-04-13 23:06:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:08,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347559461] [2025-04-13 23:06:08,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:08,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:08,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:06:08,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:08,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:06:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:08,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347559461] [2025-04-13 23:06:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347559461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:08,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962580754] [2025-04-13 23:06:08,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:08,750 INFO L229 MonitoredProcess]: Starting monitored process 49 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:06:08,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 23:06:08,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:08,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:06:08,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:08,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:08,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 23:06:08,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:06:09,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:09,681 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:09,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 63 [2025-04-13 23:06:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:06:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962580754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:09,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:09,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-04-13 23:06:09,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444318220] [2025-04-13 23:06:09,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:09,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:06:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:09,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:06:09,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:06:09,773 INFO L87 Difference]: Start difference. First operand 682 states and 1775 transitions. Second operand has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:10,968 INFO L93 Difference]: Finished difference Result 777 states and 1963 transitions. [2025-04-13 23:06:10,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:06:10,969 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:06:10,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:10,970 INFO L225 Difference]: With dead ends: 777 [2025-04-13 23:06:10,970 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 23:06:10,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:06:10,971 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:10,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:06:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 23:06:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 668. [2025-04-13 23:06:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 2.608695652173913) internal successors, (1740), 667 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have 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:06:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1740 transitions. [2025-04-13 23:06:11,187 INFO L79 Accepts]: Start accepts. Automaton has 668 states and 1740 transitions. Word has length 26 [2025-04-13 23:06:11,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:11,187 INFO L485 AbstractCegarLoop]: Abstraction has 668 states and 1740 transitions. [2025-04-13 23:06:11,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:11,187 INFO L278 IsEmpty]: Start isEmpty. Operand 668 states and 1740 transitions. [2025-04-13 23:06:11,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:06:11,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:11,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:11,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 23:06:11,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-13 23:06:11,389 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:06:11,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1204365149, now seen corresponding path program 10 times [2025-04-13 23:06:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:11,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948478360] [2025-04-13 23:06:11,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:11,393 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:06:11,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:11,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:11,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:12,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:12,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948478360] [2025-04-13 23:06:12,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948478360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:12,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030461595] [2025-04-13 23:06:12,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:12,052 INFO L229 MonitoredProcess]: Starting monitored process 50 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:06:12,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 23:06:12,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:06:12,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:12,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:06:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:12,813 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:06:12,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:06:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:12,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:13,618 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:06:13,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 71 [2025-04-13 23:06:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:14,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030461595] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:14,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:06:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020944735] [2025-04-13 23:06:14,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:14,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:06:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:14,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:06:14,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2951, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:06:14,198 INFO L87 Difference]: Start difference. First operand 668 states and 1740 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:28,597 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:06:32,940 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:06:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:35,351 INFO L93 Difference]: Finished difference Result 2639 states and 6943 transitions. [2025-04-13 23:06:35,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 23:06:35,351 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:06:35,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:35,358 INFO L225 Difference]: With dead ends: 2639 [2025-04-13 23:06:35,359 INFO L226 Difference]: Without dead ends: 2602 [2025-04-13 23:06:35,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4146 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2094, Invalid=13656, Unknown=0, NotChecked=0, Total=15750 [2025-04-13 23:06:35,361 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 522 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:35,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 3480 Invalid, 1 Unknown, 0 Unchecked, 9.9s Time] [2025-04-13 23:06:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2025-04-13 23:06:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 668. [2025-04-13 23:06:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 2.605697151424288) internal successors, (1738), 667 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have 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:06:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1738 transitions. [2025-04-13 23:06:35,613 INFO L79 Accepts]: Start accepts. Automaton has 668 states and 1738 transitions. Word has length 26 [2025-04-13 23:06:35,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:35,613 INFO L485 AbstractCegarLoop]: Abstraction has 668 states and 1738 transitions. [2025-04-13 23:06:35,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:35,613 INFO L278 IsEmpty]: Start isEmpty. Operand 668 states and 1738 transitions. [2025-04-13 23:06:35,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:06:35,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:35,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:35,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 23:06:35,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 23:06:35,814 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:06:35,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1837388829, now seen corresponding path program 11 times [2025-04-13 23:06:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:35,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276301490] [2025-04-13 23:06:35,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:35,818 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:35,824 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:35,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:06:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:36,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:36,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276301490] [2025-04-13 23:06:36,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276301490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:36,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339586639] [2025-04-13 23:06:36,425 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:36,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:36,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:36,427 INFO L229 MonitoredProcess]: Starting monitored process 51 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:06:36,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 23:06:36,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:36,543 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:36,543 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:06:36,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:36,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 23:06:36,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:37,103 INFO L325 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2025-04-13 23:06:37,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2025-04-13 23:06:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:37,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:37,738 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:06:37,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 68 [2025-04-13 23:06:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339586639] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:38,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 53 [2025-04-13 23:06:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706218488] [2025-04-13 23:06:38,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:38,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 23:06:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:38,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 23:06:38,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2685, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 23:06:38,193 INFO L87 Difference]: Start difference. First operand 668 states and 1738 transitions. Second operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:45,233 INFO L93 Difference]: Finished difference Result 1433 states and 3667 transitions. [2025-04-13 23:06:45,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:06:45,234 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 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:06:45,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:45,237 INFO L225 Difference]: With dead ends: 1433 [2025-04-13 23:06:45,237 INFO L226 Difference]: Without dead ends: 1420 [2025-04-13 23:06:45,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1371, Invalid=8331, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:06:45,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:45,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:06:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-04-13 23:06:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 688. [2025-04-13 23:06:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.6026200873362444) internal successors, (1788), 687 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have 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:06:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1788 transitions. [2025-04-13 23:06:45,503 INFO L79 Accepts]: Start accepts. Automaton has 688 states and 1788 transitions. Word has length 26 [2025-04-13 23:06:45,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:45,504 INFO L485 AbstractCegarLoop]: Abstraction has 688 states and 1788 transitions. [2025-04-13 23:06:45,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:45,504 INFO L278 IsEmpty]: Start isEmpty. Operand 688 states and 1788 transitions. [2025-04-13 23:06:45,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:06:45,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:45,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:45,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 23:06:45,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 23:06:45,705 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:06:45,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2090163429, now seen corresponding path program 12 times [2025-04-13 23:06:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:45,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531778076] [2025-04-13 23:06:45,706 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:45,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:45,716 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:45,717 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:06:45,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:46,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531778076] [2025-04-13 23:06:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531778076] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:46,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476280472] [2025-04-13 23:06:46,336 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:46,338 INFO L229 MonitoredProcess]: Starting monitored process 52 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:06:46,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 23:06:46,397 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:06:46,462 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:06:46,463 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:06:46,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:46,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-13 23:06:46,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:47,199 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 23:06:47,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:47,206 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:47,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 13 [2025-04-13 23:06:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:47,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:48,306 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:06:48,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 60 [2025-04-13 23:06:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476280472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:48,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2025-04-13 23:06:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247026777] [2025-04-13 23:06:48,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:48,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-13 23:06:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:48,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-13 23:06:48,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3028, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:06:48,788 INFO L87 Difference]: Start difference. First operand 688 states and 1788 transitions. Second operand has 59 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:06:59,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:01,506 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:07,398 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:08,971 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:10,854 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:15,298 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:19,451 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:07:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:29,791 INFO L93 Difference]: Finished difference Result 982 states and 2498 transitions. [2025-04-13 23:07:29,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-04-13 23:07:29,792 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 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:07:29,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:29,794 INFO L225 Difference]: With dead ends: 982 [2025-04-13 23:07:29,794 INFO L226 Difference]: Without dead ends: 945 [2025-04-13 23:07:29,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=2211, Invalid=14819, Unknown=0, NotChecked=0, Total=17030 [2025-04-13 23:07:29,795 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3666 mSolverCounterSat, 286 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 3666 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:29,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 3956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 3666 Invalid, 4 Unknown, 0 Unchecked, 25.1s Time] [2025-04-13 23:07:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-04-13 23:07:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 698. [2025-04-13 23:07:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.5982783357245336) internal successors, (1811), 697 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have 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:07:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1811 transitions. [2025-04-13 23:07:30,091 INFO L79 Accepts]: Start accepts. Automaton has 698 states and 1811 transitions. Word has length 26 [2025-04-13 23:07:30,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:30,091 INFO L485 AbstractCegarLoop]: Abstraction has 698 states and 1811 transitions. [2025-04-13 23:07:30,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:07:30,091 INFO L278 IsEmpty]: Start isEmpty. Operand 698 states and 1811 transitions. [2025-04-13 23:07:30,091 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:07:30,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:30,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:30,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 23:07:30,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 23:07:30,292 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:07:30,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1437008607, now seen corresponding path program 13 times [2025-04-13 23:07:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:30,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373192392] [2025-04-13 23:07:30,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:30,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:07:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:07:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:30,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373192392] [2025-04-13 23:07:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373192392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:30,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503514014] [2025-04-13 23:07:30,949 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:30,951 INFO L229 MonitoredProcess]: Starting monitored process 53 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:07:30,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 23:07:31,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:07:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:07:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:31,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:07:31,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:31,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:32,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:32,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 68 [2025-04-13 23:07:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503514014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:32,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 54 [2025-04-13 23:07:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575122095] [2025-04-13 23:07:32,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:32,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:07:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:32,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:07:32,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2790, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:07:32,793 INFO L87 Difference]: Start difference. First operand 698 states and 1811 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:07:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:40,832 INFO L93 Difference]: Finished difference Result 1089 states and 2673 transitions. [2025-04-13 23:07:40,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:07:40,833 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:07:40,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:40,835 INFO L225 Difference]: With dead ends: 1089 [2025-04-13 23:07:40,835 INFO L226 Difference]: Without dead ends: 1026 [2025-04-13 23:07:40,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1435, Invalid=10337, Unknown=0, NotChecked=0, Total=11772 [2025-04-13 23:07:40,836 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:40,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 3978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 3750 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:07:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-04-13 23:07:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 720. [2025-04-13 23:07:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.588317107093185) internal successors, (1861), 719 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have 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:07:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1861 transitions. [2025-04-13 23:07:41,134 INFO L79 Accepts]: Start accepts. Automaton has 720 states and 1861 transitions. Word has length 26 [2025-04-13 23:07:41,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:41,134 INFO L485 AbstractCegarLoop]: Abstraction has 720 states and 1861 transitions. [2025-04-13 23:07:41,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:07:41,134 INFO L278 IsEmpty]: Start isEmpty. Operand 720 states and 1861 transitions. [2025-04-13 23:07:41,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:07:41,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:41,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:41,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 23:07:41,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-13 23:07:41,335 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:07:41,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1502418107, now seen corresponding path program 14 times [2025-04-13 23:07:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:41,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862321599] [2025-04-13 23:07:41,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:41,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:07:41,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:07:41,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:41,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:42,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862321599] [2025-04-13 23:07:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862321599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:42,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550131678] [2025-04-13 23:07:42,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:42,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:42,028 INFO L229 MonitoredProcess]: Starting monitored process 54 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:07:42,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 23:07:42,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:07:42,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:07:42,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:42,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:42,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:07:42,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:42,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:43,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:43,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 74 [2025-04-13 23:07:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550131678] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:44,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:07:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67333992] [2025-04-13 23:07:44,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:44,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:07:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:44,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:07:44,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2940, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:07:44,095 INFO L87 Difference]: Start difference. First operand 720 states and 1861 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:07:51,671 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:08:00,396 WARN L286 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:08:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:05,464 INFO L93 Difference]: Finished difference Result 907 states and 2305 transitions. [2025-04-13 23:08:05,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:08:05,465 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:05,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:05,467 INFO L225 Difference]: With dead ends: 907 [2025-04-13 23:08:05,467 INFO L226 Difference]: Without dead ends: 864 [2025-04-13 23:08:05,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2098 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=805, Invalid=8701, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:08:05,468 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:05,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 3573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-04-13 23:08:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-04-13 23:08:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 718. [2025-04-13 23:08:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.588563458856346) internal successors, (1856), 717 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have 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:08:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1856 transitions. [2025-04-13 23:08:05,786 INFO L79 Accepts]: Start accepts. Automaton has 718 states and 1856 transitions. Word has length 26 [2025-04-13 23:08:05,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:05,786 INFO L485 AbstractCegarLoop]: Abstraction has 718 states and 1856 transitions. [2025-04-13 23:08:05,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:05,786 INFO L278 IsEmpty]: Start isEmpty. Operand 718 states and 1856 transitions. [2025-04-13 23:08:05,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:05,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:05,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:05,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 23:08:05,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:05,987 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:08:05,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2057482329, now seen corresponding path program 15 times [2025-04-13 23:08:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:05,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083540564] [2025-04-13 23:08:05,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:05,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:05,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:05,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:08:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:06,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083540564] [2025-04-13 23:08:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083540564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:06,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560030907] [2025-04-13 23:08:06,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:06,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:06,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:06,724 INFO L229 MonitoredProcess]: Starting monitored process 55 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:08:06,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 23:08:06,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:06,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:06,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:08:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:06,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:08:06,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:07,608 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 23:08:07,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:08:07,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:07,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2025-04-13 23:08:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:07,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:08,769 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:08:08,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 60 [2025-04-13 23:08:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560030907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:09,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:08:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84379330] [2025-04-13 23:08:09,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:09,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:08:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:09,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:08:09,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2927, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:08:09,358 INFO L87 Difference]: Start difference. First operand 718 states and 1856 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:17,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 23:08:22,790 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:08:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:23,420 INFO L93 Difference]: Finished difference Result 963 states and 2464 transitions. [2025-04-13 23:08:23,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:08:23,420 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:23,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:23,422 INFO L225 Difference]: With dead ends: 963 [2025-04-13 23:08:23,422 INFO L226 Difference]: Without dead ends: 954 [2025-04-13 23:08:23,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=698, Invalid=6274, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:08:23,423 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:23,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2025-04-13 23:08:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-04-13 23:08:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 734. [2025-04-13 23:08:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 2.5948158253751705) internal successors, (1902), 733 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have 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:08:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1902 transitions. [2025-04-13 23:08:23,762 INFO L79 Accepts]: Start accepts. Automaton has 734 states and 1902 transitions. Word has length 26 [2025-04-13 23:08:23,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:23,762 INFO L485 AbstractCegarLoop]: Abstraction has 734 states and 1902 transitions. [2025-04-13 23:08:23,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:23,763 INFO L278 IsEmpty]: Start isEmpty. Operand 734 states and 1902 transitions. [2025-04-13 23:08:23,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:23,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:23,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 23:08:23,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:23,964 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:08:23,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 43675111, now seen corresponding path program 16 times [2025-04-13 23:08:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:23,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494842704] [2025-04-13 23:08:23,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:23,969 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:08:23,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:23,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:23,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:24,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:24,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494842704] [2025-04-13 23:08:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494842704] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:24,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654108499] [2025-04-13 23:08:24,661 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:24,663 INFO L229 MonitoredProcess]: Starting monitored process 56 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:08:24,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 23:08:24,728 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:08:24,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:24,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:24,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:24,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:08:24,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:25,554 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:08:25,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:08:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:25,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:26,595 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:08:26,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 71 [2025-04-13 23:08:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654108499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:27,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:08:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028079903] [2025-04-13 23:08:27,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:27,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:08:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:08:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2930, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:08:27,291 INFO L87 Difference]: Start difference. First operand 734 states and 1902 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:46,736 INFO L93 Difference]: Finished difference Result 2170 states and 5690 transitions. [2025-04-13 23:08:46,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-04-13 23:08:46,736 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:46,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:46,740 INFO L225 Difference]: With dead ends: 2170 [2025-04-13 23:08:46,740 INFO L226 Difference]: Without dead ends: 2115 [2025-04-13 23:08:46,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5312 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=2524, Invalid=15566, Unknown=0, NotChecked=0, Total=18090 [2025-04-13 23:08:46,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 409 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 3614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:46,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 0 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 3614 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 23:08:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-04-13 23:08:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 750. [2025-04-13 23:08:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.5927903871829105) internal successors, (1942), 749 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have 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:08:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1942 transitions. [2025-04-13 23:08:47,131 INFO L79 Accepts]: Start accepts. Automaton has 750 states and 1942 transitions. Word has length 26 [2025-04-13 23:08:47,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:47,131 INFO L485 AbstractCegarLoop]: Abstraction has 750 states and 1942 transitions. [2025-04-13 23:08:47,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:47,131 INFO L278 IsEmpty]: Start isEmpty. Operand 750 states and 1942 transitions. [2025-04-13 23:08:47,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:47,132 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:47,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:47,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:47,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:47,332 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:08:47,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1560943655, now seen corresponding path program 17 times [2025-04-13 23:08:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:47,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761582330] [2025-04-13 23:08:47,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:47,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:47,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:47,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:08:47,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:48,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761582330] [2025-04-13 23:08:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761582330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:48,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660118179] [2025-04-13 23:08:48,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:48,011 INFO L229 MonitoredProcess]: Starting monitored process 57 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:08:48,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 23:08:48,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:48,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:48,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:08:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:48,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:08:48,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:48,782 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 23:08:48,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:48,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2025-04-13 23:08:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:48,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:49,692 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:08:49,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 71 [2025-04-13 23:08:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:50,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660118179] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:50,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:50,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 53 [2025-04-13 23:08:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629456449] [2025-04-13 23:08:50,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:50,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 23:08:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:50,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 23:08:50,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2648, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 23:08:50,286 INFO L87 Difference]: Start difference. First operand 750 states and 1942 transitions. Second operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:57,031 INFO L93 Difference]: Finished difference Result 1050 states and 2649 transitions. [2025-04-13 23:08:57,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:08:57,031 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:57,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:57,033 INFO L225 Difference]: With dead ends: 1050 [2025-04-13 23:08:57,033 INFO L226 Difference]: Without dead ends: 1031 [2025-04-13 23:08:57,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1223, Invalid=7897, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 23:08:57,033 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 184 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:57,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 0 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:08:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-04-13 23:08:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 782. [2025-04-13 23:08:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 2.6043533930857876) internal successors, (2034), 781 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have 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:08:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2034 transitions. [2025-04-13 23:08:57,480 INFO L79 Accepts]: Start accepts. Automaton has 782 states and 2034 transitions. Word has length 26 [2025-04-13 23:08:57,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:57,480 INFO L485 AbstractCegarLoop]: Abstraction has 782 states and 2034 transitions. [2025-04-13 23:08:57,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:08:57,480 INFO L278 IsEmpty]: Start isEmpty. Operand 782 states and 2034 transitions. [2025-04-13 23:08:57,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:08:57,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:57,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:57,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 23:08:57,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:57,681 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:08:57,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1612607015, now seen corresponding path program 18 times [2025-04-13 23:08:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:57,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792520210] [2025-04-13 23:08:57,682 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:57,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:57,694 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:57,694 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:08:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:58,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792520210] [2025-04-13 23:08:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792520210] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:58,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938241612] [2025-04-13 23:08:58,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:58,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:58,369 INFO L229 MonitoredProcess]: Starting monitored process 58 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:08:58,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 23:08:58,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:08:58,459 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:08:58,459 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:08:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:58,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:08:58,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:59,167 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:08:59,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:08:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:59,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:00,530 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:09:00,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 71 [2025-04-13 23:09:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938241612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:01,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 56 [2025-04-13 23:09:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206805855] [2025-04-13 23:09:01,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:01,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 23:09:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 23:09:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2951, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 23:09:01,188 INFO L87 Difference]: Start difference. First operand 782 states and 2034 transitions. Second operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:13,938 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 23:09:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:19,728 INFO L93 Difference]: Finished difference Result 1033 states and 2621 transitions. [2025-04-13 23:09:19,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-13 23:09:19,729 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 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:09:19,729 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:19,731 INFO L225 Difference]: With dead ends: 1033 [2025-04-13 23:09:19,731 INFO L226 Difference]: Without dead ends: 1016 [2025-04-13 23:09:19,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2401, Invalid=15959, Unknown=0, NotChecked=0, Total=18360 [2025-04-13 23:09:19,732 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 386 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:19,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 0 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-04-13 23:09:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-04-13 23:09:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 786. [2025-04-13 23:09:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 2.6012738853503183) internal successors, (2042), 785 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have 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:09:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2042 transitions. [2025-04-13 23:09:20,193 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2042 transitions. Word has length 26 [2025-04-13 23:09:20,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:20,193 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2042 transitions. [2025-04-13 23:09:20,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:20,193 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2042 transitions. [2025-04-13 23:09:20,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:09:20,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:20,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:20,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 23:09:20,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:20,394 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:09:20,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1874554465, now seen corresponding path program 19 times [2025-04-13 23:09:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:20,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988449296] [2025-04-13 23:09:20,395 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:20,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:09:20,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:09:20,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:20,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:21,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988449296] [2025-04-13 23:09:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988449296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:21,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820093624] [2025-04-13 23:09:21,098 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:21,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:21,100 INFO L229 MonitoredProcess]: Starting monitored process 59 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:09:21,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 23:09:21,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:09:21,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:09:21,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:21,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:21,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:09:21,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:21,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:23,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:23,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-13 23:09:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820093624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:23,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:23,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:09:23,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326600391] [2025-04-13 23:09:23,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:23,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:09:23,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:23,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:09:23,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2947, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:09:23,559 INFO L87 Difference]: Start difference. First operand 786 states and 2042 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:33,192 INFO L93 Difference]: Finished difference Result 1076 states and 2714 transitions. [2025-04-13 23:09:33,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:09:33,192 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:09:33,193 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:33,194 INFO L225 Difference]: With dead ends: 1076 [2025-04-13 23:09:33,195 INFO L226 Difference]: Without dead ends: 1042 [2025-04-13 23:09:33,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=923, Invalid=9379, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 23:09:33,195 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3741 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:33,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 3867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3741 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 23:09:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-04-13 23:09:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 804. [2025-04-13 23:09:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 2.6064757160647574) internal successors, (2093), 803 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2093 transitions. [2025-04-13 23:09:33,689 INFO L79 Accepts]: Start accepts. Automaton has 804 states and 2093 transitions. Word has length 26 [2025-04-13 23:09:33,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:33,689 INFO L485 AbstractCegarLoop]: Abstraction has 804 states and 2093 transitions. [2025-04-13 23:09:33,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:33,689 INFO L278 IsEmpty]: Start isEmpty. Operand 804 states and 2093 transitions. [2025-04-13 23:09:33,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:09:33,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:33,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:33,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 23:09:33,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-04-13 23:09:33,891 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:09:33,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1359832415, now seen corresponding path program 20 times [2025-04-13 23:09:33,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:33,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827921516] [2025-04-13 23:09:33,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:33,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:09:33,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:09:33,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:33,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:34,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827921516] [2025-04-13 23:09:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827921516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:34,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671562445] [2025-04-13 23:09:34,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:34,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:34,660 INFO L229 MonitoredProcess]: Starting monitored process 60 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:09:34,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 23:09:34,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:09:34,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:09:34,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:34,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:09:34,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:35,667 INFO L325 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-04-13 23:09:35,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 19 [2025-04-13 23:09:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:35,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:36,950 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:09:36,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 74 [2025-04-13 23:09:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671562445] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:37,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:09:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496433492] [2025-04-13 23:09:37,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:37,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:09:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:37,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:09:37,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2947, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:09:37,755 INFO L87 Difference]: Start difference. First operand 804 states and 2093 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:44,293 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 23:10:05,114 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 37 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:10:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:15,974 INFO L93 Difference]: Finished difference Result 1766 states and 4731 transitions. [2025-04-13 23:10:15,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 23:10:15,974 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:10:15,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:15,977 INFO L225 Difference]: With dead ends: 1766 [2025-04-13 23:10:15,977 INFO L226 Difference]: Without dead ends: 1727 [2025-04-13 23:10:15,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=1708, Invalid=13544, Unknown=0, NotChecked=0, Total=15252 [2025-04-13 23:10:15,978 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:15,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 5261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-04-13 23:10:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-04-13 23:10:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 800. [2025-04-13 23:10:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.607008760951189) internal successors, (2083), 799 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have 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:10:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2083 transitions. [2025-04-13 23:10:16,489 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2083 transitions. Word has length 26 [2025-04-13 23:10:16,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:16,489 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2083 transitions. [2025-04-13 23:10:16,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:10:16,489 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2083 transitions. [2025-04-13 23:10:16,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:10:16,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:16,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:16,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 23:10:16,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2025-04-13 23:10:16,691 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:10:16,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -976894749, now seen corresponding path program 21 times [2025-04-13 23:10:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:16,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509858222] [2025-04-13 23:10:16,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:16,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:10:16,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:10:16,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:10:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:17,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509858222] [2025-04-13 23:10:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509858222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:17,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648612005] [2025-04-13 23:10:17,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:17,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:17,052 INFO L229 MonitoredProcess]: Starting monitored process 61 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:10:17,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 23:10:17,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:10:17,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:10:17,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:17,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:17,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:10:17,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:10:17,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:18,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:18,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-13 23:10:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:10:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648612005] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:18,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-04-13 23:10:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864499731] [2025-04-13 23:10:18,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:18,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:10:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:18,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:10:18,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:10:18,301 INFO L87 Difference]: Start difference. First operand 800 states and 2083 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:20,062 INFO L93 Difference]: Finished difference Result 841 states and 2162 transitions. [2025-04-13 23:10:20,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:10:20,062 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:10:20,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:20,064 INFO L225 Difference]: With dead ends: 841 [2025-04-13 23:10:20,064 INFO L226 Difference]: Without dead ends: 824 [2025-04-13 23:10:20,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:10:20,064 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:20,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:10:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-04-13 23:10:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 800. [2025-04-13 23:10:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.60450563204005) internal successors, (2081), 799 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have 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:10:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2081 transitions. [2025-04-13 23:10:20,556 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2081 transitions. Word has length 26 [2025-04-13 23:10:20,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:20,556 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2081 transitions. [2025-04-13 23:10:20,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:20,556 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2081 transitions. [2025-04-13 23:10:20,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:10:20,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:20,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:20,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-04-13 23:10:20,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:20,757 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:10:20,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 592037155, now seen corresponding path program 22 times [2025-04-13 23:10:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:20,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403390515] [2025-04-13 23:10:20,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:20,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:10:20,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:10:20,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:21,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403390515] [2025-04-13 23:10:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403390515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:21,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72783764] [2025-04-13 23:10:21,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:21,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:21,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:21,461 INFO L229 MonitoredProcess]: Starting monitored process 62 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:10:21,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 23:10:21,528 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:10:21,551 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:10:21,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:21,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:10:21,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:22,324 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:10:22,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:10:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:22,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:23,287 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:10:23,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 68 [2025-04-13 23:10:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72783764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:23,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:23,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 54 [2025-04-13 23:10:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528034805] [2025-04-13 23:10:23,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:23,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:10:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:23,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:10:23,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2797, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:10:23,930 INFO L87 Difference]: Start difference. First operand 800 states and 2081 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:10:43,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:47,974 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:52,014 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:55,691 INFO L93 Difference]: Finished difference Result 1956 states and 5068 transitions. [2025-04-13 23:10:55,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-13 23:10:55,691 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:10:55,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:55,694 INFO L225 Difference]: With dead ends: 1956 [2025-04-13 23:10:55,694 INFO L226 Difference]: Without dead ends: 1929 [2025-04-13 23:10:55,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=2557, Invalid=14999, Unknown=0, NotChecked=0, Total=17556 [2025-04-13 23:10:55,695 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3458 mSolverCounterSat, 485 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 3458 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:55,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 3946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 3458 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-04-13 23:10:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-04-13 23:10:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 798. [2025-04-13 23:10:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.604767879548306) internal successors, (2076), 797 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have 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:10:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2076 transitions. [2025-04-13 23:10:56,207 INFO L79 Accepts]: Start accepts. Automaton has 798 states and 2076 transitions. Word has length 26 [2025-04-13 23:10:56,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:56,207 INFO L485 AbstractCegarLoop]: Abstraction has 798 states and 2076 transitions. [2025-04-13 23:10:56,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:10:56,207 INFO L278 IsEmpty]: Start isEmpty. Operand 798 states and 2076 transitions. [2025-04-13 23:10:56,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:10:56,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:56,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:56,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-04-13 23:10:56,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:56,408 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:10:56,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1712761631, now seen corresponding path program 23 times [2025-04-13 23:10:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:56,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293943204] [2025-04-13 23:10:56,409 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:56,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:10:56,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:10:56,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:10:56,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:10:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:56,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293943204] [2025-04-13 23:10:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293943204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:56,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132362834] [2025-04-13 23:10:56,724 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:56,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:56,726 INFO L229 MonitoredProcess]: Starting monitored process 63 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:10:56,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 23:10:56,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:10:56,829 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:10:56,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:10:56,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:56,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 23:10:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:57,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:10:57,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:57,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 18 [2025-04-13 23:10:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:57,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:58,527 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:10:58,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 68 [2025-04-13 23:10:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132362834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:59,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 17] total 48 [2025-04-13 23:10:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642659275] [2025-04-13 23:10:59,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:59,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 23:10:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:59,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 23:10:59,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 23:10:59,079 INFO L87 Difference]: Start difference. First operand 798 states and 2076 transitions. Second operand has 50 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 49 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:17,111 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:19,868 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:30,814 WARN L286 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 101 DAG size of output: 78 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 23:11:34,966 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:11:39,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:11:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:40,252 INFO L93 Difference]: Finished difference Result 1023 states and 2586 transitions. [2025-04-13 23:11:40,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:11:40,252 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 49 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:11:40,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:40,254 INFO L225 Difference]: With dead ends: 1023 [2025-04-13 23:11:40,254 INFO L226 Difference]: Without dead ends: 990 [2025-04-13 23:11:40,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=1026, Invalid=6455, Unknown=1, NotChecked=0, Total=7482 [2025-04-13 23:11:40,254 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 194 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:40,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2849 Invalid, 2 Unknown, 0 Unchecked, 15.2s Time] [2025-04-13 23:11:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-04-13 23:11:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 822. [2025-04-13 23:11:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 2.5943970767356883) internal successors, (2130), 821 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have 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:11:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2130 transitions. [2025-04-13 23:11:40,788 INFO L79 Accepts]: Start accepts. Automaton has 822 states and 2130 transitions. Word has length 26 [2025-04-13 23:11:40,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:40,788 INFO L485 AbstractCegarLoop]: Abstraction has 822 states and 2130 transitions. [2025-04-13 23:11:40,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 49 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:40,788 INFO L278 IsEmpty]: Start isEmpty. Operand 822 states and 2130 transitions. [2025-04-13 23:11:40,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:11:40,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:40,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:40,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 23:11:40,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 23:11:40,990 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:11:40,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1947577737, now seen corresponding path program 24 times [2025-04-13 23:11:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:40,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526677727] [2025-04-13 23:11:40,990 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:40,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:11:41,001 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:11:41,001 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:11:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:41,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526677727] [2025-04-13 23:11:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526677727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:41,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797908582] [2025-04-13 23:11:41,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:41,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:41,693 INFO L229 MonitoredProcess]: Starting monitored process 64 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:11:41,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 23:11:41,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:11:41,799 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:11:41,800 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:11:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:41,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 23:11:41,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:42,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:43,207 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:43,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 63 [2025-04-13 23:11:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:11:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797908582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:43,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 47 [2025-04-13 23:11:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085330689] [2025-04-13 23:11:43,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:43,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 23:11:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:43,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 23:11:43,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 23:11:43,461 INFO L87 Difference]: Start difference. First operand 822 states and 2130 transitions. Second operand has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:47,659 INFO L93 Difference]: Finished difference Result 908 states and 2310 transitions. [2025-04-13 23:11:47,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 23:11:47,659 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:11:47,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:47,661 INFO L225 Difference]: With dead ends: 908 [2025-04-13 23:11:47,661 INFO L226 Difference]: Without dead ends: 869 [2025-04-13 23:11:47,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=327, Invalid=5075, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:11:47,662 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:47,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 23:11:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-04-13 23:11:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 826. [2025-04-13 23:11:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 2.5939393939393938) internal successors, (2140), 825 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have 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:11:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2140 transitions. [2025-04-13 23:11:48,211 INFO L79 Accepts]: Start accepts. Automaton has 826 states and 2140 transitions. Word has length 26 [2025-04-13 23:11:48,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:48,212 INFO L485 AbstractCegarLoop]: Abstraction has 826 states and 2140 transitions. [2025-04-13 23:11:48,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:48,212 INFO L278 IsEmpty]: Start isEmpty. Operand 826 states and 2140 transitions. [2025-04-13 23:11:48,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:11:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:48,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:48,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 23:11:48,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:48,413 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:11:48,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1093985511, now seen corresponding path program 25 times [2025-04-13 23:11:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:48,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558632395] [2025-04-13 23:11:48,413 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:11:48,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:11:48,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:48,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:49,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558632395] [2025-04-13 23:11:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558632395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:49,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89600587] [2025-04-13 23:11:49,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:49,221 INFO L229 MonitoredProcess]: Starting monitored process 65 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:11:49,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 23:11:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:11:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:11:49,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:49,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:49,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:11:49,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:50,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:51,270 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:51,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-13 23:11:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89600587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:51,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:11:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537057090] [2025-04-13 23:11:51,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:51,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:11:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:51,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:11:51,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2898, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:11:51,742 INFO L87 Difference]: Start difference. First operand 826 states and 2140 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:05,222 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:17,169 INFO L93 Difference]: Finished difference Result 1882 states and 4740 transitions. [2025-04-13 23:12:17,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 23:12:17,169 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:12:17,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:17,172 INFO L225 Difference]: With dead ends: 1882 [2025-04-13 23:12:17,172 INFO L226 Difference]: Without dead ends: 1842 [2025-04-13 23:12:17,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3380 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=1943, Invalid=13557, Unknown=0, NotChecked=0, Total=15500 [2025-04-13 23:12:17,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 365 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:17,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 0 Invalid, 5064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-04-13 23:12:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-04-13 23:12:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 876. [2025-04-13 23:12:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 2.6205714285714286) internal successors, (2293), 875 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have 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:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 2293 transitions. [2025-04-13 23:12:17,796 INFO L79 Accepts]: Start accepts. Automaton has 876 states and 2293 transitions. Word has length 26 [2025-04-13 23:12:17,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:17,796 INFO L485 AbstractCegarLoop]: Abstraction has 876 states and 2293 transitions. [2025-04-13 23:12:17,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:17,796 INFO L278 IsEmpty]: Start isEmpty. Operand 876 states and 2293 transitions. [2025-04-13 23:12:17,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:12:17,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:17,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:17,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 23:12:17,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:17,997 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:12:17,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1683713241, now seen corresponding path program 26 times [2025-04-13 23:12:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:17,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076821697] [2025-04-13 23:12:17,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:18,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:12:18,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:12:18,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:18,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076821697] [2025-04-13 23:12:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076821697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:18,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521404363] [2025-04-13 23:12:18,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:18,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:18,854 INFO L229 MonitoredProcess]: Starting monitored process 66 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:12:18,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 23:12:18,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:12:18,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:12:18,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:18,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:18,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-13 23:12:18,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:19,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:20,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:20,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 68 [2025-04-13 23:12:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:21,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521404363] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:21,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 54 [2025-04-13 23:12:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771854872] [2025-04-13 23:12:21,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:21,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:12:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:21,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:12:21,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2799, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:12:21,130 INFO L87 Difference]: Start difference. First operand 876 states and 2293 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:37,786 INFO L93 Difference]: Finished difference Result 1413 states and 3566 transitions. [2025-04-13 23:12:37,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-04-13 23:12:37,786 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:12:37,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:37,789 INFO L225 Difference]: With dead ends: 1413 [2025-04-13 23:12:37,789 INFO L226 Difference]: Without dead ends: 1359 [2025-04-13 23:12:37,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6200 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1791, Invalid=18231, Unknown=0, NotChecked=0, Total=20022 [2025-04-13 23:12:37,790 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:37,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 5319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 23:12:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-04-13 23:12:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 906. [2025-04-13 23:12:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 2.6298342541436464) internal successors, (2380), 905 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have 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:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2380 transitions. [2025-04-13 23:12:38,460 INFO L79 Accepts]: Start accepts. Automaton has 906 states and 2380 transitions. Word has length 26 [2025-04-13 23:12:38,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:38,460 INFO L485 AbstractCegarLoop]: Abstraction has 906 states and 2380 transitions. [2025-04-13 23:12:38,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:38,460 INFO L278 IsEmpty]: Start isEmpty. Operand 906 states and 2380 transitions. [2025-04-13 23:12:38,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:12:38,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:38,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:38,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 23:12:38,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2025-04-13 23:12:38,662 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:12:38,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1632049881, now seen corresponding path program 27 times [2025-04-13 23:12:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:38,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802919475] [2025-04-13 23:12:38,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:38,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:12:38,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:12:38,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:38,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:12:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:38,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802919475] [2025-04-13 23:12:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802919475] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:38,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513635612] [2025-04-13 23:12:38,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:38,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:38,994 INFO L229 MonitoredProcess]: Starting monitored process 67 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:12:38,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 23:12:39,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:12:39,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 26 statements. [2025-04-13 23:12:39,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:39,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:12:39,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:39,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:39,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 28 [2025-04-13 23:12:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:12:39,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:40,314 INFO L325 Elim1Store]: treesize reduction 10, result has 86.3 percent of original size [2025-04-13 23:12:40,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 90 [2025-04-13 23:12:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:12:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513635612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:40,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-04-13 23:12:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298041492] [2025-04-13 23:12:40,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:40,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 23:12:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:40,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 23:12:40,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:12:40,505 INFO L87 Difference]: Start difference. First operand 906 states and 2380 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:42,600 INFO L93 Difference]: Finished difference Result 1123 states and 2922 transitions. [2025-04-13 23:12:42,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:12:42,601 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:12:42,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:42,603 INFO L225 Difference]: With dead ends: 1123 [2025-04-13 23:12:42,603 INFO L226 Difference]: Without dead ends: 1110 [2025-04-13 23:12:42,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=1641, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:12:42,604 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:42,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:12:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-04-13 23:12:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 908. [2025-04-13 23:12:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 2.625137816979052) internal successors, (2381), 907 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have 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:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2381 transitions. [2025-04-13 23:12:43,269 INFO L79 Accepts]: Start accepts. Automaton has 908 states and 2381 transitions. Word has length 26 [2025-04-13 23:12:43,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:43,269 INFO L485 AbstractCegarLoop]: Abstraction has 908 states and 2381 transitions. [2025-04-13 23:12:43,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,269 INFO L278 IsEmpty]: Start isEmpty. Operand 908 states and 2381 transitions. [2025-04-13 23:12:43,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:12:43,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:43,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:43,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 23:12:43,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:43,471 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:12:43,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash -824244065, now seen corresponding path program 28 times [2025-04-13 23:12:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:43,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590302049] [2025-04-13 23:12:43,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:43,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:12:43,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:12:43,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:44,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590302049] [2025-04-13 23:12:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590302049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:44,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188955591] [2025-04-13 23:12:44,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:44,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:44,173 INFO L229 MonitoredProcess]: Starting monitored process 68 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:12:44,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 23:12:44,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:12:44,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:12:44,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:44,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:12:44,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:45,007 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:12:45,008 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-04-13 23:12:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:45,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:46,107 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:12:46,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 71 [2025-04-13 23:12:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188955591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:46,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 55 [2025-04-13 23:12:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401074832] [2025-04-13 23:12:46,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:46,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 23:12:46,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:46,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 23:12:46,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2900, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:12:46,956 INFO L87 Difference]: Start difference. First operand 908 states and 2381 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:14,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:24,625 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:28,638 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:32,642 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:34,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:43,138 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:48,452 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:58,524 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:05,493 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:18,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:26,955 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:49,951 INFO L93 Difference]: Finished difference Result 4821 states and 12181 transitions. [2025-04-13 23:14:49,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2025-04-13 23:14:49,952 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 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:14:49,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:49,958 INFO L225 Difference]: With dead ends: 4821 [2025-04-13 23:14:49,958 INFO L226 Difference]: Without dead ends: 3950 [2025-04-13 23:14:49,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24510 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=9441, Invalid=58941, Unknown=0, NotChecked=0, Total=68382 [2025-04-13 23:14:49,962 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 726 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8895 mSolverCounterSat, 916 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 8895 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:49,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 0 Invalid, 9817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 8895 Invalid, 6 Unknown, 0 Unchecked, 65.9s Time] [2025-04-13 23:14:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2025-04-13 23:14:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 1343. [2025-04-13 23:14:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 2.7593144560357676) internal successors, (3703), 1342 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have 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:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 3703 transitions. [2025-04-13 23:14:51,013 INFO L79 Accepts]: Start accepts. Automaton has 1343 states and 3703 transitions. Word has length 26 [2025-04-13 23:14:51,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:51,013 INFO L485 AbstractCegarLoop]: Abstraction has 1343 states and 3703 transitions. [2025-04-13 23:14:51,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:51,013 INFO L278 IsEmpty]: Start isEmpty. Operand 1343 states and 3703 transitions. [2025-04-13 23:14:51,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:14:51,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:51,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:14:51,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 23:14:51,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:51,215 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:14:51,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1395698871, now seen corresponding path program 29 times [2025-04-13 23:14:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:51,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377706016] [2025-04-13 23:14:51,216 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:14:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:51,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:14:51,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:14:51,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:14:51,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:51,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377706016] [2025-04-13 23:14:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377706016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:51,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920957557] [2025-04-13 23:14:51,901 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:14:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:51,904 INFO L229 MonitoredProcess]: Starting monitored process 69 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:51,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 23:14:51,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:14:52,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:14:52,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:14:52,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:52,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 23:14:52,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:52,711 INFO L325 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-04-13 23:14:52,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 18 [2025-04-13 23:14:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:52,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:53,923 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:14:53,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 71 [2025-04-13 23:14:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920957557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:54,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2025-04-13 23:14:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348450502] [2025-04-13 23:14:54,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:54,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:14:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:54,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:14:54,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2798, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:14:54,854 INFO L87 Difference]: Start difference. First operand 1343 states and 3703 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:00,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:02,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:05,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:07,092 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:13,318 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:17,324 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:21,331 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:25,334 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:29,767 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:34,395 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:38,399 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:42,272 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:46,274 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:49,979 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:54,016 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:57,622 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:59,386 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:18,710 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:27,454 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:37,321 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:49,457 INFO L93 Difference]: Finished difference Result 3752 states and 9643 transitions. [2025-04-13 23:16:49,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-04-13 23:16:49,458 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:16:49,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:49,464 INFO L225 Difference]: With dead ends: 3752 [2025-04-13 23:16:49,464 INFO L226 Difference]: Without dead ends: 3416 [2025-04-13 23:16:49,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9693 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=5656, Invalid=27650, Unknown=0, NotChecked=0, Total=33306 [2025-04-13 23:16:49,466 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 575 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5621 mSolverCounterSat, 493 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 5621 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:49,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 0 Invalid, 6124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 5621 Invalid, 10 Unknown, 0 Unchecked, 79.9s Time] [2025-04-13 23:16:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2025-04-13 23:16:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 1675. [2025-04-13 23:16:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 2.8070489844683393) internal successors, (4699), 1674 states have internal predecessors, (4699), 0 states have call successors, (0), 0 states have 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:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 4699 transitions. [2025-04-13 23:16:50,736 INFO L79 Accepts]: Start accepts. Automaton has 1675 states and 4699 transitions. Word has length 26 [2025-04-13 23:16:50,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:50,736 INFO L485 AbstractCegarLoop]: Abstraction has 1675 states and 4699 transitions. [2025-04-13 23:16:50,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:50,736 INFO L278 IsEmpty]: Start isEmpty. Operand 1675 states and 4699 transitions. [2025-04-13 23:16:50,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:16:50,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:50,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:50,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 23:16:50,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2025-04-13 23:16:50,938 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:50,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -596587993, now seen corresponding path program 30 times [2025-04-13 23:16:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:50,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211404096] [2025-04-13 23:16:50,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:16:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:50,943 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:50,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:50,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:16:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:51,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211404096] [2025-04-13 23:16:51,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211404096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:51,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146194557] [2025-04-13 23:16:51,600 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:16:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:51,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:51,602 INFO L229 MonitoredProcess]: Starting monitored process 70 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:51,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 23:16:51,675 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:51,699 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:51,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:16:51,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 23:16:51,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:52,283 INFO L325 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-04-13 23:16:52,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 18 [2025-04-13 23:16:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:52,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:53,555 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-13 23:16:53,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 71 [2025-04-13 23:16:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146194557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:54,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 54 [2025-04-13 23:16:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922893867] [2025-04-13 23:16:54,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:54,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-13 23:16:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:54,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-13 23:16:54,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2810, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 23:16:54,251 INFO L87 Difference]: Start difference. First operand 1675 states and 4699 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:03,720 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 23:17:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:11,695 INFO L93 Difference]: Finished difference Result 1903 states and 5260 transitions. [2025-04-13 23:17:11,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:17:11,696 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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:17:11,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:11,699 INFO L225 Difference]: With dead ends: 1903 [2025-04-13 23:17:11,700 INFO L226 Difference]: Without dead ends: 1875 [2025-04-13 23:17:11,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1106, Invalid=8400, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:17:11,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3388 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 3388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:11,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 3388 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-04-13 23:17:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-04-13 23:17:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1697. [2025-04-13 23:17:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 2.8148584905660377) internal successors, (4774), 1696 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have 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:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 4774 transitions. [2025-04-13 23:17:12,976 INFO L79 Accepts]: Start accepts. Automaton has 1697 states and 4774 transitions. Word has length 26 [2025-04-13 23:17:12,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:12,976 INFO L485 AbstractCegarLoop]: Abstraction has 1697 states and 4774 transitions. [2025-04-13 23:17:12,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:12,976 INFO L278 IsEmpty]: Start isEmpty. Operand 1697 states and 4774 transitions. [2025-04-13 23:17:12,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:12,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:12,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:12,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 23:17:13,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:13,177 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:17:13,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -544924633, now seen corresponding path program 31 times [2025-04-13 23:17:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:13,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314120814] [2025-04-13 23:17:13,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:17:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:13,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:17:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:14,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314120814] [2025-04-13 23:17:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314120814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:14,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102300792] [2025-04-13 23:17:14,039 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:17:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:14,041 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:17:14,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 23:17:14,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:17:14,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:14,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:14,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:14,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 23:17:14,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2025-04-13 23:17:14,516 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:17:14,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 23:17:14,530 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:17:14,542 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:17:14,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:14,717 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. [2025-04-13 23:17:14,718 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:17:14,718 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:17:14,720 INFO L422 BasicCegarLoop]: Path program histogram: [47, 31, 5, 2, 1, 1, 1] [2025-04-13 23:17:14,722 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:17:14,722 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:17:14,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:17:14 BasicIcfg [2025-04-13 23:17:14,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:17:14,723 INFO L158 Benchmark]: Toolchain (without parser) took 851617.20ms. Allocated memory was 125.8MB in the beginning and 922.7MB in the end (delta: 796.9MB). Free memory was 91.7MB in the beginning and 566.6MB in the end (delta: -474.8MB). Peak memory consumption was 325.9MB. Max. memory is 8.0GB. [2025-04-13 23:17:14,723 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:17:14,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.78ms. Allocated memory is still 125.8MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:17:14,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:17:14,724 INFO L158 Benchmark]: Boogie Preprocessor took 46.28ms. Allocated memory is still 125.8MB. Free memory was 74.2MB in the beginning and 72.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:17:14,724 INFO L158 Benchmark]: IcfgBuilder took 548.91ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 80.9MB in the end (delta: -8.8MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2025-04-13 23:17:14,724 INFO L158 Benchmark]: TraceAbstraction took 850713.00ms. Allocated memory was 125.8MB in the beginning and 922.7MB in the end (delta: 796.9MB). Free memory was 80.2MB in the beginning and 566.6MB in the end (delta: -486.4MB). Peak memory consumption was 311.2MB. Max. memory is 8.0GB. [2025-04-13 23:17:14,724 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.78ms. Allocated memory is still 125.8MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 125.8MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.28ms. Allocated memory is still 125.8MB. Free memory was 74.2MB in the beginning and 72.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 548.91ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 80.9MB in the end (delta: -8.8MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * TraceAbstraction took 850713.00ms. Allocated memory was 125.8MB in the beginning and 922.7MB in the end (delta: 796.9MB). Free memory was 80.2MB in the beginning and 566.6MB in the end (delta: -486.4MB). Peak memory consumption was 311.2MB. 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 analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 33 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 850.6s, OverallIterations: 88, TraceHistogramMax: 3, PathProgramHistogramMax: 47, EmptinessCheckTime: 0.1s, AutomataDifference: 686.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 12010 SdHoareTripleChecker+Valid, 323.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12010 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 313.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153078 IncrementalHoareTripleChecker+Invalid, 162601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9496 mSolverCounterUnsat, 0 mSDtfsCounter, 153078 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6259 GetRequests, 1239 SyntacticMatches, 41 SemanticMatches, 4979 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131308 ImplicationChecksByTransitivity, 388.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1697occurred in iteration=87, InterpolantAutomatonStates: 3306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.4s AutomataMinimizationTime, 87 MinimizatonAttempts, 20641 StatesRemovedByMinimization, 81 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 125.7s InterpolantComputationTime, 3537 NumberOfCodeBlocks, 3503 NumberOfCodeBlocksAsserted, 297 NumberOfCheckSat, 4871 ConstructedInterpolants, 339 QuantifiedInterpolants, 115447 SizeOfPredicates, 985 NumberOfNonLiveVariables, 13239 ConjunctsInSsa, 3249 ConjunctsInUnsatCore, 223 InterpolantComputations, 21 PerfectInterpolantSequences, 304/1607 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