/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-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:13:44,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:13:45,027 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:13:45,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:13:45,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:13:45,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:13:45,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:13:45,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:13:45,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:13:45,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:13:45,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:13:45,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:13:45,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:13:45,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:13:45,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:13:45,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:13:45,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:13:45,055 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:13:45,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:13:45,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:13:45,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:13:45,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:13:45,296 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:13:45,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 23:13:46,569 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10e2a105/cbc9ce2b705a474b8a7f0d6ad3399387/FLAG15438e5c2 [2025-04-13 23:13:46,790 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:13:46,791 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 23:13:46,799 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10e2a105/cbc9ce2b705a474b8a7f0d6ad3399387/FLAG15438e5c2 [2025-04-13 23:13:47,571 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10e2a105/cbc9ce2b705a474b8a7f0d6ad3399387 [2025-04-13 23:13:47,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:13:47,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:13:47,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:13:47,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:13:47,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:13:47,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403073f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47, skipping insertion in model container [2025-04-13 23:13:47,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:13:47,733 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 23:13:47,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:13:47,750 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:13:47,772 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 23:13:47,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:13:47,783 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:13:47,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47 WrapperNode [2025-04-13 23:13:47,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:13:47,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:13:47,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:13:47,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:13:47,789 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:13:47" (1/1) ... [2025-04-13 23:13:47,798 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:13:47" (1/1) ... [2025-04-13 23:13:47,814 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-04-13 23:13:47,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:13:47,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:13:47,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:13:47,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:13:47,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,834 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 23:13:47,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:13:47,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:13:47,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:13:47,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:13:47,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (1/1) ... [2025-04-13 23:13:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:13:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:47,874 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:13:47,875 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:13:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:13:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:13:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:13:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:13:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:13:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:13:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:13:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:13:47,891 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:13:47,971 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:13:47,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:13:48,270 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:13:48,271 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:13:48,271 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:13:48,538 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:13:48,541 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:13:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:13:48 BoogieIcfgContainer [2025-04-13 23:13:48,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:13:48,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:13:48,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:13:48,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:13:48,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:13:47" (1/3) ... [2025-04-13 23:13:48,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1594bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:13:48, skipping insertion in model container [2025-04-13 23:13:48,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:13:47" (2/3) ... [2025-04-13 23:13:48,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1594bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:13:48, skipping insertion in model container [2025-04-13 23:13:48,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:13:48" (3/3) ... [2025-04-13 23:13:48,548 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-04-13 23:13:48,559 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:13:48,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 23:13:48,560 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:13:48,602 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:13:48,626 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 23:13:48,672 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call 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:48,693 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:13:48,701 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;@589426f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:13:48,701 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:13:48,705 INFO L278 IsEmpty]: Start isEmpty. Operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call 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:48,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:13:48,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:48,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:48,715 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:48,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2129961020, now seen corresponding path program 1 times [2025-04-13 23:13:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:48,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572321902] [2025-04-13 23:13:48,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:48,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:13:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:13:48,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:48,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:48,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572321902] [2025-04-13 23:13:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572321902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:13:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637665691] [2025-04-13 23:13:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:48,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:13:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:48,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:13:48,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:13:48,910 INFO L87 Difference]: Start difference. First operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 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 10.0) internal successors, (20), 2 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:13:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:49,003 INFO L93 Difference]: Finished difference Result 464 states and 1650 transitions. [2025-04-13 23:13:49,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:13:49,005 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:13:49,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:49,016 INFO L225 Difference]: With dead ends: 464 [2025-04-13 23:13:49,016 INFO L226 Difference]: Without dead ends: 342 [2025-04-13 23:13:49,019 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:13:49,022 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:49,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-04-13 23:13:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-04-13 23:13:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 3.436950146627566) internal successors, (1172), 341 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call 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:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1172 transitions. [2025-04-13 23:13:49,079 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 1172 transitions. Word has length 20 [2025-04-13 23:13:49,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:49,080 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 1172 transitions. [2025-04-13 23:13:49,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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:13:49,080 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 1172 transitions. [2025-04-13 23:13:49,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:13:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:49,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:49,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:13:49,082 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:49,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -786990238, now seen corresponding path program 1 times [2025-04-13 23:13:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:49,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279495385] [2025-04-13 23:13:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:49,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:13:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:13:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:49,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:49,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279495385] [2025-04-13 23:13:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279495385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901318851] [2025-04-13 23:13:49,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:49,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:49,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:49,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:49,359 INFO L87 Difference]: Start difference. First operand 342 states and 1172 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:49,475 INFO L93 Difference]: Finished difference Result 738 states and 2533 transitions. [2025-04-13 23:13:49,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:49,475 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:13:49,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:49,480 INFO L225 Difference]: With dead ends: 738 [2025-04-13 23:13:49,480 INFO L226 Difference]: Without dead ends: 343 [2025-04-13 23:13:49,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:13:49,481 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:49,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-13 23:13:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-04-13 23:13:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 3.4298245614035086) internal successors, (1173), 342 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call 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:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1173 transitions. [2025-04-13 23:13:49,505 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 1173 transitions. Word has length 23 [2025-04-13 23:13:49,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:49,506 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 1173 transitions. [2025-04-13 23:13:49,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,506 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 1173 transitions. [2025-04-13 23:13:49,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:49,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:49,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:49,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:13:49,510 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:49,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -787241487, now seen corresponding path program 1 times [2025-04-13 23:13:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:49,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753722241] [2025-04-13 23:13:49,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:13:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:13:49,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:49,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753722241] [2025-04-13 23:13:49,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753722241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:49,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:49,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:13:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825070181] [2025-04-13 23:13:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:49,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:13:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:49,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:13:49,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:13:49,618 INFO L87 Difference]: Start difference. First operand 343 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:49,682 INFO L93 Difference]: Finished difference Result 619 states and 2099 transitions. [2025-04-13 23:13:49,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:13:49,682 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:13:49,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:49,685 INFO L225 Difference]: With dead ends: 619 [2025-04-13 23:13:49,685 INFO L226 Difference]: Without dead ends: 357 [2025-04-13 23:13:49,687 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:13:49,687 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:49,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-13 23:13:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-04-13 23:13:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.24438202247191) internal successors, (1155), 356 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call 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:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1155 transitions. [2025-04-13 23:13:49,725 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 1155 transitions. Word has length 24 [2025-04-13 23:13:49,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:49,725 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 1155 transitions. [2025-04-13 23:13:49,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,725 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 1155 transitions. [2025-04-13 23:13:49,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:13:49,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:49,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:49,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:13:49,727 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:49,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1303188883, now seen corresponding path program 2 times [2025-04-13 23:13:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:49,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396170208] [2025-04-13 23:13:49,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:49,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:13:49,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 24 statements. [2025-04-13 23:13:49,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:13:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:49,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396170208] [2025-04-13 23:13:49,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396170208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:49,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209359682] [2025-04-13 23:13:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:49,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:49,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:49,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:49,857 INFO L87 Difference]: Start difference. First operand 357 states and 1155 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:49,943 INFO L93 Difference]: Finished difference Result 798 states and 2596 transitions. [2025-04-13 23:13:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:49,943 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:13:49,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:49,946 INFO L225 Difference]: With dead ends: 798 [2025-04-13 23:13:49,946 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 23:13:49,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:13:49,948 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:49,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 23:13:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-04-13 23:13:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.238095238095238) internal successors, (1156), 357 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call 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:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1156 transitions. [2025-04-13 23:13:49,964 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 1156 transitions. Word has length 24 [2025-04-13 23:13:49,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:49,964 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 1156 transitions. [2025-04-13 23:13:49,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:49,965 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 1156 transitions. [2025-04-13 23:13:49,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:49,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:49,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:13:49,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:49,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1662690063, now seen corresponding path program 1 times [2025-04-13 23:13:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:49,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40560863] [2025-04-13 23:13:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:49,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:13:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:49,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:50,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40560863] [2025-04-13 23:13:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40560863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:13:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096231056] [2025-04-13 23:13:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:50,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:13:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:50,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:13:50,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:13:50,025 INFO L87 Difference]: Start difference. First operand 358 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:50,079 INFO L93 Difference]: Finished difference Result 582 states and 1910 transitions. [2025-04-13 23:13:50,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:13:50,080 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-04-13 23:13:50,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:50,083 INFO L225 Difference]: With dead ends: 582 [2025-04-13 23:13:50,083 INFO L226 Difference]: Without dead ends: 376 [2025-04-13 23:13:50,083 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:13:50,084 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:50,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:13:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-04-13 23:13:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-04-13 23:13:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 3.112) internal successors, (1167), 375 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call 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:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1167 transitions. [2025-04-13 23:13:50,113 INFO L79 Accepts]: Start accepts. Automaton has 376 states and 1167 transitions. Word has length 25 [2025-04-13 23:13:50,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:50,113 INFO L485 AbstractCegarLoop]: Abstraction has 376 states and 1167 transitions. [2025-04-13 23:13:50,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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:50,114 INFO L278 IsEmpty]: Start isEmpty. Operand 376 states and 1167 transitions. [2025-04-13 23:13:50,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:50,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:50,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:50,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:13:50,115 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:50,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1643697483, now seen corresponding path program 2 times [2025-04-13 23:13:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:50,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675898197] [2025-04-13 23:13:50,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:50,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:50,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:13:50,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:13:50,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:50,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675898197] [2025-04-13 23:13:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675898197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:13:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828470405] [2025-04-13 23:13:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:50,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:50,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:50,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:50,282 INFO L87 Difference]: Start difference. First operand 376 states and 1167 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:50,409 INFO L93 Difference]: Finished difference Result 661 states and 2032 transitions. [2025-04-13 23:13:50,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:13:50,409 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-04-13 23:13:50,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:50,414 INFO L225 Difference]: With dead ends: 661 [2025-04-13 23:13:50,415 INFO L226 Difference]: Without dead ends: 638 [2025-04-13 23:13:50,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:50,416 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:50,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-04-13 23:13:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 501. [2025-04-13 23:13:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 3.008) internal successors, (1504), 500 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call 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:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1504 transitions. [2025-04-13 23:13:50,451 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1504 transitions. Word has length 25 [2025-04-13 23:13:50,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:50,451 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1504 transitions. [2025-04-13 23:13:50,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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:50,451 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1504 transitions. [2025-04-13 23:13:50,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:13:50,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:50,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:50,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:13:50,453 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:50,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2128809193, now seen corresponding path program 1 times [2025-04-13 23:13:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:50,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831214119] [2025-04-13 23:13:50,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:13:50,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:13:50,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:50,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:50,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831214119] [2025-04-13 23:13:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831214119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:50,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250065223] [2025-04-13 23:13:50,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:50,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:50,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:50,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:50,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:13:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:13:50,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:13:50,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:50,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:50,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:13:50,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:50,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250065223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:50,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:13:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999137368] [2025-04-13 23:13:50,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:50,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:13:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:50,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:13:50,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:13:50,972 INFO L87 Difference]: Start difference. First operand 501 states and 1504 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 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:13:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:51,163 INFO L93 Difference]: Finished difference Result 1245 states and 3836 transitions. [2025-04-13 23:13:51,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:13:51,163 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 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 27 [2025-04-13 23:13:51,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:51,168 INFO L225 Difference]: With dead ends: 1245 [2025-04-13 23:13:51,168 INFO L226 Difference]: Without dead ends: 723 [2025-04-13 23:13:51,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:13:51,170 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:51,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-04-13 23:13:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 519. [2025-04-13 23:13:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.9806949806949805) internal successors, (1544), 518 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call 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:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1544 transitions. [2025-04-13 23:13:51,199 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1544 transitions. Word has length 27 [2025-04-13 23:13:51,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:51,199 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1544 transitions. [2025-04-13 23:13:51,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 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:13:51,199 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1544 transitions. [2025-04-13 23:13:51,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:13:51,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:51,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:51,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:13:51,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:51,402 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:51,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 953505879, now seen corresponding path program 1 times [2025-04-13 23:13:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:51,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807638888] [2025-04-13 23:13:51,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:51,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:13:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:13:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:13:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:51,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807638888] [2025-04-13 23:13:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807638888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:51,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:13:51,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860863190] [2025-04-13 23:13:51,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:51,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:51,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:51,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:51,497 INFO L87 Difference]: Start difference. First operand 519 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:51,593 INFO L93 Difference]: Finished difference Result 1115 states and 3498 transitions. [2025-04-13 23:13:51,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:51,593 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:13:51,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:51,599 INFO L225 Difference]: With dead ends: 1115 [2025-04-13 23:13:51,599 INFO L226 Difference]: Without dead ends: 944 [2025-04-13 23:13:51,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:13:51,601 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:51,601 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-04-13 23:13:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 828. [2025-04-13 23:13:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 3.158403869407497) internal successors, (2612), 827 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call 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:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2612 transitions. [2025-04-13 23:13:51,633 INFO L79 Accepts]: Start accepts. Automaton has 828 states and 2612 transitions. Word has length 27 [2025-04-13 23:13:51,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:51,633 INFO L485 AbstractCegarLoop]: Abstraction has 828 states and 2612 transitions. [2025-04-13 23:13:51,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:51,634 INFO L278 IsEmpty]: Start isEmpty. Operand 828 states and 2612 transitions. [2025-04-13 23:13:51,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:13:51,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:51,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:51,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:13:51,636 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:51,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1772348578, now seen corresponding path program 2 times [2025-04-13 23:13:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:51,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206285375] [2025-04-13 23:13:51,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:51,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:13:51,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-13 23:13:51,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:13:51,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:13:51,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:51,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206285375] [2025-04-13 23:13:51,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206285375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:51,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:51,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:13:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230694911] [2025-04-13 23:13:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:51,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:13:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:51,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:13:51,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:13:51,796 INFO L87 Difference]: Start difference. First operand 828 states and 2612 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:51,973 INFO L93 Difference]: Finished difference Result 932 states and 2917 transitions. [2025-04-13 23:13:51,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:13:51,974 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:13:51,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:51,979 INFO L225 Difference]: With dead ends: 932 [2025-04-13 23:13:51,979 INFO L226 Difference]: Without dead ends: 872 [2025-04-13 23:13:51,979 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:13:51,981 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:51,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-04-13 23:13:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 861. [2025-04-13 23:13:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 3.1511627906976742) internal successors, (2710), 860 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call 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:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2710 transitions. [2025-04-13 23:13:52,019 INFO L79 Accepts]: Start accepts. Automaton has 861 states and 2710 transitions. Word has length 28 [2025-04-13 23:13:52,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:52,019 INFO L485 AbstractCegarLoop]: Abstraction has 861 states and 2710 transitions. [2025-04-13 23:13:52,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:52,019 INFO L278 IsEmpty]: Start isEmpty. Operand 861 states and 2710 transitions. [2025-04-13 23:13:52,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:13:52,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:52,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:52,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:13:52,022 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:52,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -470000315, now seen corresponding path program 1 times [2025-04-13 23:13:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:52,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798694956] [2025-04-13 23:13:52,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:13:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:52,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:52,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798694956] [2025-04-13 23:13:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798694956] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:52,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889684452] [2025-04-13 23:13:52,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:52,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:52,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:52,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:13:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 23:13:52,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:13:52,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:52,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 23:13:52,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:13:52,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:13:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889684452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:13:52,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-13 23:13:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433846082] [2025-04-13 23:13:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:52,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:13:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:52,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:13:52,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:13:52,279 INFO L87 Difference]: Start difference. First operand 861 states and 2710 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:52,427 INFO L93 Difference]: Finished difference Result 2303 states and 7685 transitions. [2025-04-13 23:13:52,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:13:52,427 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 23:13:52,427 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:52,437 INFO L225 Difference]: With dead ends: 2303 [2025-04-13 23:13:52,437 INFO L226 Difference]: Without dead ends: 1609 [2025-04-13 23:13:52,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 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:13:52,439 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:52,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-04-13 23:13:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1417. [2025-04-13 23:13:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 3.444915254237288) internal successors, (4878), 1416 states have internal predecessors, (4878), 0 states have call successors, (0), 0 states have call 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:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 4878 transitions. [2025-04-13 23:13:52,500 INFO L79 Accepts]: Start accepts. Automaton has 1417 states and 4878 transitions. Word has length 30 [2025-04-13 23:13:52,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:52,500 INFO L485 AbstractCegarLoop]: Abstraction has 1417 states and 4878 transitions. [2025-04-13 23:13:52,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:52,500 INFO L278 IsEmpty]: Start isEmpty. Operand 1417 states and 4878 transitions. [2025-04-13 23:13:52,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 23:13:52,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:52,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:52,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:52,708 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,SelfDestructingSolverStorable9 [2025-04-13 23:13:52,708 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:52,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash -559209394, now seen corresponding path program 1 times [2025-04-13 23:13:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:52,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349140419] [2025-04-13 23:13:52,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 23:13:52,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:13:52,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:52,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:52,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:52,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349140419] [2025-04-13 23:13:52,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349140419] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:52,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058750488] [2025-04-13 23:13:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:13:52,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:52,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:52,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:52,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:13:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 23:13:52,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:13:52,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:52,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:52,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:13:52,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:52,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058750488] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:53,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:13:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487553727] [2025-04-13 23:13:53,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:53,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:13:53,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:53,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:13:53,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:13:53,102 INFO L87 Difference]: Start difference. First operand 1417 states and 4878 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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:13:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:53,322 INFO L93 Difference]: Finished difference Result 3101 states and 10588 transitions. [2025-04-13 23:13:53,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:13:53,323 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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 31 [2025-04-13 23:13:53,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:53,332 INFO L225 Difference]: With dead ends: 3101 [2025-04-13 23:13:53,332 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 23:13:53,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:13:53,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:53,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:13:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 23:13:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2025-04-13 23:13:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 3.4431898376852503) internal successors, (4879), 1417 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call 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:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4879 transitions. [2025-04-13 23:13:53,391 INFO L79 Accepts]: Start accepts. Automaton has 1418 states and 4879 transitions. Word has length 31 [2025-04-13 23:13:53,391 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:53,391 INFO L485 AbstractCegarLoop]: Abstraction has 1418 states and 4879 transitions. [2025-04-13 23:13:53,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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:13:53,391 INFO L278 IsEmpty]: Start isEmpty. Operand 1418 states and 4879 transitions. [2025-04-13 23:13:53,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:53,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:53,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:53,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:13:53,595 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:13:53,595 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:53,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -832761896, now seen corresponding path program 2 times [2025-04-13 23:13:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:53,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056516401] [2025-04-13 23:13:53,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:53,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:53,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:53,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:53,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:54,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056516401] [2025-04-13 23:13:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056516401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:54,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954225181] [2025-04-13 23:13:54,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:54,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:54,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:54,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:13:54,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:54,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:13:54,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:54,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:13:54,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:54,307 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 16 treesize of output 8 [2025-04-13 23:13:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:54,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:54,408 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:13:54,408 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 11 [2025-04-13 23:13:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954225181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:54,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:54,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-04-13 23:13:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448005512] [2025-04-13 23:13:54,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:54,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:13:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:54,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:13:54,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:13:54,622 INFO L87 Difference]: Start difference. First operand 1418 states and 4879 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call 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:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:56,529 INFO L93 Difference]: Finished difference Result 5671 states and 20117 transitions. [2025-04-13 23:13:56,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 23:13:56,530 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:13:56,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:56,559 INFO L225 Difference]: With dead ends: 5671 [2025-04-13 23:13:56,560 INFO L226 Difference]: Without dead ends: 5563 [2025-04-13 23:13:56,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=537, Invalid=3003, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 23:13:56,562 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 492 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:56,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 0 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:13:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2025-04-13 23:13:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 3498. [2025-04-13 23:13:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 3.601086645696311) internal successors, (12593), 3497 states have internal predecessors, (12593), 0 states have call successors, (0), 0 states have call 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:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 12593 transitions. [2025-04-13 23:13:56,809 INFO L79 Accepts]: Start accepts. Automaton has 3498 states and 12593 transitions. Word has length 32 [2025-04-13 23:13:56,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:56,810 INFO L485 AbstractCegarLoop]: Abstraction has 3498 states and 12593 transitions. [2025-04-13 23:13:56,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call 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:56,810 INFO L278 IsEmpty]: Start isEmpty. Operand 3498 states and 12593 transitions. [2025-04-13 23:13:56,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:13:56,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:56,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:56,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:57,017 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:13:57,018 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:57,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1342813120, now seen corresponding path program 3 times [2025-04-13 23:13:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:57,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281381365] [2025-04-13 23:13:57,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:57,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:13:57,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 23:13:57,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:13:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:57,177 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:13:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:57,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281381365] [2025-04-13 23:13:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281381365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:13:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:13:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:13:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665172326] [2025-04-13 23:13:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:13:57,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:13:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:57,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:13:57,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:13:57,179 INFO L87 Difference]: Start difference. First operand 3498 states and 12593 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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:13:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:57,573 INFO L93 Difference]: Finished difference Result 4397 states and 16042 transitions. [2025-04-13 23:13:57,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:13:57,573 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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 32 [2025-04-13 23:13:57,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:57,599 INFO L225 Difference]: With dead ends: 4397 [2025-04-13 23:13:57,599 INFO L226 Difference]: Without dead ends: 4261 [2025-04-13 23:13:57,601 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:13:57,601 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:57,601 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:13:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2025-04-13 23:13:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 3498. [2025-04-13 23:13:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 3.553903345724907) internal successors, (12428), 3497 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call 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:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 12428 transitions. [2025-04-13 23:13:57,879 INFO L79 Accepts]: Start accepts. Automaton has 3498 states and 12428 transitions. Word has length 32 [2025-04-13 23:13:57,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:57,880 INFO L485 AbstractCegarLoop]: Abstraction has 3498 states and 12428 transitions. [2025-04-13 23:13:57,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 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:13:57,880 INFO L278 IsEmpty]: Start isEmpty. Operand 3498 states and 12428 transitions. [2025-04-13 23:13:57,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:13:57,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:57,887 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:57,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:13:57,887 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:57,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -163165508, now seen corresponding path program 4 times [2025-04-13 23:13:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:57,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225841402] [2025-04-13 23:13:57,888 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:57,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:13:57,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:13:57,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:57,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:59,208 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:13:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:59,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225841402] [2025-04-13 23:13:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225841402] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:59,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795065537] [2025-04-13 23:13:59,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:59,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:59,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:59,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:59,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:13:59,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:13:59,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:13:59,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:59,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 23:13:59,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:13:59,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:59,824 INFO L325 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-04-13 23:13:59,824 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 45 treesize of output 82 [2025-04-13 23:13:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:13:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795065537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:59,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 6] total 29 [2025-04-13 23:13:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590369542] [2025-04-13 23:13:59,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:59,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:13:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:59,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:13:59,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:13:59,904 INFO L87 Difference]: Start difference. First operand 3498 states and 12428 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call 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:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:02,200 INFO L93 Difference]: Finished difference Result 10259 states and 36486 transitions. [2025-04-13 23:14:02,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 23:14:02,200 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 23:14:02,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:02,243 INFO L225 Difference]: With dead ends: 10259 [2025-04-13 23:14:02,243 INFO L226 Difference]: Without dead ends: 10151 [2025-04-13 23:14:02,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=2056, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 23:14:02,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 331 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:02,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 0 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:14:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10151 states. [2025-04-13 23:14:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10151 to 3457. [2025-04-13 23:14:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3457 states, 3456 states have (on average 3.5691550925925926) internal successors, (12335), 3456 states have internal predecessors, (12335), 0 states have call successors, (0), 0 states have call 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:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 12335 transitions. [2025-04-13 23:14:02,561 INFO L79 Accepts]: Start accepts. Automaton has 3457 states and 12335 transitions. Word has length 33 [2025-04-13 23:14:02,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:02,561 INFO L485 AbstractCegarLoop]: Abstraction has 3457 states and 12335 transitions. [2025-04-13 23:14:02,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call 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:02,562 INFO L278 IsEmpty]: Start isEmpty. Operand 3457 states and 12335 transitions. [2025-04-13 23:14:02,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:14:02,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:02,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:14:02,576 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:14:02,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:14:02,772 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:14:02,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash 708390960, now seen corresponding path program 1 times [2025-04-13 23:14:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:02,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105727425] [2025-04-13 23:14:02,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:14:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:02,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 23:14:02,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:02,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:14:02,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:03,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105727425] [2025-04-13 23:14:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105727425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:03,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856908164] [2025-04-13 23:14:03,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:14:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:03,767 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:14:03,768 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:14:03,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 23:14:03,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:03,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:14:03,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:03,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 23:14:03,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:14:04,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:08,224 WARN L849 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (= c_~N~0 (+ c_~t~0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))))))) is different from false [2025-04-13 23:14:08,315 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:14:08,315 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 87 [2025-04-13 23:14:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2025-04-13 23:14:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856908164] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:08,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:08,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 8] total 32 [2025-04-13 23:14:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235253481] [2025-04-13 23:14:08,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:08,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:14:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:08,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:14:08,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=976, Unknown=1, NotChecked=62, Total=1122 [2025-04-13 23:14:08,445 INFO L87 Difference]: Start difference. First operand 3457 states and 12335 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:14:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:10,567 INFO L93 Difference]: Finished difference Result 5039 states and 17044 transitions. [2025-04-13 23:14:10,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:14:10,567 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:14:10,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:10,582 INFO L225 Difference]: With dead ends: 5039 [2025-04-13 23:14:10,583 INFO L226 Difference]: Without dead ends: 4842 [2025-04-13 23:14:10,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=182, Invalid=2173, Unknown=1, NotChecked=94, Total=2450 [2025-04-13 23:14:10,585 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:10,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2651 Invalid, 0 Unknown, 211 Unchecked, 1.1s Time] [2025-04-13 23:14:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2025-04-13 23:14:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 3886. [2025-04-13 23:14:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3885 states have (on average 3.480823680823681) internal successors, (13523), 3885 states have internal predecessors, (13523), 0 states have call successors, (0), 0 states have call 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:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 13523 transitions. [2025-04-13 23:14:10,860 INFO L79 Accepts]: Start accepts. Automaton has 3886 states and 13523 transitions. Word has length 34 [2025-04-13 23:14:10,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:10,860 INFO L485 AbstractCegarLoop]: Abstraction has 3886 states and 13523 transitions. [2025-04-13 23:14:10,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:14:10,861 INFO L278 IsEmpty]: Start isEmpty. Operand 3886 states and 13523 transitions. [2025-04-13 23:14:10,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:14:10,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:10,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:14:10,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:14:11,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:14:11,068 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:14:11,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1879924366, now seen corresponding path program 2 times [2025-04-13 23:14:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:11,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978837933] [2025-04-13 23:14:11,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:14:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:11,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:11,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:11,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:14:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:11,983 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:14:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:11,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978837933] [2025-04-13 23:14:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978837933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:11,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546219230] [2025-04-13 23:14:11,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:14:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:11,985 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:14:11,986 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:14:12,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:12,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:12,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:14:12,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:12,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:14:12,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:12,479 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-13 23:14:12,479 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 7 [2025-04-13 23:14:12,601 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:14:12,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:12,964 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:14:12,964 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 87 [2025-04-13 23:14:13,318 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:14:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546219230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:13,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2025-04-13 23:14:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800815760] [2025-04-13 23:14:13,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:13,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 23:14:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:13,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 23:14:13,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1786, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:14:13,319 INFO L87 Difference]: Start difference. First operand 3886 states and 13523 transitions. Second operand has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:20,067 INFO L93 Difference]: Finished difference Result 13400 states and 47470 transitions. [2025-04-13 23:14:20,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:14:20,067 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:14:20,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:20,110 INFO L225 Difference]: With dead ends: 13400 [2025-04-13 23:14:20,110 INFO L226 Difference]: Without dead ends: 12665 [2025-04-13 23:14:20,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1168, Invalid=9752, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 23:14:20,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 972 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:20,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 0 Invalid, 5772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 23:14:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2025-04-13 23:14:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 4980. [2025-04-13 23:14:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4980 states, 4979 states have (on average 3.5900783289817233) internal successors, (17875), 4979 states have internal predecessors, (17875), 0 states have call successors, (0), 0 states have call 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:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 17875 transitions. [2025-04-13 23:14:20,678 INFO L79 Accepts]: Start accepts. Automaton has 4980 states and 17875 transitions. Word has length 34 [2025-04-13 23:14:20,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:20,678 INFO L485 AbstractCegarLoop]: Abstraction has 4980 states and 17875 transitions. [2025-04-13 23:14:20,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:20,678 INFO L278 IsEmpty]: Start isEmpty. Operand 4980 states and 17875 transitions. [2025-04-13 23:14:20,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:14:20,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:20,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:14:20,692 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:14:20,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:20,887 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:14:20,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2013303794, now seen corresponding path program 3 times [2025-04-13 23:14:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:20,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998676840] [2025-04-13 23:14:20,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:14:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:20,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:20,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:20,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:14:20,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:14:21,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:21,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998676840] [2025-04-13 23:14:21,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998676840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:21,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139771551] [2025-04-13 23:14:21,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:14:21,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:21,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:21,764 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:14:21,766 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:14:21,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:21,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:21,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:14:21,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:21,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:14:21,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:14:22,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:26,375 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:14:26,375 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 87 [2025-04-13 23:14:26,473 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:14:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139771551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:26,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 8] total 33 [2025-04-13 23:14:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619673469] [2025-04-13 23:14:26,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:26,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:14:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:26,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:14:26,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1098, Unknown=1, NotChecked=0, Total=1190 [2025-04-13 23:14:26,474 INFO L87 Difference]: Start difference. First operand 4980 states and 17875 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:14:30,929 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 [1] [2025-04-13 23:14:34,997 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 [1] [2025-04-13 23:14:39,020 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 [1] [2025-04-13 23:14:43,537 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:14:47,555 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:14:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:14:48,684 INFO L93 Difference]: Finished difference Result 5291 states and 18657 transitions. [2025-04-13 23:14:48,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:14:48,685 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:14:48,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:14:48,702 INFO L225 Difference]: With dead ends: 5291 [2025-04-13 23:14:48,702 INFO L226 Difference]: Without dead ends: 5214 [2025-04-13 23:14:48,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=193, Invalid=2356, Unknown=1, NotChecked=0, Total=2550 [2025-04-13 23:14:48,705 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:14:48,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2425 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2025-04-13 23:14:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2025-04-13 23:14:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 4813. [2025-04-13 23:14:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 4812 states have (on average 3.6246882793017456) internal successors, (17442), 4812 states have internal predecessors, (17442), 0 states have call successors, (0), 0 states have call 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:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 17442 transitions. [2025-04-13 23:14:49,180 INFO L79 Accepts]: Start accepts. Automaton has 4813 states and 17442 transitions. Word has length 34 [2025-04-13 23:14:49,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:14:49,180 INFO L485 AbstractCegarLoop]: Abstraction has 4813 states and 17442 transitions. [2025-04-13 23:14:49,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:14:49,180 INFO L278 IsEmpty]: Start isEmpty. Operand 4813 states and 17442 transitions. [2025-04-13 23:14:49,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:14:49,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:14:49,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:14:49,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:14:49,388 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,SelfDestructingSolverStorable16 [2025-04-13 23:14:49,388 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:14:49,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:14:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash -236804700, now seen corresponding path program 4 times [2025-04-13 23:14:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:14:49,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774117262] [2025-04-13 23:14:49,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:14:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:14:49,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:49,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:49,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:14:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:50,459 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:14:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:14:50,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774117262] [2025-04-13 23:14:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774117262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:14:50,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005212865] [2025-04-13 23:14:50,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:14:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:14:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:14:50,461 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:14:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:14:50,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:14:50,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:14:50,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:14:50,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:14:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:14:50,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:14:51,129 INFO L325 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2025-04-13 23:14:51,129 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 32 treesize of output 39 [2025-04-13 23:14:51,280 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:14:51,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:14:51,662 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:14:51,662 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 87 [2025-04-13 23:14:52,034 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:14:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005212865] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:14:52,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:14:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 13] total 43 [2025-04-13 23:14:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056281432] [2025-04-13 23:14:52,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:14:52,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 23:14:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:14:52,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 23:14:52,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:14:52,036 INFO L87 Difference]: Start difference. First operand 4813 states and 17442 transitions. Second operand has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:02,670 INFO L93 Difference]: Finished difference Result 6646 states and 23416 transitions. [2025-04-13 23:15:02,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 23:15:02,670 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:15:02,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:02,688 INFO L225 Difference]: With dead ends: 6646 [2025-04-13 23:15:02,688 INFO L226 Difference]: Without dead ends: 6517 [2025-04-13 23:15:02,691 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1311, Invalid=8589, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 23:15:02,691 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 907 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4557 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 4557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:02,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 0 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 4557 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:15:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2025-04-13 23:15:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 4832. [2025-04-13 23:15:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4832 states, 4831 states have (on average 3.618298488925688) internal successors, (17480), 4831 states have internal predecessors, (17480), 0 states have call successors, (0), 0 states have call 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:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 17480 transitions. [2025-04-13 23:15:03,204 INFO L79 Accepts]: Start accepts. Automaton has 4832 states and 17480 transitions. Word has length 34 [2025-04-13 23:15:03,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:03,204 INFO L485 AbstractCegarLoop]: Abstraction has 4832 states and 17480 transitions. [2025-04-13 23:15:03,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call 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:03,204 INFO L278 IsEmpty]: Start isEmpty. Operand 4832 states and 17480 transitions. [2025-04-13 23:15:03,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:15:03,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:03,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:03,219 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:15:03,411 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,SelfDestructingSolverStorable17 [2025-04-13 23:15:03,412 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:15:03,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash -584860832, now seen corresponding path program 5 times [2025-04-13 23:15:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:03,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977469365] [2025-04-13 23:15:03,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:15:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:03,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:15:03,435 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:03,435 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:15:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:04,493 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:15:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:04,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977469365] [2025-04-13 23:15:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977469365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:04,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463615954] [2025-04-13 23:15:04,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:15:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:04,495 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:15:04,496 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:15:04,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:15:04,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:04,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:15:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:04,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 23:15:04,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:04,676 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:15:04,711 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:15:05,246 INFO L325 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2025-04-13 23:15:05,246 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 38 treesize of output 36 [2025-04-13 23:15:05,441 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:15:05,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:06,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:15:06,218 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 635 treesize of output 619 [2025-04-13 23:15:06,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:15:06,296 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 148 treesize of output 144 [2025-04-13 23:15:06,449 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:15:06,449 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 781 treesize of output 741 [2025-04-13 23:15:11,635 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:15:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463615954] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:11,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2025-04-13 23:15:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379564264] [2025-04-13 23:15:11,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:11,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 23:15:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 23:15:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2215, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:15:11,637 INFO L87 Difference]: Start difference. First operand 4832 states and 17480 transitions. Second operand has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:20,175 INFO L93 Difference]: Finished difference Result 10099 states and 34257 transitions. [2025-04-13 23:15:20,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 23:15:20,176 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:15:20,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:20,202 INFO L225 Difference]: With dead ends: 10099 [2025-04-13 23:15:20,202 INFO L226 Difference]: Without dead ends: 9886 [2025-04-13 23:15:20,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1652, Invalid=10338, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 23:15:20,207 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 820 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4758 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 4758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:20,207 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 0 Invalid, 5075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 4758 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 23:15:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2025-04-13 23:15:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 5491. [2025-04-13 23:15:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5491 states, 5490 states have (on average 3.6129326047358834) internal successors, (19835), 5490 states have internal predecessors, (19835), 0 states have call successors, (0), 0 states have call 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:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 19835 transitions. [2025-04-13 23:15:21,018 INFO L79 Accepts]: Start accepts. Automaton has 5491 states and 19835 transitions. Word has length 34 [2025-04-13 23:15:21,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:21,019 INFO L485 AbstractCegarLoop]: Abstraction has 5491 states and 19835 transitions. [2025-04-13 23:15:21,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:21,019 INFO L278 IsEmpty]: Start isEmpty. Operand 5491 states and 19835 transitions. [2025-04-13 23:15:21,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:15:21,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:21,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:21,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:15:21,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:21,228 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:15:21,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash -98173720, now seen corresponding path program 6 times [2025-04-13 23:15:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:21,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336999353] [2025-04-13 23:15:21,228 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:15:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:21,234 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:15:21,247 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:21,247 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:15:21,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:22,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336999353] [2025-04-13 23:15:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336999353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:22,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260389200] [2025-04-13 23:15:22,135 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:15:22,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:22,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:22,138 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:15:22,138 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:15:22,194 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:15:22,219 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:22,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:15:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:22,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 23:15:22,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:22,763 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:15:22,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:23,079 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:15:23,079 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 87 [2025-04-13 23:15:23,370 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:15:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260389200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:23,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2025-04-13 23:15:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853317437] [2025-04-13 23:15:23,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:23,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 23:15:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:23,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 23:15:23,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:15:23,372 INFO L87 Difference]: Start difference. First operand 5491 states and 19835 transitions. Second operand has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:29,161 INFO L93 Difference]: Finished difference Result 9628 states and 34129 transitions. [2025-04-13 23:15:29,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 23:15:29,161 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:15:29,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:29,185 INFO L225 Difference]: With dead ends: 9628 [2025-04-13 23:15:29,185 INFO L226 Difference]: Without dead ends: 9476 [2025-04-13 23:15:29,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=778, Invalid=7964, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:15:29,189 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 763 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:29,189 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 0 Invalid, 4007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:15:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2025-04-13 23:15:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 5557. [2025-04-13 23:15:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5557 states, 5556 states have (on average 3.610691144708423) internal successors, (20061), 5556 states have internal predecessors, (20061), 0 states have call successors, (0), 0 states have call 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:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 20061 transitions. [2025-04-13 23:15:30,097 INFO L79 Accepts]: Start accepts. Automaton has 5557 states and 20061 transitions. Word has length 34 [2025-04-13 23:15:30,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:30,097 INFO L485 AbstractCegarLoop]: Abstraction has 5557 states and 20061 transitions. [2025-04-13 23:15:30,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call 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:30,098 INFO L278 IsEmpty]: Start isEmpty. Operand 5557 states and 20061 transitions. [2025-04-13 23:15:30,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:15:30,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:30,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:30,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 23:15:30,308 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:15:30,309 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:15:30,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 655759992, now seen corresponding path program 7 times [2025-04-13 23:15:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:30,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855409138] [2025-04-13 23:15:30,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:15:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 23:15:30,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:30,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:31,202 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:15:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:31,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855409138] [2025-04-13 23:15:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855409138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:31,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277159440] [2025-04-13 23:15:31,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:15:31,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:31,204 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:15:31,205 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:15:31,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 23:15:31,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:15:31,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:31,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:31,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 23:15:31,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:15:31,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:43,795 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:15:43,796 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 87 [2025-04-13 23:15:43,896 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:15:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277159440] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:43,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:43,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 8] total 32 [2025-04-13 23:15:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048965592] [2025-04-13 23:15:43,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:43,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:15:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:43,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:15:43,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1034, Unknown=3, NotChecked=0, Total=1122 [2025-04-13 23:15:43,897 INFO L87 Difference]: Start difference. First operand 5557 states and 20061 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:48,345 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 [1] [2025-04-13 23:15:52,357 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:15:56,366 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:16:00,426 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:16:04,431 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:16:08,439 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:16:12,444 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:16:16,861 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 [1] [2025-04-13 23:16:20,874 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 [1] [2025-04-13 23:16:24,882 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:16:28,887 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:16:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:30,263 INFO L93 Difference]: Finished difference Result 5816 states and 20707 transitions. [2025-04-13 23:16:30,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 23:16:30,264 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:16:30,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:30,280 INFO L225 Difference]: With dead ends: 5816 [2025-04-13 23:16:30,280 INFO L226 Difference]: Without dead ends: 5649 [2025-04-13 23:16:30,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=187, Invalid=2260, Unknown=3, NotChecked=0, Total=2450 [2025-04-13 23:16:30,282 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 17 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:30,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2085 Invalid, 11 Unknown, 0 Unchecked, 44.9s Time] [2025-04-13 23:16:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2025-04-13 23:16:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5538. [2025-04-13 23:16:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5538 states, 5537 states have (on average 3.6113418818854974) internal successors, (19996), 5537 states have internal predecessors, (19996), 0 states have call successors, (0), 0 states have call 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:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 19996 transitions. [2025-04-13 23:16:31,056 INFO L79 Accepts]: Start accepts. Automaton has 5538 states and 19996 transitions. Word has length 34 [2025-04-13 23:16:31,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:31,056 INFO L485 AbstractCegarLoop]: Abstraction has 5538 states and 19996 transitions. [2025-04-13 23:16:31,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:31,057 INFO L278 IsEmpty]: Start isEmpty. Operand 5538 states and 19996 transitions. [2025-04-13 23:16:31,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 23:16:31,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:31,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:31,070 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:16:31,265 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:16:31,265 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:16:31,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1103388878, now seen corresponding path program 8 times [2025-04-13 23:16:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:31,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134662595] [2025-04-13 23:16:31,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:31,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:16:31,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:16:31,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:31,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:32,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134662595] [2025-04-13 23:16:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134662595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:32,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522768191] [2025-04-13 23:16:32,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:32,283 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:16:32,283 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:16:32,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 23:16:32,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 23:16:32,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:32,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:32,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-13 23:16:32,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:32,511 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:16:32,555 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:16:33,097 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 23:16:33,098 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 7 [2025-04-13 23:16:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:33,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:34,204 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:34,205 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 381 treesize of output 375 [2025-04-13 23:16:34,221 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:34,221 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 148 treesize of output 144 [2025-04-13 23:16:34,386 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:34,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 525 treesize of output 533 [2025-04-13 23:16:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522768191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:39,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2025-04-13 23:16:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867380936] [2025-04-13 23:16:39,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:39,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 23:16:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:39,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 23:16:39,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2222, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 23:16:39,099 INFO L87 Difference]: Start difference. First operand 5538 states and 19996 transitions. Second operand has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:05,379 INFO L93 Difference]: Finished difference Result 28711 states and 102394 transitions. [2025-04-13 23:17:05,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-04-13 23:17:05,380 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 23:17:05,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:05,458 INFO L225 Difference]: With dead ends: 28711 [2025-04-13 23:17:05,458 INFO L226 Difference]: Without dead ends: 27499 [2025-04-13 23:17:05,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18542 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=5617, Invalid=45685, Unknown=0, NotChecked=0, Total=51302 [2025-04-13 23:17:05,469 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1050 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6829 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 6829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:05,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 0 Invalid, 7473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 6829 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 23:17:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27499 states. [2025-04-13 23:17:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27499 to 7130. [2025-04-13 23:17:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7130 states, 7129 states have (on average 3.78257820171132) internal successors, (26966), 7129 states have internal predecessors, (26966), 0 states have call successors, (0), 0 states have call 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:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 26966 transitions. [2025-04-13 23:17:07,266 INFO L79 Accepts]: Start accepts. Automaton has 7130 states and 26966 transitions. Word has length 34 [2025-04-13 23:17:07,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:07,267 INFO L485 AbstractCegarLoop]: Abstraction has 7130 states and 26966 transitions. [2025-04-13 23:17:07,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 50 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:07,267 INFO L278 IsEmpty]: Start isEmpty. Operand 7130 states and 26966 transitions. [2025-04-13 23:17:07,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 23:17:07,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:07,279 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:07,285 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:17:07,479 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,SelfDestructingSolverStorable21 [2025-04-13 23:17:07,479 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:07,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2102383816, now seen corresponding path program 9 times [2025-04-13 23:17:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:07,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680355140] [2025-04-13 23:17:07,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:07,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 23:17:07,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 23:17:07,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:07,883 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:17:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:07,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680355140] [2025-04-13 23:17:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680355140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:07,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556838388] [2025-04-13 23:17:07,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:07,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:07,885 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:17:07,886 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:17:07,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 23:17:07,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 23:17:07,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:07,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:07,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:17:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:17:08,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:16,422 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:17:16,423 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 87 [2025-04-13 23:17:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:17:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556838388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:16,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2025-04-13 23:17:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860801853] [2025-04-13 23:17:16,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:16,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:17:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:16,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:17:16,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=733, Unknown=2, NotChecked=0, Total=812 [2025-04-13 23:17:16,520 INFO L87 Difference]: Start difference. First operand 7130 states and 26966 transitions. Second operand has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:20,852 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:17:24,862 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:17:28,872 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:17:32,938 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 [1] [2025-04-13 23:17:36,947 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:17:40,957 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:17:45,499 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:17:49,507 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:17:53,516 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 [1] [2025-04-13 23:17:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:55,803 INFO L93 Difference]: Finished difference Result 7523 states and 27975 transitions. [2025-04-13 23:17:55,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:17:55,803 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 23:17:55,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:55,825 INFO L225 Difference]: With dead ends: 7523 [2025-04-13 23:17:55,825 INFO L226 Difference]: Without dead ends: 7458 [2025-04-13 23:17:55,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=144, Invalid=1414, Unknown=2, NotChecked=0, Total=1560 [2025-04-13 23:17:55,827 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:55,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2145 Invalid, 9 Unknown, 0 Unchecked, 36.9s Time] [2025-04-13 23:17:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2025-04-13 23:17:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 7045. [2025-04-13 23:17:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7044 states have (on average 3.7967064168086315) internal successors, (26744), 7044 states have internal predecessors, (26744), 0 states have call successors, (0), 0 states have call 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:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 26744 transitions. [2025-04-13 23:17:57,278 INFO L79 Accepts]: Start accepts. Automaton has 7045 states and 26744 transitions. Word has length 35 [2025-04-13 23:17:57,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:57,278 INFO L485 AbstractCegarLoop]: Abstraction has 7045 states and 26744 transitions. [2025-04-13 23:17:57,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:57,278 INFO L278 IsEmpty]: Start isEmpty. Operand 7045 states and 26744 transitions. [2025-04-13 23:17:57,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 23:17:57,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:57,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:57,296 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:17:57,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:57,491 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:57,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -702998821, now seen corresponding path program 10 times [2025-04-13 23:17:57,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:57,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366515242] [2025-04-13 23:17:57,491 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:57,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:17:57,504 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:17:57,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:57,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 23:17:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:57,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366515242] [2025-04-13 23:17:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366515242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:57,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392468571] [2025-04-13 23:17:57,709 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:57,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:57,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:57,711 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:17:57,712 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:17:57,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:17:57,800 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:17:57,800 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:57,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 23:17:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:17:58,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:14,301 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 23:18:14,302 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 87 [2025-04-13 23:18:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 23:18:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392468571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:14,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 26 [2025-04-13 23:18:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282588589] [2025-04-13 23:18:14,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:14,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:18:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:14,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:18:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=665, Unknown=4, NotChecked=0, Total=756 [2025-04-13 23:18:14,388 INFO L87 Difference]: Start difference. First operand 7045 states and 26744 transitions. Second operand has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:18,496 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:18:22,511 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:18:26,546 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:18:30,554 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:18:34,569 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 [1] [2025-04-13 23:18:38,573 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:18:42,578 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:18:46,837 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 [1] [2025-04-13 23:18:50,844 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:18:54,849 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:18:58,853 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:19:02,861 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 [1] [2025-04-13 23:19:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:05,239 INFO L93 Difference]: Finished difference Result 7392 states and 27709 transitions. [2025-04-13 23:19:05,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:19:05,239 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 23:19:05,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:05,262 INFO L225 Difference]: With dead ends: 7392 [2025-04-13 23:19:05,262 INFO L226 Difference]: Without dead ends: 7338 [2025-04-13 23:19:05,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=100, Invalid=766, Unknown=4, NotChecked=0, Total=870 [2025-04-13 23:19:05,265 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 7 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:05,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1121 Invalid, 12 Unknown, 0 Unchecked, 48.5s Time] [2025-04-13 23:19:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2025-04-13 23:19:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 6902. [2025-04-13 23:19:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 6901 states have (on average 3.8119113172004058) internal successors, (26306), 6901 states have internal predecessors, (26306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 26306 transitions. [2025-04-13 23:19:06,691 INFO L79 Accepts]: Start accepts. Automaton has 6902 states and 26306 transitions. Word has length 36 [2025-04-13 23:19:06,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:06,691 INFO L485 AbstractCegarLoop]: Abstraction has 6902 states and 26306 transitions. [2025-04-13 23:19:06,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:06,691 INFO L278 IsEmpty]: Start isEmpty. Operand 6902 states and 26306 transitions. [2025-04-13 23:19:06,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 23:19:06,702 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:06,702 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:06,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 23:19:06,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:06,903 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:06,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1491564886, now seen corresponding path program 11 times [2025-04-13 23:19:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:06,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417362831] [2025-04-13 23:19:06,903 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:19:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:06,908 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-04-13 23:19:06,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:19:06,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:19:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:19:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:06,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417362831] [2025-04-13 23:19:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417362831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:06,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882623153] [2025-04-13 23:19:06,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:19:06,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:06,981 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:19:06,983 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:19:07,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-04-13 23:19:07,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:19:07,067 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:19:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:07,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:19:07,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:19:07,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:19:07,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882623153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:07,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:07,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 23:19:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307697539] [2025-04-13 23:19:07,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:07,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:19:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:07,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:19:07,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:19:07,247 INFO L87 Difference]: Start difference. First operand 6902 states and 26306 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:10,289 INFO L93 Difference]: Finished difference Result 11816 states and 44840 transitions. [2025-04-13 23:19:10,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:19:10,290 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 23:19:10,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:10,309 INFO L225 Difference]: With dead ends: 11816 [2025-04-13 23:19:10,310 INFO L226 Difference]: Without dead ends: 6406 [2025-04-13 23:19:10,317 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:19:10,317 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:10,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:19:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2025-04-13 23:19:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 4891. [2025-04-13 23:19:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4890 states have (on average 3.431083844580777) internal successors, (16778), 4890 states have internal predecessors, (16778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 16778 transitions. [2025-04-13 23:19:11,458 INFO L79 Accepts]: Start accepts. Automaton has 4891 states and 16778 transitions. Word has length 36 [2025-04-13 23:19:11,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:11,458 INFO L485 AbstractCegarLoop]: Abstraction has 4891 states and 16778 transitions. [2025-04-13 23:19:11,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:11,458 INFO L278 IsEmpty]: Start isEmpty. Operand 4891 states and 16778 transitions. [2025-04-13 23:19:11,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 23:19:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:11,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:11,472 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:19:11,666 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,SelfDestructingSolverStorable24 [2025-04-13 23:19:11,666 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:11,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash 54565654, now seen corresponding path program 1 times [2025-04-13 23:19:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:11,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708290042] [2025-04-13 23:19:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:11,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 23:19:11,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:19:11,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 23:19:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:11,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708290042] [2025-04-13 23:19:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708290042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:11,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120181960] [2025-04-13 23:19:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:11,751 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:19:11,752 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:19:11,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 23:19:11,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:19:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:11,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:19:11,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 23:19:11,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 23:19:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120181960] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:12,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 23:19:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931543872] [2025-04-13 23:19:12,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:12,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:19:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:19:12,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:19:12,018 INFO L87 Difference]: Start difference. First operand 4891 states and 16778 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:14,207 INFO L93 Difference]: Finished difference Result 9938 states and 34000 transitions. [2025-04-13 23:19:14,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:19:14,208 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 23:19:14,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:14,223 INFO L225 Difference]: With dead ends: 9938 [2025-04-13 23:19:14,224 INFO L226 Difference]: Without dead ends: 4658 [2025-04-13 23:19:14,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:19:14,231 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:14,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2025-04-13 23:19:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 4078. [2025-04-13 23:19:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 4077 states have (on average 3.3742948246259505) internal successors, (13757), 4077 states have internal predecessors, (13757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 13757 transitions. [2025-04-13 23:19:15,169 INFO L79 Accepts]: Start accepts. Automaton has 4078 states and 13757 transitions. Word has length 36 [2025-04-13 23:19:15,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:15,169 INFO L485 AbstractCegarLoop]: Abstraction has 4078 states and 13757 transitions. [2025-04-13 23:19:15,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:15,169 INFO L278 IsEmpty]: Start isEmpty. Operand 4078 states and 13757 transitions. [2025-04-13 23:19:15,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:19:15,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:15,175 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:15,182 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:19:15,376 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,SelfDestructingSolverStorable25 [2025-04-13 23:19:15,376 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:15,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:15,376 INFO L85 PathProgramCache]: Analyzing trace with hash 416888299, now seen corresponding path program 2 times [2025-04-13 23:19:15,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:15,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542924938] [2025-04-13 23:19:15,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:19:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:15,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 23:19:15,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:19:15,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:19:15,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 23:19:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:15,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542924938] [2025-04-13 23:19:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542924938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:15,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096347188] [2025-04-13 23:19:15,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:19:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:15,488 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:19:15,490 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:19:15,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 23:19:15,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:19:15,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:19:15,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:15,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:19:15,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:15,705 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:19:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:19:15,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:15,765 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:19:15,765 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 25 treesize of output 12 [2025-04-13 23:19:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:19:15,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096347188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:15,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:15,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 25 [2025-04-13 23:19:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538554658] [2025-04-13 23:19:15,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:15,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:19:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:19:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:19:15,962 INFO L87 Difference]: Start difference. First operand 4078 states and 13757 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:21,871 INFO L93 Difference]: Finished difference Result 17477 states and 60166 transitions. [2025-04-13 23:19:21,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:19:21,871 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 23:19:21,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:21,907 INFO L225 Difference]: With dead ends: 17477 [2025-04-13 23:19:21,907 INFO L226 Difference]: Without dead ends: 12352 [2025-04-13 23:19:21,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=756, Invalid=2666, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 23:19:21,916 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 636 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:21,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 0 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:19:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2025-04-13 23:19:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 7917. [2025-04-13 23:19:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7917 states, 7916 states have (on average 3.407023749368368) internal successors, (26970), 7916 states have internal predecessors, (26970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 26970 transitions. [2025-04-13 23:19:23,668 INFO L79 Accepts]: Start accepts. Automaton has 7917 states and 26970 transitions. Word has length 37 [2025-04-13 23:19:23,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:23,669 INFO L485 AbstractCegarLoop]: Abstraction has 7917 states and 26970 transitions. [2025-04-13 23:19:23,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:23,669 INFO L278 IsEmpty]: Start isEmpty. Operand 7917 states and 26970 transitions. [2025-04-13 23:19:23,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:19:23,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:23,680 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:23,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 23:19:23,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 23:19:23,881 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:23,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 947280909, now seen corresponding path program 3 times [2025-04-13 23:19:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:23,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782655846] [2025-04-13 23:19:23,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:23,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-04-13 23:19:23,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-04-13 23:19:23,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:19:23,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 23:19:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:24,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782655846] [2025-04-13 23:19:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782655846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:24,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694344239] [2025-04-13 23:19:24,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:24,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:24,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:24,029 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:19:24,030 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:19:24,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-04-13 23:19:24,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-04-13 23:19:24,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:19:24,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:24,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:19:24,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 23:19:24,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:24,238 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:19:24,238 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:19:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 23:19:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694344239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:24,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-13 23:19:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294446992] [2025-04-13 23:19:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:24,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:19:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:24,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:19:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:19:24,257 INFO L87 Difference]: Start difference. First operand 7917 states and 26970 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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:19:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:35,058 INFO L93 Difference]: Finished difference Result 36195 states and 132276 transitions. [2025-04-13 23:19:35,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:19:35,058 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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 37 [2025-04-13 23:19:35,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:35,167 INFO L225 Difference]: With dead ends: 36195 [2025-04-13 23:19:35,167 INFO L226 Difference]: Without dead ends: 30593 [2025-04-13 23:19:35,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:19:35,181 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 448 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:35,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 0 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:19:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30593 states. [2025-04-13 23:19:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30593 to 12493. [2025-04-13 23:19:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12493 states, 12492 states have (on average 3.5063240473903297) internal successors, (43801), 12492 states have internal predecessors, (43801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12493 states to 12493 states and 43801 transitions. [2025-04-13 23:19:38,542 INFO L79 Accepts]: Start accepts. Automaton has 12493 states and 43801 transitions. Word has length 37 [2025-04-13 23:19:38,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:38,542 INFO L485 AbstractCegarLoop]: Abstraction has 12493 states and 43801 transitions. [2025-04-13 23:19:38,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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:19:38,542 INFO L278 IsEmpty]: Start isEmpty. Operand 12493 states and 43801 transitions. [2025-04-13 23:19:38,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:19:38,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:38,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:38,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 23:19:38,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:38,761 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:38,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1922293672, now seen corresponding path program 12 times [2025-04-13 23:19:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:38,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782667744] [2025-04-13 23:19:38,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:19:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:38,768 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-04-13 23:19:38,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:19:38,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:19:38,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:38,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:38,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782667744] [2025-04-13 23:19:38,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782667744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:38,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140324730] [2025-04-13 23:19:38,818 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:19:38,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:38,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:38,820 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:19:38,821 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:19:38,885 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-04-13 23:19:38,912 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:19:38,912 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:19:38,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:38,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:19:38,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:38,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140324730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:39,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:39,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-13 23:19:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717233084] [2025-04-13 23:19:39,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:39,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:19:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:39,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:19:39,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:19:39,054 INFO L87 Difference]: Start difference. First operand 12493 states and 43801 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:47,419 INFO L93 Difference]: Finished difference Result 23790 states and 83920 transitions. [2025-04-13 23:19:47,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:19:47,419 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 23:19:47,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:47,508 INFO L225 Difference]: With dead ends: 23790 [2025-04-13 23:19:47,508 INFO L226 Difference]: Without dead ends: 22458 [2025-04-13 23:19:47,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:19:47,518 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:47,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2025-04-13 23:19:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 14574. [2025-04-13 23:19:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14574 states, 14573 states have (on average 3.548274205722912) internal successors, (51709), 14573 states have internal predecessors, (51709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14574 states to 14574 states and 51709 transitions. [2025-04-13 23:19:51,600 INFO L79 Accepts]: Start accepts. Automaton has 14574 states and 51709 transitions. Word has length 37 [2025-04-13 23:19:51,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:51,601 INFO L485 AbstractCegarLoop]: Abstraction has 14574 states and 51709 transitions. [2025-04-13 23:19:51,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:51,601 INFO L278 IsEmpty]: Start isEmpty. Operand 14574 states and 51709 transitions. [2025-04-13 23:19:51,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 23:19:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:51,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:51,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 23:19:51,825 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,SelfDestructingSolverStorable28 [2025-04-13 23:19:51,825 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:51,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash -876771067, now seen corresponding path program 4 times [2025-04-13 23:19:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:51,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56003179] [2025-04-13 23:19:51,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:19:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:51,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 23:19:51,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:19:51,837 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:19:51,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:51,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56003179] [2025-04-13 23:19:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56003179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:51,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42947815] [2025-04-13 23:19:51,911 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:19:51,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:51,913 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:19:51,915 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:19:51,982 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 23:19:52,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:19:52,022 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:19:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:52,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:19:52,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:52,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:52,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42947815] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:52,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 23:19:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615963610] [2025-04-13 23:19:52,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:52,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:19:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:52,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:19:52,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:19:52,227 INFO L87 Difference]: Start difference. First operand 14574 states and 51709 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:57,525 INFO L93 Difference]: Finished difference Result 18367 states and 64233 transitions. [2025-04-13 23:19:57,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:19:57,526 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 23:19:57,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:57,567 INFO L225 Difference]: With dead ends: 18367 [2025-04-13 23:19:57,567 INFO L226 Difference]: Without dead ends: 8526 [2025-04-13 23:19:57,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:19:57,580 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:57,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:19:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2025-04-13 23:19:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 8526. [2025-04-13 23:19:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8526 states, 8525 states have (on average 3.6347214076246335) internal successors, (30986), 8525 states have internal predecessors, (30986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 30986 transitions. [2025-04-13 23:20:00,015 INFO L79 Accepts]: Start accepts. Automaton has 8526 states and 30986 transitions. Word has length 40 [2025-04-13 23:20:00,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:00,015 INFO L485 AbstractCegarLoop]: Abstraction has 8526 states and 30986 transitions. [2025-04-13 23:20:00,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:00,015 INFO L278 IsEmpty]: Start isEmpty. Operand 8526 states and 30986 transitions. [2025-04-13 23:20:00,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 23:20:00,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:00,029 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:00,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 23:20:00,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:00,229 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:00,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1559757950, now seen corresponding path program 13 times [2025-04-13 23:20:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:00,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426386428] [2025-04-13 23:20:00,230 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:20:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:20:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:20:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:00,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 23:20:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:00,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426386428] [2025-04-13 23:20:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426386428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:00,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829344390] [2025-04-13 23:20:00,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:20:00,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:00,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:00,319 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:20:00,320 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:20:00,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:20:00,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:20:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:20:00,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 23:20:00,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:20:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829344390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:20:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-04-13 23:20:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323149047] [2025-04-13 23:20:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:00,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:20:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:00,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:20:00,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:20:00,465 INFO L87 Difference]: Start difference. First operand 8526 states and 30986 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:04,552 INFO L93 Difference]: Finished difference Result 10266 states and 36290 transitions. [2025-04-13 23:20:04,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:20:04,553 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 40 [2025-04-13 23:20:04,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:04,635 INFO L225 Difference]: With dead ends: 10266 [2025-04-13 23:20:04,635 INFO L226 Difference]: Without dead ends: 9499 [2025-04-13 23:20:04,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 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:20:04,638 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:04,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2025-04-13 23:20:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 8908. [2025-04-13 23:20:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8908 states, 8907 states have (on average 3.6281576288312563) internal successors, (32316), 8907 states have internal predecessors, (32316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 32316 transitions. [2025-04-13 23:20:07,152 INFO L79 Accepts]: Start accepts. Automaton has 8908 states and 32316 transitions. Word has length 40 [2025-04-13 23:20:07,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:07,152 INFO L485 AbstractCegarLoop]: Abstraction has 8908 states and 32316 transitions. [2025-04-13 23:20:07,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:07,152 INFO L278 IsEmpty]: Start isEmpty. Operand 8908 states and 32316 transitions. [2025-04-13 23:20:07,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:20:07,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:07,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:07,172 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:20:07,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:07,366 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:07,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1246730765, now seen corresponding path program 5 times [2025-04-13 23:20:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:07,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790198722] [2025-04-13 23:20:07,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:20:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:07,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:20:07,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:20:07,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:20:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:07,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790198722] [2025-04-13 23:20:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790198722] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:07,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229881900] [2025-04-13 23:20:07,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:20:07,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:07,944 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:20:07,945 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:20:08,018 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:20:08,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:20:08,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:20:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:08,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:20:08,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:08,126 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 24 treesize of output 8 [2025-04-13 23:20:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:20:08,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:08,164 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:20:08,164 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 11 [2025-04-13 23:20:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:20:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229881900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:20:08,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:20:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 25 [2025-04-13 23:20:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111997755] [2025-04-13 23:20:08,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:20:08,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:20:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:20:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:20:08,185 INFO L87 Difference]: Start difference. First operand 8908 states and 32316 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:50,759 INFO L93 Difference]: Finished difference Result 97173 states and 372639 transitions. [2025-04-13 23:20:50,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2025-04-13 23:20:50,759 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 23:20:50,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:51,121 INFO L225 Difference]: With dead ends: 97173 [2025-04-13 23:20:51,121 INFO L226 Difference]: Without dead ends: 83262 [2025-04-13 23:20:51,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33854 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8045, Invalid=71761, Unknown=0, NotChecked=0, Total=79806 [2025-04-13 23:20:51,165 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2003 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6506 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 6506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:51,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 0 Invalid, 6739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 6506 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 23:20:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83262 states. [2025-04-13 23:21:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83262 to 35189. [2025-04-13 23:21:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35189 states, 35188 states have (on average 4.047601455041492) internal successors, (142427), 35188 states have internal predecessors, (142427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35189 states to 35189 states and 142427 transitions. [2025-04-13 23:21:01,551 INFO L79 Accepts]: Start accepts. Automaton has 35189 states and 142427 transitions. Word has length 41 [2025-04-13 23:21:01,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:01,552 INFO L485 AbstractCegarLoop]: Abstraction has 35189 states and 142427 transitions. [2025-04-13 23:21:01,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:01,552 INFO L278 IsEmpty]: Start isEmpty. Operand 35189 states and 142427 transitions. [2025-04-13 23:21:01,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:21:01,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:01,601 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:21:01,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 23:21:01,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:01,801 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:21:01,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1968007867, now seen corresponding path program 6 times [2025-04-13 23:21:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:01,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99700646] [2025-04-13 23:21:01,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:21:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:01,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:21:01,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:21:01,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:21:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:21:02,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:02,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99700646] [2025-04-13 23:21:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99700646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:21:02,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522220716] [2025-04-13 23:21:02,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:21:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:21:02,444 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:21:02,445 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:21:02,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:21:02,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:21:02,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:21:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:02,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:21:02,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:21:02,683 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 23 treesize of output 7 [2025-04-13 23:21:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:21:02,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:21:02,756 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:21:02,756 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 11 [2025-04-13 23:21:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:21:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522220716] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:21:02,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:21:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 6, 7] total 31 [2025-04-13 23:21:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043540162] [2025-04-13 23:21:02,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:21:02,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:21:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:02,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:21:02,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:21:02,869 INFO L87 Difference]: Start difference. First operand 35189 states and 142427 transitions. Second operand has 32 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:21:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:21:58,092 INFO L93 Difference]: Finished difference Result 114145 states and 449544 transitions. [2025-04-13 23:21:58,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-04-13 23:21:58,093 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 23:21:58,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:21:58,661 INFO L225 Difference]: With dead ends: 114145 [2025-04-13 23:21:58,661 INFO L226 Difference]: Without dead ends: 113635 [2025-04-13 23:21:58,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14244 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4785, Invalid=33827, Unknown=0, NotChecked=0, Total=38612 [2025-04-13 23:21:58,705 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1310 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6831 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 6831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:21:58,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 0 Invalid, 7044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 6831 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 23:21:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113635 states. [2025-04-13 23:22:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113635 to 53210. [2025-04-13 23:22:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53210 states, 53209 states have (on average 4.188859027608111) internal successors, (222885), 53209 states have internal predecessors, (222885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53210 states to 53210 states and 222885 transitions. [2025-04-13 23:22:14,578 INFO L79 Accepts]: Start accepts. Automaton has 53210 states and 222885 transitions. Word has length 41 [2025-04-13 23:22:14,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:14,578 INFO L485 AbstractCegarLoop]: Abstraction has 53210 states and 222885 transitions. [2025-04-13 23:22:14,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:14,578 INFO L278 IsEmpty]: Start isEmpty. Operand 53210 states and 222885 transitions. [2025-04-13 23:22:14,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:22:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:14,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:14,643 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:22:14,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:14,838 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:22:14,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -542937429, now seen corresponding path program 7 times [2025-04-13 23:22:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:14,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519621610] [2025-04-13 23:22:14,838 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:22:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:14,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 23:22:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:22:14,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:22:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:22:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:15,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519621610] [2025-04-13 23:22:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519621610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:22:15,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914616822] [2025-04-13 23:22:15,260 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:22:15,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:15,262 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:22:15,263 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:22:15,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 23:22:15,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:22:15,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:22:15,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:15,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:22:15,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:22:15,754 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:22:15,755 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 60 [2025-04-13 23:22:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:22:15,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:22:16,063 INFO L325 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-04-13 23:22:16,063 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 43 treesize of output 99 [2025-04-13 23:22:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:22:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914616822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:22:17,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:22:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 15] total 45 [2025-04-13 23:22:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683638475] [2025-04-13 23:22:17,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:22:17,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 23:22:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:17,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 23:22:17,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1814, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:22:17,219 INFO L87 Difference]: Start difference. First operand 53210 states and 222885 transitions. Second operand has 46 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 45 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:21,032 INFO L93 Difference]: Finished difference Result 143266 states and 557762 transitions. [2025-04-13 23:23:21,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:23:21,033 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 45 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 23:23:21,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:21,416 INFO L225 Difference]: With dead ends: 143266 [2025-04-13 23:23:21,417 INFO L226 Difference]: Without dead ends: 41559 [2025-04-13 23:23:21,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2514 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1629, Invalid=9501, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 23:23:21,539 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:21,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 0 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:23:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41559 states. [2025-04-13 23:23:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41559 to 12541. [2025-04-13 23:23:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12541 states, 12540 states have (on average 3.5842105263157893) internal successors, (44946), 12540 states have internal predecessors, (44946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12541 states to 12541 states and 44946 transitions. [2025-04-13 23:23:27,974 INFO L79 Accepts]: Start accepts. Automaton has 12541 states and 44946 transitions. Word has length 41 [2025-04-13 23:23:27,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:27,975 INFO L485 AbstractCegarLoop]: Abstraction has 12541 states and 44946 transitions. [2025-04-13 23:23:27,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 45 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:27,976 INFO L278 IsEmpty]: Start isEmpty. Operand 12541 states and 44946 transitions. [2025-04-13 23:23:28,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:23:28,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:28,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:28,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 23:23:28,209 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,SelfDestructingSolverStorable33 [2025-04-13 23:23:28,209 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:23:28,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2106938093, now seen corresponding path program 8 times [2025-04-13 23:23:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:28,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582330831] [2025-04-13 23:23:28,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:28,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 23:23:28,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:23:28,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:23:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:29,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582330831] [2025-04-13 23:23:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582330831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:23:29,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330534757] [2025-04-13 23:23:29,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:29,062 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:23:29,064 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:23:29,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 23:23:29,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:23:29,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:23:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:29,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 23:23:29,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:23:30,083 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-13 23:23:30,083 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 22 treesize of output 7 [2025-04-13 23:23:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:30,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:30,557 INFO L325 Elim1Store]: treesize reduction 23, result has 76.3 percent of original size [2025-04-13 23:23:30,558 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 86 [2025-04-13 23:23:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330534757] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:31,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 20] total 49 [2025-04-13 23:23:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792479268] [2025-04-13 23:23:31,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:31,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 23:23:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 23:23:31,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2032, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 23:23:31,435 INFO L87 Difference]: Start difference. First operand 12541 states and 44946 transitions. Second operand has 50 states, 50 states have (on average 2.26) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:22,440 INFO L93 Difference]: Finished difference Result 40068 states and 137546 transitions. [2025-04-13 23:24:22,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2025-04-13 23:24:22,440 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 23:24:22,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:22,657 INFO L225 Difference]: With dead ends: 40068 [2025-04-13 23:24:22,657 INFO L226 Difference]: Without dead ends: 38503 [2025-04-13 23:24:22,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48066 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=13928, Invalid=102012, Unknown=0, NotChecked=0, Total=115940 [2025-04-13 23:24:22,680 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2458 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10026 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 10026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:22,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2458 Valid, 0 Invalid, 10589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 10026 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-04-13 23:24:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38503 states. [2025-04-13 23:24:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38503 to 16183. [2025-04-13 23:24:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16183 states, 16182 states have (on average 3.616672846372513) internal successors, (58525), 16182 states have internal predecessors, (58525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16183 states to 16183 states and 58525 transitions. [2025-04-13 23:24:30,061 INFO L79 Accepts]: Start accepts. Automaton has 16183 states and 58525 transitions. Word has length 41 [2025-04-13 23:24:30,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:30,061 INFO L485 AbstractCegarLoop]: Abstraction has 16183 states and 58525 transitions. [2025-04-13 23:24:30,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:30,061 INFO L278 IsEmpty]: Start isEmpty. Operand 16183 states and 58525 transitions. [2025-04-13 23:24:30,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:24:30,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:30,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:30,098 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:24:30,291 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,SelfDestructingSolverStorable34 [2025-04-13 23:24:30,291 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:24:30,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -297517613, now seen corresponding path program 9 times [2025-04-13 23:24:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:30,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840384470] [2025-04-13 23:24:30,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:30,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:24:30,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 23:24:30,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:24:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 23:24:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:30,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840384470] [2025-04-13 23:24:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840384470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:24:30,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786703189] [2025-04-13 23:24:30,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:24:30,573 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:24:30,574 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:24:30,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:24:30,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 23:24:30,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:24:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:30,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:24:30,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:24:30,864 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 24 treesize of output 8 [2025-04-13 23:24:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:24:30,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:24:30,904 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:24:30,905 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 25 treesize of output 13 [2025-04-13 23:24:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:24:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786703189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:24:30,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:24:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2025-04-13 23:24:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375650489] [2025-04-13 23:24:30,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:24:30,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:24:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:30,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:24:30,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:24:30,932 INFO L87 Difference]: Start difference. First operand 16183 states and 58525 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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:24:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:46,922 INFO L93 Difference]: Finished difference Result 24384 states and 86711 transitions. [2025-04-13 23:24:46,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:24:46,922 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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 41 [2025-04-13 23:24:46,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:47,069 INFO L225 Difference]: With dead ends: 24384 [2025-04-13 23:24:47,069 INFO L226 Difference]: Without dead ends: 23886 [2025-04-13 23:24:47,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:24:47,078 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 298 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:47,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 0 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:24:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23886 states. [2025-04-13 23:24:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23886 to 16344. [2025-04-13 23:24:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16344 states, 16343 states have (on average 3.58489873340268) internal successors, (58588), 16343 states have internal predecessors, (58588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 58588 transitions. [2025-04-13 23:24:54,616 INFO L79 Accepts]: Start accepts. Automaton has 16344 states and 58588 transitions. Word has length 41 [2025-04-13 23:24:54,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:54,616 INFO L485 AbstractCegarLoop]: Abstraction has 16344 states and 58588 transitions. [2025-04-13 23:24:54,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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:24:54,616 INFO L278 IsEmpty]: Start isEmpty. Operand 16344 states and 58588 transitions. [2025-04-13 23:24:54,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:24:54,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:54,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:54,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 23:24:54,850 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,SelfDestructingSolverStorable35 [2025-04-13 23:24:54,850 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:24:54,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash -668591255, now seen corresponding path program 10 times [2025-04-13 23:24:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:54,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937384121] [2025-04-13 23:24:54,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:54,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 23:24:54,872 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:24:54,873 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:54,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:55,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937384121] [2025-04-13 23:24:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937384121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:24:55,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717387985] [2025-04-13 23:24:55,726 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:24:55,728 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:24:55,730 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:24:55,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 23:24:55,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:24:55,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:55,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:24:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:24:56,052 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 24 treesize of output 8 [2025-04-13 23:24:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:24:56,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:24:56,207 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 23:24:56,208 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 11 [2025-04-13 23:24:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:24:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717387985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:24:56,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:24:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7, 7] total 31 [2025-04-13 23:24:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377503431] [2025-04-13 23:24:56,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:24:56,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:24:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:24:56,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:24:56,328 INFO L87 Difference]: Start difference. First operand 16344 states and 58588 transitions. Second operand has 32 states, 32 states have (on average 3.09375) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:35,345 INFO L93 Difference]: Finished difference Result 50960 states and 185044 transitions. [2025-04-13 23:25:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-04-13 23:25:35,346 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 23:25:35,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:35,589 INFO L225 Difference]: With dead ends: 50960 [2025-04-13 23:25:35,589 INFO L226 Difference]: Without dead ends: 50473 [2025-04-13 23:25:35,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2889, Invalid=22233, Unknown=0, NotChecked=0, Total=25122 [2025-04-13 23:25:35,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1012 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4564 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:35,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 0 Invalid, 4684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4564 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:25:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50473 states. [2025-04-13 23:25:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50473 to 23136. [2025-04-13 23:25:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23136 states, 23135 states have (on average 3.6878755132915497) internal successors, (85319), 23135 states have internal predecessors, (85319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23136 states to 23136 states and 85319 transitions. [2025-04-13 23:25:46,668 INFO L79 Accepts]: Start accepts. Automaton has 23136 states and 85319 transitions. Word has length 41 [2025-04-13 23:25:46,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:46,668 INFO L485 AbstractCegarLoop]: Abstraction has 23136 states and 85319 transitions. [2025-04-13 23:25:46,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:46,669 INFO L278 IsEmpty]: Start isEmpty. Operand 23136 states and 85319 transitions. [2025-04-13 23:25:46,699 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 23:25:46,699 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:46,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:46,705 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:25:46,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:46,900 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:25:46,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1221920335, now seen corresponding path program 11 times [2025-04-13 23:25:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:46,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121214036] [2025-04-13 23:25:46,900 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:46,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:25:46,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:25:46,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:25:46,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:47,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121214036] [2025-04-13 23:25:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121214036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:47,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23004688] [2025-04-13 23:25:47,727 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:47,730 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:25:47,732 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:25:47,815 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 23:25:47,856 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 23:25:47,856 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:25:47,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:47,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:25:47,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:47,973 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 23 treesize of output 1 [2025-04-13 23:25:48,009 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 23 treesize of output 1 [2025-04-13 23:25:48,458 INFO L325 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2025-04-13 23:25:48,458 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 34 treesize of output 13 [2025-04-13 23:25:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:25:48,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:54,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:54,964 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 639 treesize of output 623 [2025-04-13 23:25:55,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:55,434 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 43 treesize of output 37 [2025-04-13 23:25:55,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:25:55,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2025-04-13 23:25:55,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:25:55,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2025-04-13 23:25:55,469 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 23:25:55,470 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 43 treesize of output 1 [2025-04-13 23:25:55,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:25:55,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2025-04-13 23:25:56,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:56,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 999 treesize of output 1610 [2025-04-13 23:26:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:26:00,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23004688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:26:00,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:26:00,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 48 [2025-04-13 23:26:00,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551621194] [2025-04-13 23:26:00,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:26:00,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 23:26:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:00,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 23:26:00,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2129, Unknown=1, NotChecked=0, Total=2352 [2025-04-13 23:26:00,163 INFO L87 Difference]: Start difference. First operand 23136 states and 85319 transitions. Second operand has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 48 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,035 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:26:11,735 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:26:16,515 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:26:21,886 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 [1] [2025-04-13 23:26:26,293 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:26:31,362 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:26:35,996 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:26:41,005 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 [1] [2025-04-13 23:26:45,614 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:26:47,217 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:26:51,444 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:26:56,607 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:27:01,635 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:27:06,815 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-13 23:27:23,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-04-13 23:27:23,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10522 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=3920, Invalid=27941, Unknown=1, NotChecked=0, Total=31862 [2025-04-13 23:27:23,080 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1009 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7416 mSolverCounterSat, 249 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 7416 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:23,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 0 Invalid, 7677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 7416 Invalid, 12 Unknown, 0 Unchecked, 57.0s Time] [2025-04-13 23:27:23,082 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:27:23,090 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:27:23,091 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:27:23,094 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:27:23,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 23:27:23,283 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (23136states) and FLOYD_HOARE automaton (currently 147 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (10123 states constructed, input type IntersectNwa). [2025-04-13 23:27:23,286 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:27:23,287 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:27:23,287 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:27:23,296 INFO L422 BasicCegarLoop]: Path program histogram: [13, 11, 4, 2, 2, 2, 1, 1, 1, 1] [2025-04-13 23:27:23,299 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:27:23,299 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:27:23,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:27:23 BasicIcfg [2025-04-13 23:27:23,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:27:23,306 INFO L158 Benchmark]: Toolchain (without parser) took 815731.48ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 99.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.24ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.11ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: IcfgBuilder took 693.74ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 70.5MB in the end (delta: 9.2MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2025-04-13 23:27:23,306 INFO L158 Benchmark]: TraceAbstraction took 814761.95ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 69.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 23:27:23,312 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.24ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 83.9MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.11ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 693.74ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 70.5MB in the end (delta: 9.2MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. * TraceAbstraction took 814761.95ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 69.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (23136states) and FLOYD_HOARE automaton (currently 147 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (10123 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (23136states) and FLOYD_HOARE automaton (currently 147 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (10123 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (23136states) and FLOYD_HOARE automaton (currently 147 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (10123 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (23136states) and FLOYD_HOARE automaton (currently 147 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (10123 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 814.7s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.5s, AutomataDifference: 618.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 17501 SdHoareTripleChecker+Valid, 246.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17501 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 240.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 211 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3800 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85940 IncrementalHoareTripleChecker+Invalid, 90000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3800 mSolverCounterUnsat, 0 mSDtfsCounter, 85940 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4022 GetRequests, 1566 SyntacticMatches, 9 SemanticMatches, 2447 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152689 ImplicationChecksByTransitivity, 152.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53210occurred in iteration=33, InterpolantAutomatonStates: 1876, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 84.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 278372 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 100.8s InterpolantComputationTime, 2320 NumberOfCodeBlocks, 2302 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 3202 ConstructedInterpolants, 199 QuantifiedInterpolants, 47722 SizeOfPredicates, 338 NumberOfNonLiveVariables, 8404 ConjunctsInSsa, 759 ConjunctsInUnsatCore, 94 InterpolantComputations, 11 PerfectInterpolantSequences, 523/1004 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